./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_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_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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 c336041bbe834e5f5652b9c9de80bd23d0aa7014 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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 c336041bbe834e5f5652b9c9de80bd23d0aa7014 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-10 05:23:06,559 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:23:06,560 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:23:06,568 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:23:06,568 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:23:06,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:23:06,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:23:06,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:23:06,571 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:23:06,572 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:23:06,573 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:23:06,573 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:23:06,573 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:23:06,574 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:23:06,575 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:23:06,576 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:23:06,576 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:23:06,577 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:23:06,579 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:23:06,580 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:23:06,581 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:23:06,581 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:23:06,583 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:23:06,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:23:06,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:23:06,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:23:06,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:23:06,585 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:23:06,586 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:23:06,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:23:06,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:23:06,587 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:23:06,588 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:23:06,588 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:23:06,588 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:23:06,589 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:23:06,589 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 05:23:06,599 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:23:06,600 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:23:06,600 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:23:06,600 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:23:06,601 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 05:23:06,601 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:23:06,602 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:23:06,602 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:23:06,602 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 05:23:06,602 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:23:06,603 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:23:06,604 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:23:06,604 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:23:06,604 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:23:06,604 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:23:06,604 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:23:06,604 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:23:06,604 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 05:23:06,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 05:23:06,605 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_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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 -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-11-10 05:23:06,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:23:06,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:23:06,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:23:06,639 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:23:06,640 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:23:06,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:23:06,677 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/ada43731f/e91a3bda841b4f30a78e3d3d4ac6edf5/FLAGbb6ba76ed [2018-11-10 05:23:07,049 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:23:07,049 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:23:07,062 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/ada43731f/e91a3bda841b4f30a78e3d3d4ac6edf5/FLAGbb6ba76ed [2018-11-10 05:23:07,073 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/ada43731f/e91a3bda841b4f30a78e3d3d4ac6edf5 [2018-11-10 05:23:07,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:23:07,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:23:07,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:23:07,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:23:07,078 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:23:07,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:07,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc45616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07, skipping insertion in model container [2018-11-10 05:23:07,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:07,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:23:07,134 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:23:07,613 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:23:07,621 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:23:07,946 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:23:07,961 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:23:07,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07 WrapperNode [2018-11-10 05:23:07,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:23:07,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:23:07,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:23:07,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:23:07,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:07,986 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:23:08,028 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:23:08,029 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:23:08,029 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:23:08,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,049 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,091 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... [2018-11-10 05:23:08,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:23:08,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:23:08,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:23:08,105 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:23:08,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:23:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:23:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:23:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 05:23:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 05:23:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:23:08,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:23:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:23:08,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:23:08,572 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:23:08,573 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:23:09,019 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:23:09,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:23:09 BoogieIcfgContainer [2018-11-10 05:23:09,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:23:09,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:23:09,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:23:09,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:23:09,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:07" (1/3) ... [2018-11-10 05:23:09,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747efd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:09, skipping insertion in model container [2018-11-10 05:23:09,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:07" (2/3) ... [2018-11-10 05:23:09,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747efd8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:09, skipping insertion in model container [2018-11-10 05:23:09,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:23:09" (3/3) ... [2018-11-10 05:23:09,025 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:23:09,032 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:23:09,040 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:23:09,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:23:09,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:23:09,072 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:23:09,072 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:23:09,072 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:23:09,072 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:23:09,072 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:23:09,072 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:23:09,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:23:09,087 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 05:23:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 05:23:09,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:09,094 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:09,096 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:09,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash 661829922, now seen corresponding path program 1 times [2018-11-10 05:23:09,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,138 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:09,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:23:09,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:09,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:09,352 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:09,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:09,366 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 05:23:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:09,474 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 05:23:09,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:09,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 05:23:09,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:09,485 INFO L225 Difference]: With dead ends: 438 [2018-11-10 05:23:09,485 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 05:23:09,488 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-11-10 05:23:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 05:23:09,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 05:23:09,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 05:23:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 05:23:09,532 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 05:23:09,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:09,533 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 05:23:09,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 05:23:09,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:23:09,536 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:09,536 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:09,536 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:09,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:09,536 INFO L82 PathProgramCache]: Analyzing trace with hash 233986428, now seen corresponding path program 1 times [2018-11-10 05:23:09,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:09,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,538 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:23:09,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:09,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:09,683 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:09,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:09,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:09,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:09,685 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 4 states. [2018-11-10 05:23:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:09,944 INFO L93 Difference]: Finished difference Result 439 states and 663 transitions. [2018-11-10 05:23:09,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:09,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 05:23:09,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:09,947 INFO L225 Difference]: With dead ends: 439 [2018-11-10 05:23:09,947 INFO L226 Difference]: Without dead ends: 311 [2018-11-10 05:23:09,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:09,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-10 05:23:09,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-11-10 05:23:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-10 05:23:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 438 transitions. [2018-11-10 05:23:09,964 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 438 transitions. Word has length 60 [2018-11-10 05:23:09,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:09,964 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 438 transitions. [2018-11-10 05:23:09,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:09,964 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 438 transitions. [2018-11-10 05:23:09,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 05:23:09,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:09,967 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-11-10 05:23:09,967 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:09,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2094117069, now seen corresponding path program 1 times [2018-11-10 05:23:09,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:09,970 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:09,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:23:10,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,047 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,048 INFO L87 Difference]: Start difference. First operand 290 states and 438 transitions. Second operand 3 states. [2018-11-10 05:23:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,090 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2018-11-10 05:23:10,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 05:23:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,093 INFO L225 Difference]: With dead ends: 587 [2018-11-10 05:23:10,093 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 05:23:10,094 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-11-10 05:23:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 05:23:10,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-11-10 05:23:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-10 05:23:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2018-11-10 05:23:10,110 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 74 [2018-11-10 05:23:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,110 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2018-11-10 05:23:10,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2018-11-10 05:23:10,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 05:23:10,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,114 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 05:23:10,114 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,114 INFO L82 PathProgramCache]: Analyzing trace with hash 540992405, now seen corresponding path program 1 times [2018-11-10 05:23:10,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,116 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:23:10,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,195 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,196 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand 3 states. [2018-11-10 05:23:10,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,258 INFO L93 Difference]: Finished difference Result 882 states and 1351 transitions. [2018-11-10 05:23:10,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 05:23:10,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,260 INFO L225 Difference]: With dead ends: 882 [2018-11-10 05:23:10,260 INFO L226 Difference]: Without dead ends: 585 [2018-11-10 05:23:10,261 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-11-10 05:23:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-10 05:23:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2018-11-10 05:23:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-10 05:23:10,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 888 transitions. [2018-11-10 05:23:10,276 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 888 transitions. Word has length 83 [2018-11-10 05:23:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,276 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 888 transitions. [2018-11-10 05:23:10,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,276 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 888 transitions. [2018-11-10 05:23:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 05:23:10,278 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,278 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:10,278 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2108182396, now seen corresponding path program 1 times [2018-11-10 05:23:10,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,281 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,359 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:10,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,359 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,360 INFO L87 Difference]: Start difference. First operand 585 states and 888 transitions. Second operand 3 states. [2018-11-10 05:23:10,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,416 INFO L93 Difference]: Finished difference Result 1182 states and 1810 transitions. [2018-11-10 05:23:10,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 05:23:10,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,418 INFO L225 Difference]: With dead ends: 1182 [2018-11-10 05:23:10,418 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 05:23:10,419 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-11-10 05:23:10,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 05:23:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-11-10 05:23:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 05:23:10,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1121 transitions. [2018-11-10 05:23:10,432 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1121 transitions. Word has length 108 [2018-11-10 05:23:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,433 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1121 transitions. [2018-11-10 05:23:10,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,433 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1121 transitions. [2018-11-10 05:23:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 05:23:10,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,435 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:10,435 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1078782754, now seen corresponding path program 1 times [2018-11-10 05:23:10,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:10,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,505 INFO L87 Difference]: Start difference. First operand 734 states and 1121 transitions. Second operand 3 states. [2018-11-10 05:23:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,551 INFO L93 Difference]: Finished difference Result 1480 states and 2274 transitions. [2018-11-10 05:23:10,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-10 05:23:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,554 INFO L225 Difference]: With dead ends: 1480 [2018-11-10 05:23:10,554 INFO L226 Difference]: Without dead ends: 885 [2018-11-10 05:23:10,555 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-11-10 05:23:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-11-10 05:23:10,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2018-11-10 05:23:10,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-11-10 05:23:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1340 transitions. [2018-11-10 05:23:10,570 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1340 transitions. Word has length 114 [2018-11-10 05:23:10,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,570 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1340 transitions. [2018-11-10 05:23:10,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1340 transitions. [2018-11-10 05:23:10,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 05:23:10,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,573 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:10,574 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2100845977, now seen corresponding path program 1 times [2018-11-10 05:23:10,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,575 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:10,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,661 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,662 INFO L87 Difference]: Start difference. First operand 883 states and 1340 transitions. Second operand 3 states. [2018-11-10 05:23:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,707 INFO L93 Difference]: Finished difference Result 1776 states and 2711 transitions. [2018-11-10 05:23:10,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-10 05:23:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,711 INFO L225 Difference]: With dead ends: 1776 [2018-11-10 05:23:10,711 INFO L226 Difference]: Without dead ends: 1032 [2018-11-10 05:23:10,712 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-11-10 05:23:10,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-11-10 05:23:10,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-11-10 05:23:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-10 05:23:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1570 transitions. [2018-11-10 05:23:10,728 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1570 transitions. Word has length 131 [2018-11-10 05:23:10,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,729 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1570 transitions. [2018-11-10 05:23:10,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1570 transitions. [2018-11-10 05:23:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 05:23:10,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,731 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:10,731 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash 483748542, now seen corresponding path program 1 times [2018-11-10 05:23:10,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,732 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 05:23:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:10,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:23:10,816 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:10,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:23:10,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:23:10,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:23:10,817 INFO L87 Difference]: Start difference. First operand 1032 states and 1570 transitions. Second operand 3 states. [2018-11-10 05:23:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:10,876 INFO L93 Difference]: Finished difference Result 1185 states and 1800 transitions. [2018-11-10 05:23:10,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:23:10,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 05:23:10,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:10,879 INFO L225 Difference]: With dead ends: 1185 [2018-11-10 05:23:10,879 INFO L226 Difference]: Without dead ends: 1183 [2018-11-10 05:23:10,880 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-11-10 05:23:10,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-10 05:23:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2018-11-10 05:23:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-10 05:23:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1797 transitions. [2018-11-10 05:23:10,902 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1797 transitions. Word has length 138 [2018-11-10 05:23:10,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:10,903 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1797 transitions. [2018-11-10 05:23:10,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:23:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1797 transitions. [2018-11-10 05:23:10,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:23:10,905 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:10,905 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:10,906 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:10,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:10,906 INFO L82 PathProgramCache]: Analyzing trace with hash 683885949, now seen corresponding path program 1 times [2018-11-10 05:23:10,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:10,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:10,908 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 05:23:11,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:11,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:11,058 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:11,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:11,059 INFO L87 Difference]: Start difference. First operand 1181 states and 1797 transitions. Second operand 4 states. [2018-11-10 05:23:11,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:11,308 INFO L93 Difference]: Finished difference Result 2865 states and 4374 transitions. [2018-11-10 05:23:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:11,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-11-10 05:23:11,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:11,313 INFO L225 Difference]: With dead ends: 2865 [2018-11-10 05:23:11,313 INFO L226 Difference]: Without dead ends: 1698 [2018-11-10 05:23:11,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2018-11-10 05:23:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1413. [2018-11-10 05:23:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1413 states. [2018-11-10 05:23:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2205 transitions. [2018-11-10 05:23:11,342 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2205 transitions. Word has length 175 [2018-11-10 05:23:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:11,342 INFO L481 AbstractCegarLoop]: Abstraction has 1413 states and 2205 transitions. [2018-11-10 05:23:11,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2205 transitions. [2018-11-10 05:23:11,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:23:11,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:11,345 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:11,345 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:11,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:11,346 INFO L82 PathProgramCache]: Analyzing trace with hash -401542991, now seen corresponding path program 1 times [2018-11-10 05:23:11,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:11,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:11,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:11,347 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:11,659 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 153 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:11,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:23:11,660 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 05:23:11,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-10 05:23:11,662 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [115], [120], [125], [130], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [188], [190], [195], [198], [200], [205], [208], [279], [282], [290], [292], [295], [303], [306], [310], [501], [504], [520], [525], [528], [536], [541], [543], [546], [554], [557], [561], [582], [616], [618], [630], [633], [634], [635], [637] [2018-11-10 05:23:11,703 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 05:23:11,703 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 05:23:12,585 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 05:23:50,845 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 05:23:50,846 INFO L272 AbstractInterpreter]: Visited 77 different actions 529 times. Merged at 64 different actions 421 times. Widened at 8 different actions 27 times. Found 21 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 05:23:50,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:50,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 05:23:50,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:23:50,870 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:23:50,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:50,878 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 05:23:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:51,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:23:51,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-10 05:23:51,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,287 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 13 treesize of output 10 [2018-11-10 05:23:51,293 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-11-10 05:23:51,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,307 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 23 treesize of output 20 [2018-11-10 05:23:51,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 05:23:51,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:23:51,315 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 05:23:51,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:23:51,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:23:51,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:23:51,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 05:23:51,323 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,336 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,349 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 05:23:51,401 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 21 treesize of output 17 [2018-11-10 05:23:51,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 05:23:51,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 05:23:51,427 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 23 treesize of output 22 [2018-11-10 05:23:51,428 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,446 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 05:23:51,465 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-11-10 05:23:51,467 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-11-10 05:23:51,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 05:23:51,489 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 34 treesize of output 28 [2018-11-10 05:23:51,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 28 treesize of output 16 [2018-11-10 05:23:51,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:23:51,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:23:51,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 05:23:51,509 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-11-10 05:23:51,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,513 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,519 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 05:23:51,536 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 21 treesize of output 16 [2018-11-10 05:23:51,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:23:51,541 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 16 treesize of output 23 [2018-11-10 05:23:51,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 05:23:51,556 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-11-10 05:23:51,557 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-11-10 05:23:51,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 05:23:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:51,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:23:51,733 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 05:23:51,752 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 11 treesize of output 10 [2018-11-10 05:23:51,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,759 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 10 treesize of output 8 [2018-11-10 05:23:51,761 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 8 treesize of output 1 [2018-11-10 05:23:51,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,763 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:23:51,772 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 05:23:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:23:52,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 05:23:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-11-10 05:23:52,055 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 05:23:52,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 05:23:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 05:23:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-10 05:23:52,056 INFO L87 Difference]: Start difference. First operand 1413 states and 2205 transitions. Second operand 16 states. [2018-11-10 05:23:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:53,392 INFO L93 Difference]: Finished difference Result 3515 states and 5476 transitions. [2018-11-10 05:23:53,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 05:23:53,393 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2018-11-10 05:23:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:53,397 INFO L225 Difference]: With dead ends: 3515 [2018-11-10 05:23:53,397 INFO L226 Difference]: Without dead ends: 2116 [2018-11-10 05:23:53,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 342 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-11-10 05:23:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2018-11-10 05:23:53,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1677. [2018-11-10 05:23:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-11-10 05:23:53,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2677 transitions. [2018-11-10 05:23:53,445 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2677 transitions. Word has length 175 [2018-11-10 05:23:53,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:53,445 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2677 transitions. [2018-11-10 05:23:53,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 05:23:53,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2677 transitions. [2018-11-10 05:23:53,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 05:23:53,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:53,448 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:53,448 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:53,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:53,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1536919987, now seen corresponding path program 1 times [2018-11-10 05:23:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:53,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:53,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:53,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:53,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:53,564 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-10 05:23:53,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:53,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:53,564 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:53,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:53,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:53,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:53,565 INFO L87 Difference]: Start difference. First operand 1677 states and 2677 transitions. Second operand 4 states. [2018-11-10 05:23:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:53,775 INFO L93 Difference]: Finished difference Result 3580 states and 5689 transitions. [2018-11-10 05:23:53,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:53,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 05:23:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:53,779 INFO L225 Difference]: With dead ends: 3580 [2018-11-10 05:23:53,779 INFO L226 Difference]: Without dead ends: 1917 [2018-11-10 05:23:53,781 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-11-10 05:23:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-11-10 05:23:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1813. [2018-11-10 05:23:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-11-10 05:23:53,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2893 transitions. [2018-11-10 05:23:53,822 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2893 transitions. Word has length 190 [2018-11-10 05:23:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:53,822 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2893 transitions. [2018-11-10 05:23:53,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2893 transitions. [2018-11-10 05:23:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 05:23:53,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:53,825 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:53,825 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:53,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:53,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1388458087, now seen corresponding path program 1 times [2018-11-10 05:23:53,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:53,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:53,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:53,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:53,827 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 05:23:53,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:53,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:53,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:53,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:53,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:53,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:53,923 INFO L87 Difference]: Start difference. First operand 1813 states and 2893 transitions. Second operand 4 states. [2018-11-10 05:23:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:54,261 INFO L93 Difference]: Finished difference Result 4579 states and 7229 transitions. [2018-11-10 05:23:54,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:54,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 05:23:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:54,267 INFO L225 Difference]: With dead ends: 4579 [2018-11-10 05:23:54,267 INFO L226 Difference]: Without dead ends: 2780 [2018-11-10 05:23:54,270 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-11-10 05:23:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2018-11-10 05:23:54,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2117. [2018-11-10 05:23:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2117 states. [2018-11-10 05:23:54,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3445 transitions. [2018-11-10 05:23:54,321 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3445 transitions. Word has length 190 [2018-11-10 05:23:54,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:54,321 INFO L481 AbstractCegarLoop]: Abstraction has 2117 states and 3445 transitions. [2018-11-10 05:23:54,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:54,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3445 transitions. [2018-11-10 05:23:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 05:23:54,325 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:54,325 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:54,325 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:54,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:54,325 INFO L82 PathProgramCache]: Analyzing trace with hash -969189429, now seen corresponding path program 1 times [2018-11-10 05:23:54,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:54,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:54,326 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 05:23:54,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:54,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:54,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:54,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:54,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:54,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:54,422 INFO L87 Difference]: Start difference. First operand 2117 states and 3445 transitions. Second operand 4 states. [2018-11-10 05:23:54,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:54,749 INFO L93 Difference]: Finished difference Result 5763 states and 9365 transitions. [2018-11-10 05:23:54,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:54,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 05:23:54,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:54,756 INFO L225 Difference]: With dead ends: 5763 [2018-11-10 05:23:54,756 INFO L226 Difference]: Without dead ends: 3660 [2018-11-10 05:23:54,759 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-11-10 05:23:54,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2018-11-10 05:23:54,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 2741. [2018-11-10 05:23:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2018-11-10 05:23:54,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4581 transitions. [2018-11-10 05:23:54,820 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4581 transitions. Word has length 190 [2018-11-10 05:23:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:54,821 INFO L481 AbstractCegarLoop]: Abstraction has 2741 states and 4581 transitions. [2018-11-10 05:23:54,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4581 transitions. [2018-11-10 05:23:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:23:54,825 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:54,825 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:54,825 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:54,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:54,825 INFO L82 PathProgramCache]: Analyzing trace with hash 818359282, now seen corresponding path program 1 times [2018-11-10 05:23:54,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:54,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:54,826 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-10 05:23:54,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:54,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:54,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:54,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:54,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:54,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:54,919 INFO L87 Difference]: Start difference. First operand 2741 states and 4581 transitions. Second operand 4 states. [2018-11-10 05:23:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:55,248 INFO L93 Difference]: Finished difference Result 6131 states and 10045 transitions. [2018-11-10 05:23:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:55,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-11-10 05:23:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:55,255 INFO L225 Difference]: With dead ends: 6131 [2018-11-10 05:23:55,255 INFO L226 Difference]: Without dead ends: 3404 [2018-11-10 05:23:55,258 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-11-10 05:23:55,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2018-11-10 05:23:55,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 2749. [2018-11-10 05:23:55,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2749 states. [2018-11-10 05:23:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 4581 transitions. [2018-11-10 05:23:55,318 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 4581 transitions. Word has length 191 [2018-11-10 05:23:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:55,318 INFO L481 AbstractCegarLoop]: Abstraction has 2749 states and 4581 transitions. [2018-11-10 05:23:55,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 4581 transitions. [2018-11-10 05:23:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 05:23:55,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:55,322 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 05:23:55,322 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:55,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:55,322 INFO L82 PathProgramCache]: Analyzing trace with hash 12564028, now seen corresponding path program 1 times [2018-11-10 05:23:55,322 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:55,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:55,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:55,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:23:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-11-10 05:23:55,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:23:55,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 05:23:55,425 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 05:23:55,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 05:23:55,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 05:23:55,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 05:23:55,426 INFO L87 Difference]: Start difference. First operand 2749 states and 4581 transitions. Second operand 4 states. [2018-11-10 05:23:55,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:23:55,802 INFO L93 Difference]: Finished difference Result 6139 states and 10029 transitions. [2018-11-10 05:23:55,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 05:23:55,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-11-10 05:23:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:23:55,811 INFO L225 Difference]: With dead ends: 6139 [2018-11-10 05:23:55,811 INFO L226 Difference]: Without dead ends: 3404 [2018-11-10 05:23:55,816 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-11-10 05:23:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3404 states. [2018-11-10 05:23:55,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3404 to 2765. [2018-11-10 05:23:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2765 states. [2018-11-10 05:23:55,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 4605 transitions. [2018-11-10 05:23:55,877 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 4605 transitions. Word has length 191 [2018-11-10 05:23:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:23:55,878 INFO L481 AbstractCegarLoop]: Abstraction has 2765 states and 4605 transitions. [2018-11-10 05:23:55,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 05:23:55,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 4605 transitions. [2018-11-10 05:23:55,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 05:23:55,881 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:23:55,881 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:23:55,882 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:23:55,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:23:55,882 INFO L82 PathProgramCache]: Analyzing trace with hash 362821223, now seen corresponding path program 1 times [2018-11-10 05:23:55,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 05:23:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:23:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 05:23:55,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 05:23:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:23:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:23:56,158 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 05:23:56,175 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,176 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,176 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,176 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,177 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:23:56,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:23:56 BoogieIcfgContainer [2018-11-10 05:23:56,232 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:23:56,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:23:56,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:23:56,232 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:23:56,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:23:09" (3/4) ... [2018-11-10 05:23:56,235 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 05:23:56,235 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:23:56,236 INFO L168 Benchmark]: Toolchain (without parser) took 49160.83 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 957.1 MB in the beginning and 1.0 GB in the end (delta: -44.6 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,237 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:23:56,237 INFO L168 Benchmark]: CACSL2BoogieTranslator took 885.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,238 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,238 INFO L168 Benchmark]: Boogie Preprocessor took 75.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,238 INFO L168 Benchmark]: RCFGBuilder took 915.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.3 MB in the end (delta: 156.7 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,239 INFO L168 Benchmark]: TraceAbstraction took 47211.83 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 905.3 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2018-11-10 05:23:56,241 INFO L168 Benchmark]: Witness Printer took 3.40 ms. Allocated memory is still 5.0 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 05:23:56,244 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 885.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -125.6 MB). Peak memory consumption was 100.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 915.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 905.3 MB in the end (delta: 156.7 MB). Peak memory consumption was 156.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47211.83 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 905.3 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 3.40 ms. Allocated memory is still 5.0 GB. Free memory is still 1.0 GB. 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: 1727]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={24586:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] 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_server_data={24586:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={24586:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={24586:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={24586:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1579] CALL, EXPR s->session [L1579] RET, EXPR s->session [L1579] CALL, EXPR s->s3 [L1579] RET, EXPR s->s3 [L1579] CALL, EXPR (s->s3)->tmp.new_cipher [L1579] RET, EXPR (s->s3)->tmp.new_cipher [L1579] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1579] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={24586:0}] [L1592] COND FALSE !(ret <= 0) [L1597] CALL s->state = 8672 [L1597] RET s->state = 8672 [L1598] CALL s->init_num = 0 [L1598] RET s->init_num = 0 [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24586:0}] [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={24586:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={24586:0}] [L1614] COND FALSE !(ret <= 0) [L1619] CALL s->state = 8448 [L1619] RET s->state = 8448 [L1620] CALL s->hit [L1620] RET s->hit [L1620] COND TRUE s->hit [L1621] CALL, EXPR s->s3 [L1621] RET, EXPR s->s3 [L1621] CALL (s->s3)->tmp.next_state = 8640 [L1621] RET (s->s3)->tmp.next_state = 8640 [L1625] CALL s->init_num = 0 [L1625] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={24586:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={24586:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={24586:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24586:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={24586:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24586:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 47.1s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3232 SDtfs, 2667 SDslu, 4014 SDs, 0 SdLazy, 2910 SolverSat, 371 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 425 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2765occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 3731 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2432 NumberOfCodeBlocks, 2432 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2385 ConstructedInterpolants, 84 QuantifiedInterpolants, 2219743 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1902 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 2477/2964 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-11-10 05:23:57,870 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 05:23:57,871 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 05:23:57,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 05:23:57,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 05:23:57,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 05:23:57,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 05:23:57,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 05:23:57,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 05:23:57,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 05:23:57,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 05:23:57,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 05:23:57,884 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 05:23:57,885 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 05:23:57,886 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 05:23:57,887 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 05:23:57,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 05:23:57,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 05:23:57,890 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 05:23:57,891 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 05:23:57,892 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 05:23:57,893 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 05:23:57,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 05:23:57,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 05:23:57,895 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 05:23:57,896 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 05:23:57,897 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 05:23:57,897 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 05:23:57,898 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 05:23:57,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 05:23:57,899 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 05:23:57,900 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 05:23:57,900 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 05:23:57,900 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 05:23:57,901 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 05:23:57,901 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 05:23:57,902 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 05:23:57,912 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 05:23:57,912 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 05:23:57,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 05:23:57,913 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 05:23:57,913 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 05:23:57,913 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 05:23:57,913 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 05:23:57,913 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 05:23:57,914 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 05:23:57,914 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 05:23:57,914 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 05:23:57,914 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 05:23:57,915 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 05:23:57,915 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 05:23:57,915 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 05:23:57,915 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 05:23:57,915 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 05:23:57,917 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 05:23:57,917 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 05:23:57,917 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 05:23:57,917 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 05:23:57,917 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 05:23:57,917 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 05:23:57,918 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 05:23:57,918 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 05:23:57,919 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 05:23:57,919 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_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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 -> c336041bbe834e5f5652b9c9de80bd23d0aa7014 [2018-11-10 05:23:57,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 05:23:57,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 05:23:57,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 05:23:57,964 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 05:23:57,964 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 05:23:57,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:23:58,006 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/bd665d3fc/f57af66651cf4ea5a7480c68570abf8c/FLAGa1a343e9b [2018-11-10 05:23:58,480 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 05:23:58,481 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/sv-benchmarks/c/ssh/s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:23:58,496 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/bd665d3fc/f57af66651cf4ea5a7480c68570abf8c/FLAGa1a343e9b [2018-11-10 05:23:58,507 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/data/bd665d3fc/f57af66651cf4ea5a7480c68570abf8c [2018-11-10 05:23:58,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 05:23:58,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 05:23:58,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 05:23:58,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 05:23:58,514 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 05:23:58,514 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:58" (1/1) ... [2018-11-10 05:23:58,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea88171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:58, skipping insertion in model container [2018-11-10 05:23:58,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:58" (1/1) ... [2018-11-10 05:23:58,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 05:23:58,562 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 05:23:59,001 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:23:59,011 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 05:23:59,284 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 05:23:59,385 INFO L193 MainTranslator]: Completed translation [2018-11-10 05:23:59,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59 WrapperNode [2018-11-10 05:23:59,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 05:23:59,386 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 05:23:59,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 05:23:59,387 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 05:23:59,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 05:23:59,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 05:23:59,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 05:23:59,455 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 05:23:59,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,518 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... [2018-11-10 05:23:59,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 05:23:59,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 05:23:59,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 05:23:59,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 05:23:59,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:23:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 05:23:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 05:23:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 05:23:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 05:23:59,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 05:23:59,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 05:23:59,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 05:23:59,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 05:24:02,024 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 05:24:02,025 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 05:24:02,891 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 05:24:02,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:24:02 BoogieIcfgContainer [2018-11-10 05:24:02,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 05:24:02,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 05:24:02,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 05:24:02,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 05:24:02,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:58" (1/3) ... [2018-11-10 05:24:02,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@871140e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:02, skipping insertion in model container [2018-11-10 05:24:02,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:59" (2/3) ... [2018-11-10 05:24:02,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@871140e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:24:02, skipping insertion in model container [2018-11-10 05:24:02,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:24:02" (3/3) ... [2018-11-10 05:24:02,898 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.13_false-unreach-call.i.cil.c [2018-11-10 05:24:02,907 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 05:24:02,914 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 05:24:02,925 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 05:24:02,948 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 05:24:02,948 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 05:24:02,948 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 05:24:02,949 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 05:24:02,949 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 05:24:02,949 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 05:24:02,949 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 05:24:02,949 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 05:24:02,949 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 05:24:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 05:24:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 05:24:02,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:02,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:02,972 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:02,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:02,976 INFO L82 PathProgramCache]: Analyzing trace with hash 661829922, now seen corresponding path program 1 times [2018-11-10 05:24:02,980 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:02,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:02,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:03,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:03,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:24:03,143 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:03,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:03,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,165 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 05:24:03,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:03,288 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 05:24:03,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:03,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 05:24:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:03,299 INFO L225 Difference]: With dead ends: 438 [2018-11-10 05:24:03,299 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 05:24:03,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 05:24:03,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 05:24:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 05:24:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 05:24:03,349 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 05:24:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:03,350 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 05:24:03,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 05:24:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 05:24:03,352 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:03,353 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:03,353 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:03,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 233986428, now seen corresponding path program 1 times [2018-11-10 05:24:03,354 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:03,354 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:03,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:03,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 05:24:03,546 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:03,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:03,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:03,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,550 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 3 states. [2018-11-10 05:24:03,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:03,617 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2018-11-10 05:24:03,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:03,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-10 05:24:03,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:03,620 INFO L225 Difference]: With dead ends: 518 [2018-11-10 05:24:03,620 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 05:24:03,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 05:24:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-11-10 05:24:03,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 05:24:03,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2018-11-10 05:24:03,642 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 60 [2018-11-10 05:24:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:03,643 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2018-11-10 05:24:03,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2018-11-10 05:24:03,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 05:24:03,646 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:03,647 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 05:24:03,647 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:03,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:03,647 INFO L82 PathProgramCache]: Analyzing trace with hash 540992405, now seen corresponding path program 1 times [2018-11-10 05:24:03,648 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:03,648 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:03,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:03,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 05:24:03,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:03,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:03,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:03,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:03,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:03,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,829 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2018-11-10 05:24:03,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:03,908 INFO L93 Difference]: Finished difference Result 764 states and 1153 transitions. [2018-11-10 05:24:03,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:03,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 05:24:03,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:03,911 INFO L225 Difference]: With dead ends: 764 [2018-11-10 05:24:03,911 INFO L226 Difference]: Without dead ends: 513 [2018-11-10 05:24:03,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-10 05:24:03,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-11-10 05:24:03,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-10 05:24:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 764 transitions. [2018-11-10 05:24:03,929 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 764 transitions. Word has length 83 [2018-11-10 05:24:03,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:03,930 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 764 transitions. [2018-11-10 05:24:03,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:03,930 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 764 transitions. [2018-11-10 05:24:03,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 05:24:03,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:03,934 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:03,934 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:03,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash -2108182396, now seen corresponding path program 1 times [2018-11-10 05:24:03,936 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:03,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:04,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:04,161 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:04,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:04,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:04,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:04,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,164 INFO L87 Difference]: Start difference. First operand 513 states and 764 transitions. Second operand 3 states. [2018-11-10 05:24:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:04,224 INFO L93 Difference]: Finished difference Result 1012 states and 1521 transitions. [2018-11-10 05:24:04,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:04,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 05:24:04,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:04,226 INFO L225 Difference]: With dead ends: 1012 [2018-11-10 05:24:04,226 INFO L226 Difference]: Without dead ends: 638 [2018-11-10 05:24:04,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-10 05:24:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2018-11-10 05:24:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-11-10 05:24:04,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 949 transitions. [2018-11-10 05:24:04,241 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 949 transitions. Word has length 108 [2018-11-10 05:24:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:04,241 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 949 transitions. [2018-11-10 05:24:04,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 949 transitions. [2018-11-10 05:24:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 05:24:04,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:04,243 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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, 1, 1] [2018-11-10 05:24:04,244 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:04,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2014675063, now seen corresponding path program 1 times [2018-11-10 05:24:04,244 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:04,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:04,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:04,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:04,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:04,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:04,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:04,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:04,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,454 INFO L87 Difference]: Start difference. First operand 638 states and 949 transitions. Second operand 3 states. [2018-11-10 05:24:04,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:04,506 INFO L93 Difference]: Finished difference Result 1260 states and 1888 transitions. [2018-11-10 05:24:04,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:04,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-10 05:24:04,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:04,509 INFO L225 Difference]: With dead ends: 1260 [2018-11-10 05:24:04,509 INFO L226 Difference]: Without dead ends: 761 [2018-11-10 05:24:04,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-11-10 05:24:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2018-11-10 05:24:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2018-11-10 05:24:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1131 transitions. [2018-11-10 05:24:04,522 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1131 transitions. Word has length 125 [2018-11-10 05:24:04,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:04,522 INFO L481 AbstractCegarLoop]: Abstraction has 761 states and 1131 transitions. [2018-11-10 05:24:04,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:04,523 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1131 transitions. [2018-11-10 05:24:04,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 05:24:04,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:04,524 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:04,524 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:04,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 483748542, now seen corresponding path program 1 times [2018-11-10 05:24:04,525 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:04,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:04,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:04,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-10 05:24:04,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:04,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:04,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:04,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,742 INFO L87 Difference]: Start difference. First operand 761 states and 1131 transitions. Second operand 3 states. [2018-11-10 05:24:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:04,798 INFO L93 Difference]: Finished difference Result 1508 states and 2255 transitions. [2018-11-10 05:24:04,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:04,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 05:24:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:04,802 INFO L225 Difference]: With dead ends: 1508 [2018-11-10 05:24:04,802 INFO L226 Difference]: Without dead ends: 886 [2018-11-10 05:24:04,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-11-10 05:24:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2018-11-10 05:24:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-11-10 05:24:04,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1316 transitions. [2018-11-10 05:24:04,820 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1316 transitions. Word has length 138 [2018-11-10 05:24:04,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:04,820 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1316 transitions. [2018-11-10 05:24:04,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:04,820 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1316 transitions. [2018-11-10 05:24:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 05:24:04,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:04,822 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:04,822 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:04,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:04,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1195979437, now seen corresponding path program 1 times [2018-11-10 05:24:04,823 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:04,823 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:04,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:05,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-10 05:24:05,110 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:05,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:24:05,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:24:05,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:24:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:24:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:05,114 INFO L87 Difference]: Start difference. First operand 886 states and 1316 transitions. Second operand 3 states. [2018-11-10 05:24:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:05,185 INFO L93 Difference]: Finished difference Result 1756 states and 2620 transitions. [2018-11-10 05:24:05,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:24:05,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-11-10 05:24:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:05,188 INFO L225 Difference]: With dead ends: 1756 [2018-11-10 05:24:05,189 INFO L226 Difference]: Without dead ends: 1009 [2018-11-10 05:24:05,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:24:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-11-10 05:24:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1007. [2018-11-10 05:24:05,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1007 states. [2018-11-10 05:24:05,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1496 transitions. [2018-11-10 05:24:05,208 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1496 transitions. Word has length 169 [2018-11-10 05:24:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:05,208 INFO L481 AbstractCegarLoop]: Abstraction has 1007 states and 1496 transitions. [2018-11-10 05:24:05,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:24:05,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1496 transitions. [2018-11-10 05:24:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:24:05,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:05,211 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:05,211 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:05,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 683885949, now seen corresponding path program 1 times [2018-11-10 05:24:05,212 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:05,212 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:05,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:07,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:07,692 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-11-10 05:24:07,695 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-11-10 05:24:07,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:07,711 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-11-10 05:24:07,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,731 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,768 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 05:24:07,832 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-11-10 05:24:07,835 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-11-10 05:24:07,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:24:07,922 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 95 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:24:07,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:24:07,979 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 05:24:07,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:07,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 05:24:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:24:08,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:24:08,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 05:24:08,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:24:08,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:24:08,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:24:08,021 INFO L87 Difference]: Start difference. First operand 1007 states and 1496 transitions. Second operand 9 states. [2018-11-10 05:24:12,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:12,338 INFO L93 Difference]: Finished difference Result 3597 states and 5369 transitions. [2018-11-10 05:24:12,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:24:12,339 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2018-11-10 05:24:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:12,345 INFO L225 Difference]: With dead ends: 3597 [2018-11-10 05:24:12,345 INFO L226 Difference]: Without dead ends: 2604 [2018-11-10 05:24:12,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 345 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-11-10 05:24:12,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2018-11-10 05:24:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 1239. [2018-11-10 05:24:12,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-11-10 05:24:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1904 transitions. [2018-11-10 05:24:12,385 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1904 transitions. Word has length 175 [2018-11-10 05:24:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:12,386 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1904 transitions. [2018-11-10 05:24:12,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:24:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1904 transitions. [2018-11-10 05:24:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 05:24:12,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:12,388 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:12,388 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:12,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:12,388 INFO L82 PathProgramCache]: Analyzing trace with hash -401542991, now seen corresponding path program 1 times [2018-11-10 05:24:12,389 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:12,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:12,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:15,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:15,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:15,954 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 20 treesize of output 32 [2018-11-10 05:24:15,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 05:24:15,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:15,988 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:15,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 05:24:15,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-10 05:24:16,114 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-11-10 05:24:16,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,120 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 [2018-11-10 05:24:16,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 05:24:16,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,204 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 33 [2018-11-10 05:24:16,212 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,214 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 05:24:16,221 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,241 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,253 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,314 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 05:24:16,376 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 15 treesize of output 12 [2018-11-10 05:24:16,379 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 12 treesize of output 1 [2018-11-10 05:24:16,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:51 [2018-11-10 05:24:16,452 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-10 05:24:16,475 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 22 treesize of output 21 [2018-11-10 05:24:16,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,525 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 29 treesize of output 25 [2018-11-10 05:24:16,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 05:24:16,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,551 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 05:24:16,583 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 15 treesize of output 12 [2018-11-10 05:24:16,586 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 12 treesize of output 1 [2018-11-10 05:24:16,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 05:24:16,606 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-11-10 05:24:16,609 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-11-10 05:24:16,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 05:24:16,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 05:24:16,689 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 14 treesize of output 13 [2018-11-10 05:24:16,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,738 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 33 treesize of output 24 [2018-11-10 05:24:16,742 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 24 treesize of output 1 [2018-11-10 05:24:16,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,787 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 56 treesize of output 42 [2018-11-10 05:24:16,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,794 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:16,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:16,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 05:24:16,802 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:16,812 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:16,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,823 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 05:24:16,847 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-11-10 05:24:16,850 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:16,852 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-11-10 05:24:16,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 05:24:16,871 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-11-10 05:24:16,873 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-11-10 05:24:16,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:16,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:24:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:17,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:24:17,085 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 34 treesize of output 25 [2018-11-10 05:24:17,090 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 25 treesize of output 1 [2018-11-10 05:24:17,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:17,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 05:24:17,174 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 05:24:17,240 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 11 treesize of output 10 [2018-11-10 05:24:17,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,259 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 10 treesize of output 8 [2018-11-10 05:24:17,262 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 8 treesize of output 1 [2018-11-10 05:24:17,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 05:24:17,347 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 16 treesize of output 13 [2018-11-10 05:24:17,351 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 13 treesize of output 1 [2018-11-10 05:24:17,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 05:24:17,536 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 16 treesize of output 13 [2018-11-10 05:24:17,543 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 13 treesize of output 1 [2018-11-10 05:24:17,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:17,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:17,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:38 [2018-11-10 05:24:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:17,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:24:17,797 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:24:17,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:18,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:18,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-11-10 05:24:18,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,341 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 23 treesize of output 20 [2018-11-10 05:24:18,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 05:24:18,348 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 05:24:18,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,355 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 05:24:18,363 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,416 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 13 treesize of output 10 [2018-11-10 05:24:18,419 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-11-10 05:24:18,419 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,422 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,441 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 05:24:18,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-10 05:24:18,598 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 29 treesize of output 28 [2018-11-10 05:24:18,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,653 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 23 treesize of output 19 [2018-11-10 05:24:18,655 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:18,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 05:24:18,656 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,670 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 05:24:18,716 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-11-10 05:24:18,720 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-11-10 05:24:18,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 05:24:18,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 05:24:18,800 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 14 treesize of output 13 [2018-11-10 05:24:18,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,822 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 18 [2018-11-10 05:24:18,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:18,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 05:24:18,826 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:18,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:18,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 05:24:18,851 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-11-10 05:24:18,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:18,855 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-11-10 05:24:18,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 05:24:18,875 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-11-10 05:24:18,881 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-11-10 05:24:18,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:18,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-11-10 05:24:18,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:24:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:18,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:24:19,074 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 05:24:19,133 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 11 treesize of output 10 [2018-11-10 05:24:19,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:19,154 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 10 treesize of output 8 [2018-11-10 05:24:19,157 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 8 treesize of output 1 [2018-11-10 05:24:19,157 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:19,159 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:19,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:19,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:19,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 05:24:19,503 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:19,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 05:24:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 05:24:19,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 05:24:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 05:24:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 05:24:19,526 INFO L87 Difference]: Start difference. First operand 1239 states and 1904 transitions. Second operand 24 states. [2018-11-10 05:24:29,836 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 05:24:30,841 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-10 05:24:34,867 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 05:24:36,859 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-11-10 05:24:37,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:37,646 INFO L93 Difference]: Finished difference Result 4554 states and 6963 transitions. [2018-11-10 05:24:37,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:24:37,647 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-10 05:24:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:37,653 INFO L225 Difference]: With dead ends: 4554 [2018-11-10 05:24:37,653 INFO L226 Difference]: Without dead ends: 3329 [2018-11-10 05:24:37,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 05:24:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-11-10 05:24:37,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 1733. [2018-11-10 05:24:37,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2018-11-10 05:24:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2794 transitions. [2018-11-10 05:24:37,743 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2794 transitions. Word has length 175 [2018-11-10 05:24:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:37,743 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 2794 transitions. [2018-11-10 05:24:37,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 05:24:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2794 transitions. [2018-11-10 05:24:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 05:24:37,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:37,746 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:24:37,746 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:37,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 306811475, now seen corresponding path program 1 times [2018-11-10 05:24:37,747 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:37,747 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:37,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:40,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:40,087 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-11-10 05:24:40,089 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-11-10 05:24:40,093 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:40,095 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-11-10 05:24:40,095 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,103 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,122 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 05:24:40,137 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-11-10 05:24:40,139 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-11-10 05:24:40,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:24:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:24:40,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:24:40,202 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 05:24:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:40,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 05:24:40,216 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:24:40,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:24:40,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 05:24:40,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:24:40,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:24:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:24:40,221 INFO L87 Difference]: Start difference. First operand 1733 states and 2794 transitions. Second operand 9 states. [2018-11-10 05:24:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:24:44,050 INFO L93 Difference]: Finished difference Result 4507 states and 6983 transitions. [2018-11-10 05:24:44,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:24:44,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 176 [2018-11-10 05:24:44,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:24:44,055 INFO L225 Difference]: With dead ends: 4507 [2018-11-10 05:24:44,056 INFO L226 Difference]: Without dead ends: 2788 [2018-11-10 05:24:44,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 347 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-11-10 05:24:44,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2018-11-10 05:24:44,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1739. [2018-11-10 05:24:44,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1739 states. [2018-11-10 05:24:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2792 transitions. [2018-11-10 05:24:44,121 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2792 transitions. Word has length 176 [2018-11-10 05:24:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:24:44,121 INFO L481 AbstractCegarLoop]: Abstraction has 1739 states and 2792 transitions. [2018-11-10 05:24:44,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:24:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2792 transitions. [2018-11-10 05:24:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 05:24:44,124 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:24:44,124 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-10 05:24:44,124 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:24:44,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:24:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash 429734422, now seen corresponding path program 1 times [2018-11-10 05:24:44,125 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:24:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:24:44,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:47,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:47,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,704 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 20 treesize of output 32 [2018-11-10 05:24:47,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 05:24:47,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-10 05:24:47,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 20 [2018-11-10 05:24:47,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 20 treesize of output 23 [2018-11-10 05:24:47,905 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,907 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 33 [2018-11-10 05:24:47,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:47,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 05:24:47,917 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,938 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-10 05:24:47,985 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-11-10 05:24:47,985 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:47,992 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,020 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 05:24:48,097 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 15 treesize of output 12 [2018-11-10 05:24:48,100 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 12 treesize of output 1 [2018-11-10 05:24:48,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:51 [2018-11-10 05:24:48,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:48,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-10 05:24:48,173 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 22 treesize of output 21 [2018-11-10 05:24:48,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,214 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 29 treesize of output 25 [2018-11-10 05:24:48,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:48,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 05:24:48,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 05:24:48,274 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 15 treesize of output 12 [2018-11-10 05:24:48,278 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 12 treesize of output 1 [2018-11-10 05:24:48,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 05:24:48,300 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-11-10 05:24:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 05:24:48,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 05:24:48,361 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:48,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 05:24:48,379 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 14 treesize of output 13 [2018-11-10 05:24:48,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,431 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 33 treesize of output 24 [2018-11-10 05:24:48,435 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 24 treesize of output 1 [2018-11-10 05:24:48,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,464 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 56 treesize of output 42 [2018-11-10 05:24:48,469 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:48,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:48,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:48,472 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 05:24:48,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 05:24:48,476 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:48,485 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:48,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,495 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 05:24:48,519 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-11-10 05:24:48,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:48,525 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-11-10 05:24:48,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 05:24:48,542 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-11-10 05:24:48,543 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-11-10 05:24:48,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:24:48,650 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:48,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:24:48,744 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 34 treesize of output 25 [2018-11-10 05:24:48,748 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 25 treesize of output 1 [2018-11-10 05:24:48,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:48,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 05:24:48,828 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 05:24:48,870 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 11 treesize of output 10 [2018-11-10 05:24:48,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,887 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 10 treesize of output 8 [2018-11-10 05:24:48,890 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 8 treesize of output 1 [2018-11-10 05:24:48,890 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,892 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,915 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 05:24:48,948 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 16 treesize of output 13 [2018-11-10 05:24:48,950 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 13 treesize of output 1 [2018-11-10 05:24:48,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:48,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 05:24:49,062 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 16 treesize of output 13 [2018-11-10 05:24:49,066 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 13 treesize of output 1 [2018-11-10 05:24:49,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 05:24:49,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:38 [2018-11-10 05:24:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 05:24:49,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 05:24:49,272 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 05:24:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:24:49,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:24:49,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:24:49,533 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-11-10 05:24:49,535 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-11-10 05:24:49,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 05:24:49,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-10 05:24:49,609 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 22 treesize of output 21 [2018-11-10 05:24:49,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:49,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:49,679 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 2 case distinctions, treesize of input 19 treesize of output 26 [2018-11-10 05:24:49,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 05:24:49,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:24:49,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 05:24:49,724 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:27 [2018-11-10 05:24:49,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-11-10 05:24:51,831 WARN L686 Elim1Store]: solver failed to check if following not equals relation is implied: (= (bvadd ssl3_accept_~s.offset (_ bv52 32)) |ssl3_accept_write~intINTTYPE4_#ptr.offset|) [2018-11-10 05:24:51,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:51,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:51,839 INFO L303 Elim1Store]: Index analysis took 2025 ms [2018-11-10 05:24:51,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 59 [2018-11-10 05:24:51,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 05:24:52,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:52,003 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 25 treesize of output 34 [2018-11-10 05:24:52,003 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 05:24:52,110 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-11-10 05:24:52,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:24:52,116 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-11-10 05:24:52,117 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,127 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-10 05:24:52,169 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:36 [2018-11-10 05:24:52,329 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 19 treesize of output 15 [2018-11-10 05:24:52,330 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 15 treesize of output 3 [2018-11-10 05:24:52,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:24:52,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 05:24:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-11-10 05:24:52,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:24:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 05:24:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 22 [2018-11-10 05:24:52,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 05:24:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 05:24:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-11-10 05:24:52,395 INFO L87 Difference]: Start difference. First operand 1739 states and 2792 transitions. Second operand 22 states. [2018-11-10 05:25:12,904 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-10 05:25:13,991 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-10 05:25:17,922 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 05:25:18,346 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2018-11-10 05:25:18,952 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2018-11-10 05:25:19,611 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-10 05:25:22,381 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2018-11-10 05:25:23,226 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2018-11-10 05:25:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:23,595 INFO L93 Difference]: Finished difference Result 5164 states and 7962 transitions. [2018-11-10 05:25:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 05:25:23,597 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 176 [2018-11-10 05:25:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:23,602 INFO L225 Difference]: With dead ends: 5164 [2018-11-10 05:25:23,602 INFO L226 Difference]: Without dead ends: 3439 [2018-11-10 05:25:23,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-11-10 05:25:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3439 states. [2018-11-10 05:25:23,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3439 to 2071. [2018-11-10 05:25:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2071 states. [2018-11-10 05:25:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2071 states to 2071 states and 3370 transitions. [2018-11-10 05:25:23,688 INFO L78 Accepts]: Start accepts. Automaton has 2071 states and 3370 transitions. Word has length 176 [2018-11-10 05:25:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:23,688 INFO L481 AbstractCegarLoop]: Abstraction has 2071 states and 3370 transitions. [2018-11-10 05:25:23,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 05:25:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 2071 states and 3370 transitions. [2018-11-10 05:25:23,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 05:25:23,691 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:23,691 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:23,692 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:23,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:23,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1196875429, now seen corresponding path program 1 times [2018-11-10 05:25:23,693 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:23,693 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:25:23,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:23,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:23,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:23,971 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:25:23,971 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 05:25:23,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 05:25:23,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 05:25:23,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 05:25:23,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 05:25:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:23,975 INFO L87 Difference]: Start difference. First operand 2071 states and 3370 transitions. Second operand 3 states. [2018-11-10 05:25:24,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:24,135 INFO L93 Difference]: Finished difference Result 4130 states and 6734 transitions. [2018-11-10 05:25:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 05:25:24,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 181 [2018-11-10 05:25:24,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:24,144 INFO L225 Difference]: With dead ends: 4130 [2018-11-10 05:25:24,144 INFO L226 Difference]: Without dead ends: 2341 [2018-11-10 05:25:24,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 05:25:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2018-11-10 05:25:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2339. [2018-11-10 05:25:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2339 states. [2018-11-10 05:25:24,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2339 states to 2339 states and 3807 transitions. [2018-11-10 05:25:24,289 INFO L78 Accepts]: Start accepts. Automaton has 2339 states and 3807 transitions. Word has length 181 [2018-11-10 05:25:24,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:24,289 INFO L481 AbstractCegarLoop]: Abstraction has 2339 states and 3807 transitions. [2018-11-10 05:25:24,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 05:25:24,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2339 states and 3807 transitions. [2018-11-10 05:25:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 05:25:24,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:24,294 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:24,294 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:24,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1304866865, now seen corresponding path program 1 times [2018-11-10 05:25:24,296 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:24,296 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:25:24,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:27,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:27,796 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-11-10 05:25:27,798 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-11-10 05:25:27,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:25:27,804 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-11-10 05:25:27,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,810 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 05:25:27,835 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-11-10 05:25:27,836 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-11-10 05:25:27,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:25:27,864 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 215 proven. 2 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:25:27,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:25:27,885 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 05:25:27,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:27,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 05:25:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:25:27,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:25:27,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 05:25:27,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:25:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:25:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:27,908 INFO L87 Difference]: Start difference. First operand 2339 states and 3807 transitions. Second operand 9 states. [2018-11-10 05:25:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:31,593 INFO L93 Difference]: Finished difference Result 6097 states and 9606 transitions. [2018-11-10 05:25:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:25:31,594 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2018-11-10 05:25:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:31,599 INFO L225 Difference]: With dead ends: 6097 [2018-11-10 05:25:31,600 INFO L226 Difference]: Without dead ends: 3772 [2018-11-10 05:25:31,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 403 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-11-10 05:25:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2018-11-10 05:25:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 2582. [2018-11-10 05:25:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2018-11-10 05:25:31,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4205 transitions. [2018-11-10 05:25:31,739 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4205 transitions. Word has length 204 [2018-11-10 05:25:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:31,740 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 4205 transitions. [2018-11-10 05:25:31,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:25:31,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4205 transitions. [2018-11-10 05:25:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 05:25:31,745 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:31,745 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:31,746 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:31,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:31,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1042028377, now seen corresponding path program 1 times [2018-11-10 05:25:31,747 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:31,747 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/cvc4nyu Starting monitored process 17 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 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 05:25:31,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 05:25:35,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 05:25:35,314 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-11-10 05:25:35,316 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-11-10 05:25:35,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 05:25:35,322 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-11-10 05:25:35,322 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,344 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 05:25:35,357 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-11-10 05:25:35,358 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-11-10 05:25:35,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 05:25:35,389 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 218 proven. 1 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:25:35,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 05:25:35,417 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 05:25:35,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 05:25:35,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 05:25:35,435 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 05:25:35,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 05:25:35,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 05:25:35,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 05:25:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 05:25:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 05:25:35,440 INFO L87 Difference]: Start difference. First operand 2582 states and 4205 transitions. Second operand 9 states. [2018-11-10 05:25:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 05:25:39,177 INFO L93 Difference]: Finished difference Result 6200 states and 9733 transitions. [2018-11-10 05:25:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 05:25:39,178 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2018-11-10 05:25:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 05:25:39,187 INFO L225 Difference]: With dead ends: 6200 [2018-11-10 05:25:39,188 INFO L226 Difference]: Without dead ends: 3632 [2018-11-10 05:25:39,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 405 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-11-10 05:25:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2018-11-10 05:25:39,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 2582. [2018-11-10 05:25:39,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2582 states. [2018-11-10 05:25:39,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2582 states to 2582 states and 4171 transitions. [2018-11-10 05:25:39,320 INFO L78 Accepts]: Start accepts. Automaton has 2582 states and 4171 transitions. Word has length 205 [2018-11-10 05:25:39,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 05:25:39,320 INFO L481 AbstractCegarLoop]: Abstraction has 2582 states and 4171 transitions. [2018-11-10 05:25:39,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 05:25:39,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2582 states and 4171 transitions. [2018-11-10 05:25:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 05:25:39,323 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 05:25:39,323 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 05:25:39,324 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 05:25:39,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 05:25:39,324 INFO L82 PathProgramCache]: Analyzing trace with hash 362821223, now seen corresponding path program 1 times [2018-11-10 05:25:39,325 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 05:25:39,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/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-11-10 05:25:39,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 05:25:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:25:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 05:25:51,606 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 05:25:51,625 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,626 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,627 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,627 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:25:51 BoogieIcfgContainer [2018-11-10 05:25:51,692 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 05:25:51,693 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 05:25:51,693 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 05:25:51,694 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 05:25:51,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 05:24:02" (3/4) ... [2018-11-10 05:25:51,696 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 05:25:51,701 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,702 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 05:25:51,766 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5d9b0efb-8e62-47cd-abf2-31dddc0b8de7/bin-2019/utaipan/witness.graphml [2018-11-10 05:25:51,767 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 05:25:51,767 INFO L168 Benchmark]: Toolchain (without parser) took 113256.88 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 381.7 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -177.0 MB). Peak memory consumption was 204.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,768 INFO L168 Benchmark]: CDTParser took 0.15 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-11-10 05:25:51,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 874.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,768 INFO L168 Benchmark]: Boogie Preprocessor took 76.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,768 INFO L168 Benchmark]: RCFGBuilder took 3360.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.7 MB in the end (delta: 165.4 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,769 INFO L168 Benchmark]: TraceAbstraction took 108799.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,769 INFO L168 Benchmark]: Witness Printer took 74.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2018-11-10 05:25:51,770 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.15 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 874.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.4 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 193.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 68.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3360.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 949.7 MB in the end (delta: 165.4 MB). Peak memory consumption was 165.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108799.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.8 MB). Free memory was 949.7 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 60.2 MB. Max. memory is 11.5 GB. * Witness Printer took 74.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 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: 1727]: 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_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={2000616525:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] 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_server_data={2000616525:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1579] CALL, EXPR s->session [L1579] RET, EXPR s->session [L1579] CALL, EXPR s->s3 [L1579] RET, EXPR s->s3 [L1579] CALL, EXPR (s->s3)->tmp.new_cipher [L1579] RET, EXPR (s->s3)->tmp.new_cipher [L1579] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1579] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1580] COND FALSE !(! tmp___9) [L1586] ret = __VERIFIER_nondet_int() [L1587] COND TRUE blastFlag == 2 [L1588] blastFlag = 3 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1592] COND FALSE !(ret <= 0) [L1597] CALL s->state = 8672 [L1597] RET s->state = 8672 [L1598] CALL s->init_num = 0 [L1598] RET s->init_num = 0 [L1599] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2000616525:0}] [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1608] ret = __VERIFIER_nondet_int() [L1609] COND TRUE blastFlag == 3 [L1610] blastFlag = 4 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1614] COND FALSE !(ret <= 0) [L1619] CALL s->state = 8448 [L1619] RET s->state = 8448 [L1620] CALL s->hit [L1620] RET s->hit [L1620] COND TRUE s->hit [L1621] CALL, EXPR s->s3 [L1621] RET, EXPR s->s3 [L1621] CALL (s->s3)->tmp.next_state = 8640 [L1621] RET (s->s3)->tmp.next_state = 8640 [L1625] CALL s->init_num = 0 [L1625] RET s->init_num = 0 [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={2000616525:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1686] CALL, EXPR s->s3 [L1686] RET, EXPR s->s3 [L1686] CALL, EXPR (s->s3)->tmp.reuse_message [L1686] RET, EXPR (s->s3)->tmp.reuse_message [L1686] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1715] skip = 0 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1559] ret = __VERIFIER_nondet_int() [L1560] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={2000616525:0}] [L1727] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2000616525:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 108.7s OverallTime, 15 OverallIterations, 7 TraceHistogramMax, 65.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4209 SDtfs, 7996 SDslu, 7406 SDs, 0 SdLazy, 6358 SolverSat, 1263 SolverUnsat, 19 SolverUnknown, 0 SolverNotchecked, 59.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3688 GetRequests, 3572 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2582occurred in iteration=13, 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.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 7622 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.9s SsaConstructionTime, 21.6s SatisfiabilityAnalysisTime, 12.0s InterpolantComputationTime, 2573 NumberOfCodeBlocks, 2573 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3631 ConstructedInterpolants, 253 QuantifiedInterpolants, 6005794 SizeOfPredicates, 289 NumberOfNonLiveVariables, 14546 ConjunctsInSsa, 295 ConjunctsInUnsatCore, 23 InterpolantComputations, 13 PerfectInterpolantSequences, 3890/4901 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...