./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_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_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 c3873739663157ae1e04c3d1b08afe34dba22bef .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 c3873739663157ae1e04c3d1b08afe34dba22bef ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 04:31:58,681 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:31:58,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:31:58,690 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:31:58,691 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:31:58,691 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:31:58,692 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:31:58,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:31:58,694 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:31:58,695 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:31:58,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:31:58,696 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:31:58,696 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:31:58,697 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:31:58,698 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:31:58,698 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:31:58,699 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:31:58,700 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:31:58,702 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:31:58,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:31:58,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:31:58,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:31:58,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:31:58,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:31:58,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:31:58,707 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:31:58,708 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:31:58,708 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:31:58,709 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:31:58,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:31:58,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:31:58,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:31:58,710 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:31:58,710 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:31:58,711 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:31:58,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:31:58,712 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 04:31:58,720 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:31:58,720 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:31:58,721 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:31:58,721 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:31:58,721 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:31:58,722 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:31:58,722 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 04:31:58,722 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:31:58,722 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 04:31:58,722 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 04:31:58,722 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:31:58,723 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:31:58,723 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:31:58,723 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 04:31:58,723 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:31:58,723 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:31:58,723 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:31:58,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:31:58,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:31:58,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 04:31:58,725 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:31:58,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 04:31:58,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 04:31:58,726 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_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-11-10 04:31:58,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:31:58,759 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:31:58,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:31:58,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:31:58,762 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:31:58,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:31:58,808 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2d655aec3/99981d658f674d74afa7de7c59a9c2a1/FLAG68eafde8d [2018-11-10 04:31:59,271 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:31:59,271 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:31:59,285 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2d655aec3/99981d658f674d74afa7de7c59a9c2a1/FLAG68eafde8d [2018-11-10 04:31:59,296 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2d655aec3/99981d658f674d74afa7de7c59a9c2a1 [2018-11-10 04:31:59,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:31:59,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:31:59,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:31:59,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:31:59,303 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:31:59,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:31:59,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e93ada0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59, skipping insertion in model container [2018-11-10 04:31:59,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:31:59,312 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:31:59,352 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:31:59,764 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:31:59,773 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:31:59,970 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:31:59,984 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:31:59,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59 WrapperNode [2018-11-10 04:31:59,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:31:59,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:31:59,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:31:59,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:31:59,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,006 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:32:00,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:32:00,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:32:00,055 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:32:00,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... [2018-11-10 04:32:00,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:32:00,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:32:00,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:32:00,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:32:00,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:00,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:32:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:32:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 04:32:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 04:32:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:32:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:32:00,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:32:00,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:32:00,596 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 04:32:00,596 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 04:32:01,138 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:32:01,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:01 BoogieIcfgContainer [2018-11-10 04:32:01,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:32:01,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:32:01,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:32:01,141 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:32:01,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:31:59" (1/3) ... [2018-11-10 04:32:01,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b59310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:32:01, skipping insertion in model container [2018-11-10 04:32:01,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:31:59" (2/3) ... [2018-11-10 04:32:01,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b59310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:32:01, skipping insertion in model container [2018-11-10 04:32:01,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:01" (3/3) ... [2018-11-10 04:32:01,144 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:32:01,150 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:32:01,155 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:32:01,165 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:32:01,187 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:32:01,187 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:32:01,187 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:32:01,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:32:01,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:32:01,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:32:01,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:32:01,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:32:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 04:32:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:32:01,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:01,208 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 04:32:01,211 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:01,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:01,215 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-11-10 04:32:01,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:01,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:01,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:01,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:01,465 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 04:32:01,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:01,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:01,467 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:01,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:01,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:01,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:01,486 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 04:32:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:01,599 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 04:32:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:01,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 04:32:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:01,608 INFO L225 Difference]: With dead ends: 438 [2018-11-10 04:32:01,608 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 04:32:01,611 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 04:32:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 04:32:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 04:32:01,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 04:32:01,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 04:32:01,655 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 04:32:01,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:01,655 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 04:32:01,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:01,655 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 04:32:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 04:32:01,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:01,658 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 04:32:01,658 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:01,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-11-10 04:32:01,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:01,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:01,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:01,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:01,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:01,798 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 04:32:01,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:01,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:01,799 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:01,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:01,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:01,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:01,801 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 4 states. [2018-11-10 04:32:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:02,217 INFO L93 Difference]: Finished difference Result 439 states and 663 transitions. [2018-11-10 04:32:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:02,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-11-10 04:32:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:02,219 INFO L225 Difference]: With dead ends: 439 [2018-11-10 04:32:02,219 INFO L226 Difference]: Without dead ends: 311 [2018-11-10 04:32:02,220 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 04:32:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-10 04:32:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-11-10 04:32:02,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-11-10 04:32:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 438 transitions. [2018-11-10 04:32:02,237 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 438 transitions. Word has length 60 [2018-11-10 04:32:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:02,237 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 438 transitions. [2018-11-10 04:32:02,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 438 transitions. [2018-11-10 04:32:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-10 04:32:02,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:02,239 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 04:32:02,240 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:02,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:02,240 INFO L82 PathProgramCache]: Analyzing trace with hash -182699472, now seen corresponding path program 1 times [2018-11-10 04:32:02,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:02,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:02,345 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 04:32:02,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:02,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:02,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:02,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:02,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:02,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:02,347 INFO L87 Difference]: Start difference. First operand 290 states and 438 transitions. Second operand 3 states. [2018-11-10 04:32:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:02,413 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2018-11-10 04:32:02,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:02,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-11-10 04:32:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:02,416 INFO L225 Difference]: With dead ends: 587 [2018-11-10 04:32:02,416 INFO L226 Difference]: Without dead ends: 436 [2018-11-10 04:32:02,417 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 04:32:02,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-11-10 04:32:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-11-10 04:32:02,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-10 04:32:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2018-11-10 04:32:02,436 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 74 [2018-11-10 04:32:02,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:02,437 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2018-11-10 04:32:02,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2018-11-10 04:32:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 04:32:02,440 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:02,440 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 04:32:02,440 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:02,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:02,441 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-11-10 04:32:02,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:02,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,442 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:02,522 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 04:32:02,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:02,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:02,522 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:02,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:02,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:02,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:02,523 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand 3 states. [2018-11-10 04:32:02,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:02,580 INFO L93 Difference]: Finished difference Result 882 states and 1351 transitions. [2018-11-10 04:32:02,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:02,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 04:32:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:02,582 INFO L225 Difference]: With dead ends: 882 [2018-11-10 04:32:02,582 INFO L226 Difference]: Without dead ends: 585 [2018-11-10 04:32:02,583 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 04:32:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-11-10 04:32:02,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2018-11-10 04:32:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-11-10 04:32:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 888 transitions. [2018-11-10 04:32:02,599 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 888 transitions. Word has length 83 [2018-11-10 04:32:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:02,599 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 888 transitions. [2018-11-10 04:32:02,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 888 transitions. [2018-11-10 04:32:02,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:32:02,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:02,603 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 04:32:02,603 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:02,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:02,604 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-11-10 04:32:02,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:02,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,605 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:02,687 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 04:32:02,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:02,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:02,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:02,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:02,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:02,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:02,688 INFO L87 Difference]: Start difference. First operand 585 states and 888 transitions. Second operand 3 states. [2018-11-10 04:32:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:02,744 INFO L93 Difference]: Finished difference Result 1182 states and 1810 transitions. [2018-11-10 04:32:02,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:02,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 04:32:02,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:02,746 INFO L225 Difference]: With dead ends: 1182 [2018-11-10 04:32:02,746 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 04:32:02,747 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 04:32:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 04:32:02,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-11-10 04:32:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 04:32:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1121 transitions. [2018-11-10 04:32:02,759 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1121 transitions. Word has length 108 [2018-11-10 04:32:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:02,760 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1121 transitions. [2018-11-10 04:32:02,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1121 transitions. [2018-11-10 04:32:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 04:32:02,762 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:02,762 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 04:32:02,762 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:02,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1057268164, now seen corresponding path program 1 times [2018-11-10 04:32:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,763 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:02,843 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 04:32:02,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:02,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:02,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:02,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:02,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:02,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:02,844 INFO L87 Difference]: Start difference. First operand 734 states and 1121 transitions. Second operand 3 states. [2018-11-10 04:32:02,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:02,881 INFO L93 Difference]: Finished difference Result 1480 states and 2274 transitions. [2018-11-10 04:32:02,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:02,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-11-10 04:32:02,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:02,885 INFO L225 Difference]: With dead ends: 1480 [2018-11-10 04:32:02,885 INFO L226 Difference]: Without dead ends: 885 [2018-11-10 04:32:02,886 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 04:32:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-11-10 04:32:02,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2018-11-10 04:32:02,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-11-10 04:32:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1340 transitions. [2018-11-10 04:32:02,898 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1340 transitions. Word has length 114 [2018-11-10 04:32:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:02,899 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1340 transitions. [2018-11-10 04:32:02,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:02,899 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1340 transitions. [2018-11-10 04:32:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 04:32:02,902 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:02,902 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 04:32:02,902 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:02,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -487725894, now seen corresponding path program 1 times [2018-11-10 04:32:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:02,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:02,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:02,984 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 04:32:02,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:02,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:02,985 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:02,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:02,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:02,985 INFO L87 Difference]: Start difference. First operand 883 states and 1340 transitions. Second operand 3 states. [2018-11-10 04:32:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:03,032 INFO L93 Difference]: Finished difference Result 1776 states and 2711 transitions. [2018-11-10 04:32:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:03,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-11-10 04:32:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:03,035 INFO L225 Difference]: With dead ends: 1776 [2018-11-10 04:32:03,035 INFO L226 Difference]: Without dead ends: 1032 [2018-11-10 04:32:03,037 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 04:32:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-11-10 04:32:03,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-11-10 04:32:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-11-10 04:32:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1570 transitions. [2018-11-10 04:32:03,051 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1570 transitions. Word has length 131 [2018-11-10 04:32:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:03,052 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1570 transitions. [2018-11-10 04:32:03,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1570 transitions. [2018-11-10 04:32:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 04:32:03,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:03,054 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 04:32:03,054 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:03,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:03,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-11-10 04:32:03,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:03,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:03,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:03,055 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:03,138 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 04:32:03,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:03,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:03,139 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:03,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:03,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:03,139 INFO L87 Difference]: Start difference. First operand 1032 states and 1570 transitions. Second operand 3 states. [2018-11-10 04:32:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:03,187 INFO L93 Difference]: Finished difference Result 1185 states and 1800 transitions. [2018-11-10 04:32:03,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:03,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 04:32:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:03,191 INFO L225 Difference]: With dead ends: 1185 [2018-11-10 04:32:03,191 INFO L226 Difference]: Without dead ends: 1183 [2018-11-10 04:32:03,191 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 04:32:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-11-10 04:32:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2018-11-10 04:32:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-11-10 04:32:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1797 transitions. [2018-11-10 04:32:03,212 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1797 transitions. Word has length 138 [2018-11-10 04:32:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:03,212 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1797 transitions. [2018-11-10 04:32:03,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1797 transitions. [2018-11-10 04:32:03,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 04:32:03,215 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:03,215 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 04:32:03,215 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:03,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:03,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1721971004, now seen corresponding path program 1 times [2018-11-10 04:32:03,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:03,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:03,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:03,217 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:03,659 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 04:32:03,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:32:03,659 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 04:32:03,660 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-10 04:32:03,661 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], [490], [493], [509], [514], [517], [525], [530], [532], [535], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-11-10 04:32:03,699 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 04:32:03,700 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 04:32:04,676 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 04:32:43,290 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 04:32:43,291 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 04:32:43,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:43,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 04:32:43,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:32:43,304 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:43,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:43,312 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 04:32:43,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:43,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:43,657 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 04:32:43,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,684 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 04:32:43,688 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 04:32:43,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,691 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,705 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 04:32:43,708 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 04:32:43,711 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:32:43,713 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 04:32:43,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:32:43,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:32:43,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:32:43,725 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 04:32:43,726 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,740 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,758 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 04:32:43,758 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 04:32:43,844 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 04:32:43,846 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 04:32:43,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,873 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 04:32:43,876 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 04:32:43,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,927 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 04:32:43,927 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 04:32:43,987 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 04:32:43,989 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 04:32:43,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:43,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 04:32:44,033 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 04:32:44,035 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 04:32:44,036 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 04:32:44,041 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 04:32:44,050 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 04:32:44,052 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 04:32:44,052 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,056 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,060 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 04:32:44,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 04:32:44,078 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 04:32:44,081 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:32:44,082 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 04:32:44,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,092 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 04:32:44,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 04:32:44,098 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 04:32:44,099 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 04:32:44,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,102 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 04:32:44,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 04:32:44,169 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 04:32:44,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:32:44,266 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 04:32:44,283 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 04:32:44,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,290 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 04:32:44,292 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 04:32:44,292 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:32:44,298 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 04:32:44,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 04:32:44,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 04:32:44,566 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 04:32:44,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 04:32:44,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-11-10 04:32:44,584 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 04:32:44,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 04:32:44,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 04:32:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:32:44,585 INFO L87 Difference]: Start difference. First operand 1181 states and 1797 transitions. Second operand 17 states. [2018-11-10 04:32:46,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:46,139 INFO L93 Difference]: Finished difference Result 3051 states and 4660 transitions. [2018-11-10 04:32:46,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:32:46,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2018-11-10 04:32:46,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:46,145 INFO L225 Difference]: With dead ends: 3051 [2018-11-10 04:32:46,146 INFO L226 Difference]: Without dead ends: 1884 [2018-11-10 04:32:46,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-11-10 04:32:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-11-10 04:32:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1445. [2018-11-10 04:32:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-11-10 04:32:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2269 transitions. [2018-11-10 04:32:46,200 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2269 transitions. Word has length 175 [2018-11-10 04:32:46,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:46,201 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2269 transitions. [2018-11-10 04:32:46,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 04:32:46,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2269 transitions. [2018-11-10 04:32:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:32:46,204 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:46,204 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:46,204 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:46,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1065153562, now seen corresponding path program 1 times [2018-11-10 04:32:46,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:46,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:46,206 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:46,332 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 04:32:46,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:46,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:46,333 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:46,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:46,333 INFO L87 Difference]: Start difference. First operand 1445 states and 2269 transitions. Second operand 4 states. [2018-11-10 04:32:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:46,713 INFO L93 Difference]: Finished difference Result 3393 states and 5318 transitions. [2018-11-10 04:32:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:46,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:32:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:46,720 INFO L225 Difference]: With dead ends: 3393 [2018-11-10 04:32:46,720 INFO L226 Difference]: Without dead ends: 1962 [2018-11-10 04:32:46,722 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 04:32:46,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-11-10 04:32:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1677. [2018-11-10 04:32:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-11-10 04:32:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2677 transitions. [2018-11-10 04:32:46,785 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2677 transitions. Word has length 184 [2018-11-10 04:32:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:46,786 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2677 transitions. [2018-11-10 04:32:46,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2677 transitions. [2018-11-10 04:32:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 04:32:46,789 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:46,790 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:46,790 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:46,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:46,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1430987453, now seen corresponding path program 1 times [2018-11-10 04:32:46,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:46,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:46,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:46,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-10 04:32:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:46,919 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:46,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:46,919 INFO L87 Difference]: Start difference. First operand 1677 states and 2677 transitions. Second operand 4 states. [2018-11-10 04:32:47,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:47,236 INFO L93 Difference]: Finished difference Result 3580 states and 5689 transitions. [2018-11-10 04:32:47,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:47,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 04:32:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:47,243 INFO L225 Difference]: With dead ends: 3580 [2018-11-10 04:32:47,243 INFO L226 Difference]: Without dead ends: 1917 [2018-11-10 04:32:47,246 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 04:32:47,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-11-10 04:32:47,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1813. [2018-11-10 04:32:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-11-10 04:32:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2893 transitions. [2018-11-10 04:32:47,309 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2893 transitions. Word has length 190 [2018-11-10 04:32:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:47,309 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2893 transitions. [2018-11-10 04:32:47,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:47,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2893 transitions. [2018-11-10 04:32:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 04:32:47,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:47,314 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 04:32:47,314 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:47,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:47,314 INFO L82 PathProgramCache]: Analyzing trace with hash 330595703, now seen corresponding path program 1 times [2018-11-10 04:32:47,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:47,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:47,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:47,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:47,450 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 04:32:47,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:47,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:47,450 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:47,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:47,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:47,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:47,451 INFO L87 Difference]: Start difference. First operand 1813 states and 2893 transitions. Second operand 4 states. [2018-11-10 04:32:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:48,006 INFO L93 Difference]: Finished difference Result 4851 states and 7709 transitions. [2018-11-10 04:32:48,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:48,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-11-10 04:32:48,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:48,015 INFO L225 Difference]: With dead ends: 4851 [2018-11-10 04:32:48,015 INFO L226 Difference]: Without dead ends: 3052 [2018-11-10 04:32:48,018 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 04:32:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-11-10 04:32:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2133. [2018-11-10 04:32:48,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-11-10 04:32:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3477 transitions. [2018-11-10 04:32:48,099 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3477 transitions. Word has length 190 [2018-11-10 04:32:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:48,099 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 3477 transitions. [2018-11-10 04:32:48,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3477 transitions. [2018-11-10 04:32:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 04:32:48,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:48,104 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 04:32:48,104 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:48,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:48,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1651524846, now seen corresponding path program 1 times [2018-11-10 04:32:48,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:48,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:48,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:48,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:48,233 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 04:32:48,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:48,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:48,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:48,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:48,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:48,234 INFO L87 Difference]: Start difference. First operand 2133 states and 3477 transitions. Second operand 4 states. [2018-11-10 04:32:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:48,692 INFO L93 Difference]: Finished difference Result 5219 states and 8397 transitions. [2018-11-10 04:32:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:48,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-11-10 04:32:48,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:48,701 INFO L225 Difference]: With dead ends: 5219 [2018-11-10 04:32:48,701 INFO L226 Difference]: Without dead ends: 3100 [2018-11-10 04:32:48,705 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 04:32:48,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-11-10 04:32:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2461. [2018-11-10 04:32:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-11-10 04:32:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4077 transitions. [2018-11-10 04:32:48,793 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4077 transitions. Word has length 191 [2018-11-10 04:32:48,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:48,794 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 4077 transitions. [2018-11-10 04:32:48,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:48,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4077 transitions. [2018-11-10 04:32:48,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 04:32:48,799 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:48,799 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:48,799 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:48,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:48,799 INFO L82 PathProgramCache]: Analyzing trace with hash 558354499, now seen corresponding path program 1 times [2018-11-10 04:32:48,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:48,800 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:48,930 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 04:32:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:48,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:48,931 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:48,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:48,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:48,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:48,932 INFO L87 Difference]: Start difference. First operand 2461 states and 4077 transitions. Second operand 4 states. [2018-11-10 04:32:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:49,382 INFO L93 Difference]: Finished difference Result 5875 states and 9581 transitions. [2018-11-10 04:32:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:49,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-10 04:32:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:49,392 INFO L225 Difference]: With dead ends: 5875 [2018-11-10 04:32:49,392 INFO L226 Difference]: Without dead ends: 3428 [2018-11-10 04:32:49,396 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 04:32:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2018-11-10 04:32:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2813. [2018-11-10 04:32:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2018-11-10 04:32:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4709 transitions. [2018-11-10 04:32:49,493 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4709 transitions. Word has length 199 [2018-11-10 04:32:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:49,494 INFO L481 AbstractCegarLoop]: Abstraction has 2813 states and 4709 transitions. [2018-11-10 04:32:49,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4709 transitions. [2018-11-10 04:32:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 04:32:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:49,499 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:32:49,500 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:49,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:49,500 INFO L82 PathProgramCache]: Analyzing trace with hash 296745168, now seen corresponding path program 1 times [2018-11-10 04:32:49,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:49,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:49,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:49,501 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:49,665 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 04:32:49,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:49,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:32:49,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 04:32:49,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:32:49,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:32:49,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:32:49,666 INFO L87 Difference]: Start difference. First operand 2813 states and 4709 transitions. Second operand 4 states. [2018-11-10 04:32:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:50,027 INFO L93 Difference]: Finished difference Result 6251 states and 10253 transitions. [2018-11-10 04:32:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:32:50,027 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-11-10 04:32:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:50,035 INFO L225 Difference]: With dead ends: 6251 [2018-11-10 04:32:50,035 INFO L226 Difference]: Without dead ends: 3436 [2018-11-10 04:32:50,039 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 04:32:50,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-11-10 04:32:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 2829. [2018-11-10 04:32:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2018-11-10 04:32:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4733 transitions. [2018-11-10 04:32:50,096 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4733 transitions. Word has length 200 [2018-11-10 04:32:50,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:50,097 INFO L481 AbstractCegarLoop]: Abstraction has 2829 states and 4733 transitions. [2018-11-10 04:32:50,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:32:50,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4733 transitions. [2018-11-10 04:32:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 04:32:50,100 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:50,100 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 04:32:50,100 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:50,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:50,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1969145605, now seen corresponding path program 1 times [2018-11-10 04:32:50,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 04:32:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:50,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:50,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 04:32:50,102 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 04:32:50,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:32:50,323 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:32:50,341 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,342 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,342 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,343 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:32:50,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:32:50 BoogieIcfgContainer [2018-11-10 04:32:50,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:32:50,401 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:32:50,401 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:32:50,401 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:32:50,402 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:01" (3/4) ... [2018-11-10 04:32:50,404 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 04:32:50,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:32:50,405 INFO L168 Benchmark]: Toolchain (without parser) took 51105.98 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.5 MB in the beginning and 1.7 GB in the end (delta: -761.8 MB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,406 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:32:50,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 684.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.49 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,407 INFO L168 Benchmark]: Boogie Preprocessor took 75.89 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,407 INFO L168 Benchmark]: RCFGBuilder took 1007.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 160.0 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,407 INFO L168 Benchmark]: TraceAbstraction took 49261.47 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 889.6 MB in the beginning and 1.7 GB in the end (delta: -829.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2018-11-10 04:32:50,408 INFO L168 Benchmark]: Witness Printer took 3.13 ms. Allocated memory is still 5.0 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 04:32:50,410 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 684.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.3 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -113.7 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.49 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: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.89 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1007.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 893.2 MB in the end (delta: 160.0 MB). Peak memory consumption was 160.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 49261.47 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 889.6 MB in the beginning and 1.7 GB in the end (delta: -829.7 MB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 3.13 ms. Allocated memory is still 5.0 GB. Free memory is still 1.7 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: 1726]: 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={24588: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={24588: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={24588: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={24588: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588: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={24588: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588: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 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={24588:0}] [L1583] COND FALSE !(ret <= 0) [L1588] CALL s->state = 8672 [L1588] RET s->state = 8672 [L1589] CALL s->init_num = 0 [L1589] RET s->init_num = 0 [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24588:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588: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 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588: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={24588: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588: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 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24588:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 49.2s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3235 SDtfs, 2681 SDslu, 4019 SDs, 0 SdLazy, 2913 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2829occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 39.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 3635 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2459 NumberOfCodeBlocks, 2459 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2412 ConstructedInterpolants, 84 QuantifiedInterpolants, 2470273 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1902 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 2390/2906 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 04:32:51,925 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 04:32:51,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 04:32:51,933 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 04:32:51,933 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 04:32:51,934 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 04:32:51,934 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 04:32:51,936 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 04:32:51,937 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 04:32:51,937 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 04:32:51,938 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 04:32:51,938 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 04:32:51,939 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 04:32:51,940 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 04:32:51,941 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 04:32:51,941 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 04:32:51,942 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 04:32:51,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 04:32:51,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 04:32:51,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 04:32:51,946 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 04:32:51,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 04:32:51,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 04:32:51,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 04:32:51,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 04:32:51,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 04:32:51,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 04:32:51,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 04:32:51,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 04:32:51,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 04:32:51,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 04:32:51,953 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 04:32:51,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 04:32:51,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 04:32:51,954 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 04:32:51,955 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 04:32:51,955 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 04:32:51,965 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 04:32:51,965 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 04:32:51,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 04:32:51,966 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 04:32:51,966 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 04:32:51,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 04:32:51,966 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 04:32:51,966 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 04:32:51,967 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 04:32:51,967 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 04:32:51,968 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 04:32:51,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 04:32:51,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 04:32:51,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 04:32:51,970 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 04:32:51,970 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_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-11-10 04:32:52,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 04:32:52,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 04:32:52,013 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 04:32:52,014 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 04:32:52,014 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 04:32:52,015 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:32:52,061 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2f51da8a0/3053d841a3a544fd81c90639ae84cfc5/FLAG650530287 [2018-11-10 04:32:52,446 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 04:32:52,446 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:32:52,459 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2f51da8a0/3053d841a3a544fd81c90639ae84cfc5/FLAG650530287 [2018-11-10 04:32:52,471 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/data/2f51da8a0/3053d841a3a544fd81c90639ae84cfc5 [2018-11-10 04:32:52,473 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 04:32:52,474 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 04:32:52,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 04:32:52,475 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 04:32:52,478 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 04:32:52,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:32:52" (1/1) ... [2018-11-10 04:32:52,481 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 04:32:52, skipping insertion in model container [2018-11-10 04:32:52,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:32:52" (1/1) ... [2018-11-10 04:32:52,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 04:32:52,534 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 04:32:53,061 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:32:53,071 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 04:32:53,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 04:32:53,318 INFO L193 MainTranslator]: Completed translation [2018-11-10 04:32:53,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53 WrapperNode [2018-11-10 04:32:53,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 04:32:53,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 04:32:53,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 04:32:53,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 04:32:53,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,395 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 04:32:53,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 04:32:53,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 04:32:53,441 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 04:32:53,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... [2018-11-10 04:32:53,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 04:32:53,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 04:32:53,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 04:32:53,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 04:32:53,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:53,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 04:32:53,561 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 04:32:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 04:32:53,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 04:32:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 04:32:53,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 04:32:53,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 04:32:53,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 04:32:55,979 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 04:32:55,979 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 04:32:56,743 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 04:32:56,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:56 BoogieIcfgContainer [2018-11-10 04:32:56,744 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 04:32:56,745 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 04:32:56,745 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 04:32:56,747 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 04:32:56,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:32:52" (1/3) ... [2018-11-10 04:32:56,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d5c5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:32:56, skipping insertion in model container [2018-11-10 04:32:56,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:32:53" (2/3) ... [2018-11-10 04:32:56,748 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71d5c5f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:32:56, skipping insertion in model container [2018-11-10 04:32:56,748 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:56" (3/3) ... [2018-11-10 04:32:56,750 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-11-10 04:32:56,757 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 04:32:56,763 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 04:32:56,775 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 04:32:56,799 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 04:32:56,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 04:32:56,799 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 04:32:56,800 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 04:32:56,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 04:32:56,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 04:32:56,800 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 04:32:56,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 04:32:56,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 04:32:56,815 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-11-10 04:32:56,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-10 04:32:56,821 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:56,822 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 04:32:56,823 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:56,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:56,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-11-10 04:32:56,832 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:56,833 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:56,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:57,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:57,042 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 04:32:57,043 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:57,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:57,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:57,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:57,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:57,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:57,064 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-11-10 04:32:57,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:57,179 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-11-10 04:32:57,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:57,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-10 04:32:57,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:57,191 INFO L225 Difference]: With dead ends: 438 [2018-11-10 04:32:57,191 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 04:32:57,194 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 04:32:57,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 04:32:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-11-10 04:32:57,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-11-10 04:32:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-11-10 04:32:57,231 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-11-10 04:32:57,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:57,231 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-11-10 04:32:57,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:57,232 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-11-10 04:32:57,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 04:32:57,233 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:57,233 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 04:32:57,233 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:57,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:57,234 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-11-10 04:32:57,235 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:57,235 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:57,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:57,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:57,414 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 04:32:57,414 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-10 04:32:57,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:57,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:57,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:57,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:57,418 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 3 states. [2018-11-10 04:32:57,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:57,527 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2018-11-10 04:32:57,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:57,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-10 04:32:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:57,530 INFO L225 Difference]: With dead ends: 518 [2018-11-10 04:32:57,530 INFO L226 Difference]: Without dead ends: 390 [2018-11-10 04:32:57,532 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 04:32:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-10 04:32:57,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-11-10 04:32:57,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-11-10 04:32:57,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2018-11-10 04:32:57,554 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 60 [2018-11-10 04:32:57,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:57,554 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2018-11-10 04:32:57,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:57,554 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2018-11-10 04:32:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 04:32:57,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:57,558 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 04:32:57,558 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:57,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:57,559 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-11-10 04:32:57,560 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:57,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:57,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:57,788 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 04:32:57,788 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:57,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:57,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:57,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:57,792 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2018-11-10 04:32:57,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:57,884 INFO L93 Difference]: Finished difference Result 764 states and 1153 transitions. [2018-11-10 04:32:57,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:57,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-11-10 04:32:57,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:57,887 INFO L225 Difference]: With dead ends: 764 [2018-11-10 04:32:57,887 INFO L226 Difference]: Without dead ends: 513 [2018-11-10 04:32:57,888 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 04:32:57,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-11-10 04:32:57,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-11-10 04:32:57,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-11-10 04:32:57,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 764 transitions. [2018-11-10 04:32:57,906 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 764 transitions. Word has length 83 [2018-11-10 04:32:57,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:57,907 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 764 transitions. [2018-11-10 04:32:57,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:57,907 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 764 transitions. [2018-11-10 04:32:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 04:32:57,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:57,910 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 04:32:57,911 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:57,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:57,912 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-11-10 04:32:57,912 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:57,912 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:57,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:58,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:58,134 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 04:32:58,134 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:58,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:58,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:58,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:58,138 INFO L87 Difference]: Start difference. First operand 513 states and 764 transitions. Second operand 3 states. [2018-11-10 04:32:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:58,185 INFO L93 Difference]: Finished difference Result 1012 states and 1521 transitions. [2018-11-10 04:32:58,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:58,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-11-10 04:32:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:58,188 INFO L225 Difference]: With dead ends: 1012 [2018-11-10 04:32:58,188 INFO L226 Difference]: Without dead ends: 638 [2018-11-10 04:32:58,188 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 04:32:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-11-10 04:32:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2018-11-10 04:32:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-11-10 04:32:58,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 949 transitions. [2018-11-10 04:32:58,201 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 949 transitions. Word has length 108 [2018-11-10 04:32:58,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:58,201 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 949 transitions. [2018-11-10 04:32:58,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 949 transitions. [2018-11-10 04:32:58,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 04:32:58,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:58,203 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 04:32:58,203 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:58,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -321735812, now seen corresponding path program 1 times [2018-11-10 04:32:58,204 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:58,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:58,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:58,392 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 04:32:58,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:58,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:58,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:58,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:58,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:58,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:58,395 INFO L87 Difference]: Start difference. First operand 638 states and 949 transitions. Second operand 3 states. [2018-11-10 04:32:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:58,434 INFO L93 Difference]: Finished difference Result 1258 states and 1884 transitions. [2018-11-10 04:32:58,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:58,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-11-10 04:32:58,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:58,437 INFO L225 Difference]: With dead ends: 1258 [2018-11-10 04:32:58,437 INFO L226 Difference]: Without dead ends: 759 [2018-11-10 04:32:58,438 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 04:32:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-11-10 04:32:58,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-11-10 04:32:58,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-11-10 04:32:58,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1129 transitions. [2018-11-10 04:32:58,448 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1129 transitions. Word has length 125 [2018-11-10 04:32:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:58,449 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1129 transitions. [2018-11-10 04:32:58,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1129 transitions. [2018-11-10 04:32:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-10 04:32:58,451 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:58,451 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 04:32:58,451 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:58,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-11-10 04:32:58,452 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:58,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:58,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:58,659 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 04:32:58,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:58,661 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:58,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:58,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:58,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:58,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:58,662 INFO L87 Difference]: Start difference. First operand 759 states and 1129 transitions. Second operand 3 states. [2018-11-10 04:32:58,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:58,709 INFO L93 Difference]: Finished difference Result 1502 states and 2248 transitions. [2018-11-10 04:32:58,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:58,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-11-10 04:32:58,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:58,715 INFO L225 Difference]: With dead ends: 1502 [2018-11-10 04:32:58,715 INFO L226 Difference]: Without dead ends: 882 [2018-11-10 04:32:58,716 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 04:32:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2018-11-10 04:32:58,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-11-10 04:32:58,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 04:32:58,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1311 transitions. [2018-11-10 04:32:58,730 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1311 transitions. Word has length 138 [2018-11-10 04:32:58,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:58,730 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1311 transitions. [2018-11-10 04:32:58,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:58,730 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1311 transitions. [2018-11-10 04:32:58,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 04:32:58,732 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:58,732 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 04:32:58,732 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:58,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:58,732 INFO L82 PathProgramCache]: Analyzing trace with hash 856976646, now seen corresponding path program 1 times [2018-11-10 04:32:58,733 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:58,733 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:58,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:32:58,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:32:58,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:32:58,980 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 04:32:58,980 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:32:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:32:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 04:32:58,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 04:32:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 04:32:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 04:32:58,984 INFO L87 Difference]: Start difference. First operand 882 states and 1311 transitions. Second operand 3 states. [2018-11-10 04:32:59,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:32:59,051 INFO L93 Difference]: Finished difference Result 1749 states and 2611 transitions. [2018-11-10 04:32:59,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 04:32:59,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-11-10 04:32:59,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:32:59,054 INFO L225 Difference]: With dead ends: 1749 [2018-11-10 04:32:59,054 INFO L226 Difference]: Without dead ends: 1006 [2018-11-10 04:32:59,055 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 04:32:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-11-10 04:32:59,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1004. [2018-11-10 04:32:59,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-11-10 04:32:59,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1492 transitions. [2018-11-10 04:32:59,070 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1492 transitions. Word has length 169 [2018-11-10 04:32:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:32:59,070 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1492 transitions. [2018-11-10 04:32:59,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 04:32:59,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1492 transitions. [2018-11-10 04:32:59,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 04:32:59,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:32:59,072 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 04:32:59,073 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:32:59,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:32:59,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1721971004, now seen corresponding path program 1 times [2018-11-10 04:32:59,073 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:32:59,074 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:32:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:33:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:33:01,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:33:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:01,923 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 04:33:01,948 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 04:33:01,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:01,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:01,985 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:01,986 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 20 treesize of output 13 [2018-11-10 04:33:01,986 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,152 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 04:33:02,156 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 04:33:02,156 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,163 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,207 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 04:33:02,215 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 04:33:02,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,226 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 04:33:02,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,238 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 04:33:02,239 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,251 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,261 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,269 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,305 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 04:33:02,306 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 04:33:02,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,412 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 04:33:02,418 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 04:33:02,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,456 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 04:33:02,459 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:02,460 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 04:33:02,461 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,487 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 04:33:02,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 04:33:02,520 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 04:33:02,530 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 04:33:02,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,541 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 04:33:02,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 04:33:02,552 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 04:33:02,555 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 04:33:02,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 04:33:02,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,631 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 04:33:02,636 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 04:33:02,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,681 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 04:33:02,685 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 04:33:02,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,717 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 04:33:02,724 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,724 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:02,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,726 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:02,730 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 04:33:02,730 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 04:33:02,738 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 04:33:02,748 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 04:33:02,749 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 04:33:02,768 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 04:33:02,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:02,773 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 04:33:02,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,787 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 04:33:02,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:33:02,792 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 04:33:02,794 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 04:33:02,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:02,798 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 04:33:02,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:33:02,960 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 04:33:02,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:33:03,049 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 04:33:03,052 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 04:33:03,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,059 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 04:33:03,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 04:33:03,118 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 04:33:03,157 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 04:33:03,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,173 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 04:33:03,176 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 04:33:03,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,190 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 04:33:03,206 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 04:33:03,206 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 04:33:03,253 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 04:33:03,256 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 04:33:03,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:03,259 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 04:33:03,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 04:33:03,582 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 04:33:03,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:33:03,587 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:33:03,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:33:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:33:04,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:33:04,069 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 04:33:04,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,109 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 04:33:04,113 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 04:33:04,113 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,120 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,150 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 04:33:04,153 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 04:33:04,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,158 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 04:33:04,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,168 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 04:33:04,169 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,187 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,212 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 04:33:04,212 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 04:33:04,331 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 04:33:04,335 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 04:33:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,377 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 04:33:04,379 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:04,379 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 04:33:04,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,389 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 04:33:04,390 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 04:33:04,422 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 04:33:04,424 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 04:33:04,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 04:33:04,485 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,491 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 04:33:04,493 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 04:33:04,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,511 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 04:33:04,513 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:04,513 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 04:33:04,514 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 04:33:04,519 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 04:33:04,528 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 04:33:04,528 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 04:33:04,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 23 treesize of output 18 [2018-11-10 04:33:04,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:04,537 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 04:33:04,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,549 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 04:33:04,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:33:04,554 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 04:33:04,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 13 treesize of output 5 [2018-11-10 04:33:04,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,561 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 04:33:04,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:33:04,614 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 04:33:04,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:33:04,685 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 04:33:04,722 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 04:33:04,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,737 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 04:33:04,740 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 04:33:04,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:04,751 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 04:33:04,761 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 04:33:04,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 04:33:05,061 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 04:33:05,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 04:33:05,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 04:33:05,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 04:33:05,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 04:33:05,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 04:33:05,083 INFO L87 Difference]: Start difference. First operand 1004 states and 1492 transitions. Second operand 24 states. [2018-11-10 04:33:32,422 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 04:33:35,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:33:35,061 INFO L93 Difference]: Finished difference Result 3908 states and 5839 transitions. [2018-11-10 04:33:35,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:33:35,062 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-10 04:33:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:33:35,067 INFO L225 Difference]: With dead ends: 3908 [2018-11-10 04:33:35,067 INFO L226 Difference]: Without dead ends: 2918 [2018-11-10 04:33:35,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 04:33:35,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2018-11-10 04:33:35,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1324. [2018-11-10 04:33:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-11-10 04:33:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2076 transitions. [2018-11-10 04:33:35,119 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2076 transitions. Word has length 175 [2018-11-10 04:33:35,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:33:35,119 INFO L481 AbstractCegarLoop]: Abstraction has 1324 states and 2076 transitions. [2018-11-10 04:33:35,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 04:33:35,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2076 transitions. [2018-11-10 04:33:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-10 04:33:35,121 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:33:35,121 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 04:33:35,122 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:33:35,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:33:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1848500927, now seen corresponding path program 1 times [2018-11-10 04:33:35,122 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:33:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:33:35,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:33:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:33:37,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:33:38,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,045 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 04:33:38,067 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 04:33:38,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,110 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 16 treesize of output 13 [2018-11-10 04:33:38,110 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,137 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,240 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 04:33:38,248 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 04:33:38,248 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,301 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 04:33:38,306 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 04:33:38,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,319 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 04:33:38,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,334 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,335 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,338 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 04:33:38,338 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,351 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,359 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,369 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,397 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 04:33:38,397 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 04:33:38,468 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,479 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 04:33:38,483 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 04:33:38,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,524 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 04:33:38,530 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:38,531 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 04:33:38,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,537 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,556 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 04:33:38,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 04:33:38,588 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 04:33:38,591 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 04:33:38,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,604 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 04:33:38,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 04:33:38,612 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 04:33:38,615 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 04:33:38,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 04:33:38,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,690 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 04:33:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 04:33:38,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,749 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 04:33:38,753 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 04:33:38,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,780 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 04:33:38,785 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:38,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,788 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,788 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 04:33:38,793 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 04:33:38,794 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 04:33:38,803 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 04:33:38,814 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 04:33:38,814 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 04:33:38,836 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 04:33:38,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:38,841 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 04:33:38,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,855 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 04:33:38,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:33:38,859 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 04:33:38,860 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 04:33:38,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:38,863 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 04:33:38,863 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:33:39,012 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 04:33:39,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:33:39,092 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 04:33:39,096 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 04:33:39,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,103 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 04:33:39,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-11-10 04:33:39,156 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 04:33:39,196 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 04:33:39,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,212 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 04:33:39,214 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 04:33:39,215 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,232 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 04:33:39,248 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 04:33:39,249 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 04:33:39,288 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 04:33:39,290 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 04:33:39,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,297 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 04:33:39,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 04:33:39,591 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 04:33:39,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 04:33:39,595 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 04:33:39,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:33:39,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:33:39,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:33:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 04:33:39,831 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 04:33:39,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:33:39,906 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 04:33:39,908 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 04:33:39,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:39,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:39,976 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 04:33:39,976 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-10 04:33:40,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:33:40,024 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 04:33:40,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:27 [2018-11-10 04:33:40,103 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 04:33:42,118 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 04:33:42,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:42,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:42,127 INFO L303 Elim1Store]: Index analysis took 2022 ms [2018-11-10 04:33:42,324 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 04:33:42,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 04:33:42,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:42,413 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 04:33:42,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:42,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 04:33:42,505 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 04:33:42,508 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:33:42,510 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 04:33:42,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:42,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:42,561 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 04:33:42,562 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:36 [2018-11-10 04:33:42,734 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 04:33:42,736 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 04:33:42,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:33:42,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:33:42,738 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 04:33:42,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:33:42,779 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 04:33:42,779 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:33:42,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-10 04:33:42,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 22 [2018-11-10 04:33:42,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 04:33:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 04:33:42,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-11-10 04:33:42,800 INFO L87 Difference]: Start difference. First operand 1324 states and 2076 transitions. Second operand 22 states. [2018-11-10 04:33:53,149 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 04:33:57,940 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 04:33:58,104 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-10 04:34:00,062 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-11-10 04:34:02,347 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-11-10 04:34:03,832 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 04:34:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:04,286 INFO L93 Difference]: Finished difference Result 4881 states and 7423 transitions. [2018-11-10 04:34:04,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 04:34:04,288 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 176 [2018-11-10 04:34:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:04,294 INFO L225 Difference]: With dead ends: 4881 [2018-11-10 04:34:04,294 INFO L226 Difference]: Without dead ends: 3571 [2018-11-10 04:34:04,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-11-10 04:34:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2018-11-10 04:34:04,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 1916. [2018-11-10 04:34:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-11-10 04:34:04,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 3140 transitions. [2018-11-10 04:34:04,364 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 3140 transitions. Word has length 176 [2018-11-10 04:34:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:04,364 INFO L481 AbstractCegarLoop]: Abstraction has 1916 states and 3140 transitions. [2018-11-10 04:34:04,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 04:34:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3140 transitions. [2018-11-10 04:34:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:34:04,367 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:04,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:04,367 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:04,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1065153562, now seen corresponding path program 1 times [2018-11-10 04:34:04,368 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:04,368 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:34:04,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:06,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:06,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:06,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 04:34:06,810 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 04:34:06,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 04:34:06,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 04:34:06,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,835 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 04:34:06,835 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-11-10 04:34:06,843 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 31 treesize of output 22 [2018-11-10 04:34:06,846 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 04:34:06,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-11-10 04:34:06,863 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 43 treesize of output 27 [2018-11-10 04:34:06,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 3 [2018-11-10 04:34:06,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:06,887 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 04:34:06,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-11-10 04:34:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:06,905 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:06,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:06,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:34:06,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:34:06,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:34:06,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:34:06,910 INFO L87 Difference]: Start difference. First operand 1916 states and 3140 transitions. Second operand 4 states. [2018-11-10 04:34:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:09,395 INFO L93 Difference]: Finished difference Result 3913 states and 6415 transitions. [2018-11-10 04:34:09,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:34:09,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 04:34:09,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:09,400 INFO L225 Difference]: With dead ends: 3913 [2018-11-10 04:34:09,400 INFO L226 Difference]: Without dead ends: 2011 [2018-11-10 04:34:09,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 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 04:34:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-11-10 04:34:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1932. [2018-11-10 04:34:09,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2018-11-10 04:34:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 3156 transitions. [2018-11-10 04:34:09,462 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 3156 transitions. Word has length 184 [2018-11-10 04:34:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:09,462 INFO L481 AbstractCegarLoop]: Abstraction has 1932 states and 3156 transitions. [2018-11-10 04:34:09,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:34:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 3156 transitions. [2018-11-10 04:34:09,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:34:09,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:09,465 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:09,466 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:09,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:09,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1353330916, now seen corresponding path program 1 times [2018-11-10 04:34:09,467 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:09,467 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:09,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:12,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:12,067 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 04:34:12,069 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 04:34:12,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 04:34:12,091 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 04:34:12,093 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:12,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 04:34:12,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,118 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 04:34:12,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 04:34:12,121 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 04:34:12,122 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 04:34:12,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:12,125 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 04:34:12,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:34:12,144 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-11-10 04:34:12,144 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:12,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:12,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:12,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:12,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:12,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:12,149 INFO L87 Difference]: Start difference. First operand 1932 states and 3156 transitions. Second operand 7 states. [2018-11-10 04:34:15,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:15,265 INFO L93 Difference]: Finished difference Result 4678 states and 7521 transitions. [2018-11-10 04:34:15,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:15,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2018-11-10 04:34:15,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:15,271 INFO L225 Difference]: With dead ends: 4678 [2018-11-10 04:34:15,272 INFO L226 Difference]: Without dead ends: 2760 [2018-11-10 04:34:15,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:15,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2018-11-10 04:34:15,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2146. [2018-11-10 04:34:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-11-10 04:34:15,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3514 transitions. [2018-11-10 04:34:15,392 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3514 transitions. Word has length 184 [2018-11-10 04:34:15,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:15,392 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 3514 transitions. [2018-11-10 04:34:15,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:34:15,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3514 transitions. [2018-11-10 04:34:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 04:34:15,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:15,396 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:15,396 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:15,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:15,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1542682778, now seen corresponding path program 1 times [2018-11-10 04:34:15,397 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:15,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:34:15,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:17,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:17,902 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 04:34:17,904 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 04:34:17,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:17,911 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 04:34:17,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:17,917 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:17,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:17,928 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 04:34:17,928 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:17,968 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 04:34:17,968 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:17,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:17,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:17,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:17,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:17,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:17,974 INFO L87 Difference]: Start difference. First operand 2146 states and 3514 transitions. Second operand 7 states. [2018-11-10 04:34:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:20,854 INFO L93 Difference]: Finished difference Result 4794 states and 7801 transitions. [2018-11-10 04:34:20,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:20,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2018-11-10 04:34:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:20,874 INFO L225 Difference]: With dead ends: 4794 [2018-11-10 04:34:20,875 INFO L226 Difference]: Without dead ends: 2662 [2018-11-10 04:34:20,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:20,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2018-11-10 04:34:20,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2378. [2018-11-10 04:34:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-11-10 04:34:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3922 transitions. [2018-11-10 04:34:20,996 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3922 transitions. Word has length 184 [2018-11-10 04:34:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:20,996 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 3922 transitions. [2018-11-10 04:34:20,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:34:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3922 transitions. [2018-11-10 04:34:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 04:34:21,000 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:21,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:21,001 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:21,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1883273073, now seen corresponding path program 1 times [2018-11-10 04:34:21,002 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:34:21,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:21,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:22,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:22,063 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 04:34:22,064 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 04:34:22,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:22,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:22,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:22,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:34:22,079 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 04:34:22,081 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 04:34:22,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:22,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:22,083 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 04:34:22,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:34:22,098 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 04:34:22,098 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:22,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:22,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:34:22,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:34:22,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:34:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:34:22,102 INFO L87 Difference]: Start difference. First operand 2378 states and 3922 transitions. Second operand 4 states. [2018-11-10 04:34:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:24,606 INFO L93 Difference]: Finished difference Result 4982 states and 8179 transitions. [2018-11-10 04:34:24,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:34:24,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-10 04:34:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:24,611 INFO L225 Difference]: With dead ends: 4982 [2018-11-10 04:34:24,611 INFO L226 Difference]: Without dead ends: 2618 [2018-11-10 04:34:24,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 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 04:34:24,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2018-11-10 04:34:24,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2514. [2018-11-10 04:34:24,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2018-11-10 04:34:24,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 4138 transitions. [2018-11-10 04:34:24,689 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 4138 transitions. Word has length 199 [2018-11-10 04:34:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:24,689 INFO L481 AbstractCegarLoop]: Abstraction has 2514 states and 4138 transitions. [2018-11-10 04:34:24,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:34:24,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4138 transitions. [2018-11-10 04:34:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-10 04:34:24,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:24,692 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:24,693 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:24,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2032657603, now seen corresponding path program 1 times [2018-11-10 04:34:24,694 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:24,694 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:34:24,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:25,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:25,710 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 04:34:25,712 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 04:34:25,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:25,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:25,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:25,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:34:25,724 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 04:34:25,726 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 04:34:25,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:25,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:25,728 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 04:34:25,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:34:25,748 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 04:34:25,749 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:25,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:25,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:34:25,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:34:25,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:34:25,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:34:25,753 INFO L87 Difference]: Start difference. First operand 2514 states and 4138 transitions. Second operand 4 states. [2018-11-10 04:34:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:28,526 INFO L93 Difference]: Finished difference Result 5828 states and 9471 transitions. [2018-11-10 04:34:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:34:28,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-11-10 04:34:28,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:28,534 INFO L225 Difference]: With dead ends: 5828 [2018-11-10 04:34:28,534 INFO L226 Difference]: Without dead ends: 3328 [2018-11-10 04:34:28,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 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 04:34:28,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2018-11-10 04:34:28,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 2866. [2018-11-10 04:34:28,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-11-10 04:34:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4770 transitions. [2018-11-10 04:34:28,614 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4770 transitions. Word has length 199 [2018-11-10 04:34:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:28,615 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4770 transitions. [2018-11-10 04:34:28,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:34:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4770 transitions. [2018-11-10 04:34:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 04:34:28,617 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:28,617 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:28,617 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:28,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1016708007, now seen corresponding path program 1 times [2018-11-10 04:34:28,617 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:28,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/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 04:34:28,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:31,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:31,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 04:34:31,589 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 04:34:31,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:31,594 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 04:34:31,594 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:31,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:31,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:31,616 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 04:34:31,616 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:31,631 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 04:34:31,634 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 04:34:31,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:31,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:31,638 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 04:34:31,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:34:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:31,662 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:31,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:31,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:31,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:31,667 INFO L87 Difference]: Start difference. First operand 2866 states and 4770 transitions. Second operand 7 states. [2018-11-10 04:34:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:34,692 INFO L93 Difference]: Finished difference Result 5994 states and 9889 transitions. [2018-11-10 04:34:34,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:34,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-11-10 04:34:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:34,696 INFO L225 Difference]: With dead ends: 5994 [2018-11-10 04:34:34,696 INFO L226 Difference]: Without dead ends: 3142 [2018-11-10 04:34:34,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-11-10 04:34:34,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2866. [2018-11-10 04:34:34,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-11-10 04:34:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4762 transitions. [2018-11-10 04:34:34,777 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4762 transitions. Word has length 200 [2018-11-10 04:34:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:34,778 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4762 transitions. [2018-11-10 04:34:34,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:34:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4762 transitions. [2018-11-10 04:34:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 04:34:34,780 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:34,780 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:34,780 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:34,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1684114373, now seen corresponding path program 1 times [2018-11-10 04:34:34,780 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:34,781 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:34,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:37,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:37,706 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 04:34:37,707 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 04:34:37,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:37,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 04:34:37,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:37,716 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:37,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:37,728 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 04:34:37,728 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:37,740 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 04:34:37,741 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 04:34:37,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:37,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:37,749 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 04:34:37,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:34:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:37,774 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:37,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:37,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:37,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:37,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:37,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:37,779 INFO L87 Difference]: Start difference. First operand 2866 states and 4762 transitions. Second operand 7 states. [2018-11-10 04:34:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:40,771 INFO L93 Difference]: Finished difference Result 5994 states and 9873 transitions. [2018-11-10 04:34:40,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:40,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-11-10 04:34:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:40,776 INFO L225 Difference]: With dead ends: 5994 [2018-11-10 04:34:40,776 INFO L226 Difference]: Without dead ends: 3142 [2018-11-10 04:34:40,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-11-10 04:34:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2866. [2018-11-10 04:34:40,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-11-10 04:34:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4754 transitions. [2018-11-10 04:34:40,858 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4754 transitions. Word has length 200 [2018-11-10 04:34:40,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:40,858 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4754 transitions. [2018-11-10 04:34:40,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:34:40,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4754 transitions. [2018-11-10 04:34:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 04:34:40,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:40,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:40,861 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:40,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1244498864, now seen corresponding path program 1 times [2018-11-10 04:34:40,861 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:40,861 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:41,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:41,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 13 treesize of output 10 [2018-11-10 04:34:41,853 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 04:34:41,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:41,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:41,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:41,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 04:34:41,863 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 04:34:41,865 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 04:34:41,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:41,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:41,867 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 04:34:41,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 04:34:41,886 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 04:34:41,886 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:41,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:41,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 04:34:41,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 04:34:41,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 04:34:41,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 04:34:41,890 INFO L87 Difference]: Start difference. First operand 2866 states and 4754 transitions. Second operand 4 states. [2018-11-10 04:34:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:44,752 INFO L93 Difference]: Finished difference Result 6145 states and 10025 transitions. [2018-11-10 04:34:44,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 04:34:44,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-11-10 04:34:44,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:44,758 INFO L225 Difference]: With dead ends: 6145 [2018-11-10 04:34:44,758 INFO L226 Difference]: Without dead ends: 3277 [2018-11-10 04:34:44,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 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 04:34:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-11-10 04:34:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2858. [2018-11-10 04:34:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-11-10 04:34:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4738 transitions. [2018-11-10 04:34:44,888 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4738 transitions. Word has length 200 [2018-11-10 04:34:44,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:44,888 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 4738 transitions. [2018-11-10 04:34:44,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 04:34:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4738 transitions. [2018-11-10 04:34:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 04:34:44,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:44,890 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:44,890 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:44,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:44,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1196440281, now seen corresponding path program 1 times [2018-11-10 04:34:44,891 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:44,891 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:44,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:47,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:47,809 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 04:34:47,810 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 04:34:47,812 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:47,814 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 04:34:47,815 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:47,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:47,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:47,833 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 04:34:47,833 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:47,844 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 04:34:47,845 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 04:34:47,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:47,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:47,849 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 04:34:47,849 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:34:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:47,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:47,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:47,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:47,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:47,877 INFO L87 Difference]: Start difference. First operand 2858 states and 4738 transitions. Second operand 7 states. [2018-11-10 04:34:48,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:48,896 INFO L93 Difference]: Finished difference Result 5978 states and 9825 transitions. [2018-11-10 04:34:48,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:48,897 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-11-10 04:34:48,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:48,902 INFO L225 Difference]: With dead ends: 5978 [2018-11-10 04:34:48,902 INFO L226 Difference]: Without dead ends: 3134 [2018-11-10 04:34:48,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2018-11-10 04:34:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2858. [2018-11-10 04:34:49,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-11-10 04:34:49,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4730 transitions. [2018-11-10 04:34:49,038 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4730 transitions. Word has length 201 [2018-11-10 04:34:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:49,038 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 4730 transitions. [2018-11-10 04:34:49,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:34:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4730 transitions. [2018-11-10 04:34:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 04:34:49,040 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:49,040 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:49,040 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:49,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1239269249, now seen corresponding path program 1 times [2018-11-10 04:34:49,041 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 22 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 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:49,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:51,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:51,842 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 04:34:51,843 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 04:34:51,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:51,846 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 04:34:51,846 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,852 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,863 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 04:34:51,863 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:51,874 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 04:34:51,876 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 04:34:51,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,879 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 04:34:51,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:34:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:51,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:34:51,925 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:34:51,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:51,926 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 04:34:51,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:34:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:51,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:34:51,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:34:51,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:34:51,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:34:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:34:51,945 INFO L87 Difference]: Start difference. First operand 2858 states and 4730 transitions. Second operand 9 states. [2018-11-10 04:34:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:55,676 INFO L93 Difference]: Finished difference Result 6596 states and 10657 transitions. [2018-11-10 04:34:55,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:34:55,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-11-10 04:34:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:55,681 INFO L225 Difference]: With dead ends: 6596 [2018-11-10 04:34:55,681 INFO L226 Difference]: Without dead ends: 4107 [2018-11-10 04:34:55,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:34:55,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-11-10 04:34:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3018. [2018-11-10 04:34:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-11-10 04:34:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4954 transitions. [2018-11-10 04:34:55,805 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4954 transitions. Word has length 202 [2018-11-10 04:34:55,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:34:55,806 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4954 transitions. [2018-11-10 04:34:55,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:34:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4954 transitions. [2018-11-10 04:34:55,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 04:34:55,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:34:55,809 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:34:55,809 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:34:55,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:34:55,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1718347776, now seen corresponding path program 1 times [2018-11-10 04:34:55,810 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:34:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 23 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 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:34:55,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:34:58,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:34:58,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:34:58,850 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 04:34:58,852 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 04:34:58,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:34:58,856 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 04:34:58,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:34:58,885 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 04:34:58,887 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 04:34:58,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:34:58,891 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 04:34:58,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:34:58,914 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:34:58,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:34:58,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:34:58,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:34:58,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:34:58,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:34:58,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:34:58,919 INFO L87 Difference]: Start difference. First operand 3018 states and 4954 transitions. Second operand 7 states. [2018-11-10 04:34:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:34:59,932 INFO L93 Difference]: Finished difference Result 6298 states and 10257 transitions. [2018-11-10 04:34:59,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:34:59,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2018-11-10 04:34:59,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:34:59,936 INFO L225 Difference]: With dead ends: 6298 [2018-11-10 04:34:59,936 INFO L226 Difference]: Without dead ends: 3294 [2018-11-10 04:34:59,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:34:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2018-11-10 04:35:00,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3018. [2018-11-10 04:35:00,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-11-10 04:35:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4946 transitions. [2018-11-10 04:35:00,038 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4946 transitions. Word has length 202 [2018-11-10 04:35:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:35:00,039 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4946 transitions. [2018-11-10 04:35:00,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:35:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4946 transitions. [2018-11-10 04:35:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 04:35:00,042 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:35:00,042 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 04:35:00,042 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:35:00,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:35:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1730709876, now seen corresponding path program 1 times [2018-11-10 04:35:00,043 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:35:00,043 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 24 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 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:35:00,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:35:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:35:03,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:35:03,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 04:35:03,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 04:35:03,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:35:03,093 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 04:35:03,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:03,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:03,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:03,110 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 04:35:03,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:35:03,122 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 04:35:03,123 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 04:35:03,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:03,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:03,127 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 04:35:03,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 04:35:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:35:03,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 04:35:03,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 04:35:03,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 04:35:03,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 04:35:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 04:35:03,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 04:35:03,156 INFO L87 Difference]: Start difference. First operand 3018 states and 4946 transitions. Second operand 7 states. [2018-11-10 04:35:04,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:35:04,158 INFO L93 Difference]: Finished difference Result 6218 states and 10137 transitions. [2018-11-10 04:35:04,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 04:35:04,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-11-10 04:35:04,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:35:04,161 INFO L225 Difference]: With dead ends: 6218 [2018-11-10 04:35:04,161 INFO L226 Difference]: Without dead ends: 3214 [2018-11-10 04:35:04,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 04:35:04,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2018-11-10 04:35:04,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3018. [2018-11-10 04:35:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-11-10 04:35:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4938 transitions. [2018-11-10 04:35:04,258 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4938 transitions. Word has length 203 [2018-11-10 04:35:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:35:04,258 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4938 transitions. [2018-11-10 04:35:04,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 04:35:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4938 transitions. [2018-11-10 04:35:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 04:35:04,260 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:35:04,260 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:04,260 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:35:04,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:35:04,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1932618470, now seen corresponding path program 1 times [2018-11-10 04:35:04,261 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:35:04,261 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 25 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 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:35:04,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:35:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:35:07,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:35:07,088 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 04:35:07,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 04:35:07,092 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:35:07,093 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 04:35:07,093 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,099 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,111 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 04:35:07,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:35:07,122 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 04:35:07,123 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 04:35:07,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,126 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 04:35:07,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:35:07,148 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:35:07,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:35:07,167 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:35:07,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:07,168 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 04:35:07,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:35:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:35:07,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:35:07,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:35:07,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:35:07,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:35:07,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:35:07,201 INFO L87 Difference]: Start difference. First operand 3018 states and 4938 transitions. Second operand 9 states. [2018-11-10 04:35:10,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:35:10,490 INFO L93 Difference]: Finished difference Result 6668 states and 10692 transitions. [2018-11-10 04:35:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:35:10,491 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-11-10 04:35:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:35:10,494 INFO L225 Difference]: With dead ends: 6668 [2018-11-10 04:35:10,494 INFO L226 Difference]: Without dead ends: 4039 [2018-11-10 04:35:10,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:35:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2018-11-10 04:35:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 3038. [2018-11-10 04:35:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3038 states. [2018-11-10 04:35:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4927 transitions. [2018-11-10 04:35:10,599 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4927 transitions. Word has length 203 [2018-11-10 04:35:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:35:10,599 INFO L481 AbstractCegarLoop]: Abstraction has 3038 states and 4927 transitions. [2018-11-10 04:35:10,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:35:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4927 transitions. [2018-11-10 04:35:10,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 04:35:10,602 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:35:10,602 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:10,602 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:35:10,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:35:10,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1098817530, now seen corresponding path program 1 times [2018-11-10 04:35:10,603 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:35:10,604 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 26 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 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:35:10,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:35:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 04:35:13,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 04:35:13,466 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 04:35:13,468 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 04:35:13,472 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 04:35:13,474 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 04:35:13,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,496 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 04:35:13,496 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 04:35:13,507 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 04:35:13,508 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 04:35:13,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,511 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 04:35:13,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 04:35:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 241 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:35:13,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 04:35:13,569 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 04:35:13,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 04:35:13,570 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 04:35:13,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 04:35:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-11-10 04:35:13,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 04:35:13,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 04:35:13,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 04:35:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 04:35:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 04:35:13,591 INFO L87 Difference]: Start difference. First operand 3038 states and 4927 transitions. Second operand 9 states. [2018-11-10 04:35:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 04:35:17,035 INFO L93 Difference]: Finished difference Result 6820 states and 10864 transitions. [2018-11-10 04:35:17,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 04:35:17,036 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2018-11-10 04:35:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 04:35:17,039 INFO L225 Difference]: With dead ends: 6820 [2018-11-10 04:35:17,039 INFO L226 Difference]: Without dead ends: 4184 [2018-11-10 04:35:17,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 04:35:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2018-11-10 04:35:17,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3214. [2018-11-10 04:35:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-11-10 04:35:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5167 transitions. [2018-11-10 04:35:17,172 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5167 transitions. Word has length 204 [2018-11-10 04:35:17,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 04:35:17,172 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 5167 transitions. [2018-11-10 04:35:17,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 04:35:17,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5167 transitions. [2018-11-10 04:35:17,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 04:35:17,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 04:35:17,174 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 04:35:17,174 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 04:35:17,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 04:35:17,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1969145605, now seen corresponding path program 1 times [2018-11-10 04:35:17,175 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 04:35:17,175 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/cvc4nyu Starting monitored process 27 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 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 04:35:17,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 04:35:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:35:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 04:35:26,426 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 04:35:26,444 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,446 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,446 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,446 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,447 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:35:26 BoogieIcfgContainer [2018-11-10 04:35:26,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 04:35:26,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 04:35:26,516 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 04:35:26,516 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 04:35:26,516 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 04:32:56" (3/4) ... [2018-11-10 04:35:26,518 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 04:35:26,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,529 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,530 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 04:35:26,612 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_00f0970c-1dc7-4d1a-a4ff-1f95f1bf0715/bin-2019/utaipan/witness.graphml [2018-11-10 04:35:26,613 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 04:35:26,613 INFO L168 Benchmark]: Toolchain (without parser) took 154139.50 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 253.2 MB). Free memory was 943.3 MB in the beginning and 1.0 GB in the end (delta: -80.6 MB). Peak memory consumption was 172.6 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,614 INFO L168 Benchmark]: CDTParser took 0.58 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 04:35:26,614 INFO L168 Benchmark]: CACSL2BoogieTranslator took 844.61 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 776.9 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,614 INFO L168 Benchmark]: Boogie Procedure Inliner took 120.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 776.9 MB in the beginning and 1.1 GB in the end (delta: -319.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,614 INFO L168 Benchmark]: Boogie Preprocessor took 71.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,614 INFO L168 Benchmark]: RCFGBuilder took 3231.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 919.5 MB in the end (delta: 170.4 MB). Peak memory consumption was 170.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,615 INFO L168 Benchmark]: TraceAbstraction took 149771.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 919.5 MB in the beginning and 1.0 GB in the end (delta: -123.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,615 INFO L168 Benchmark]: Witness Printer took 96.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-11-10 04:35:26,616 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.58 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 844.61 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 776.9 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 120.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 776.9 MB in the beginning and 1.1 GB in the end (delta: -319.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3231.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 919.5 MB in the end (delta: 170.4 MB). Peak memory consumption was 170.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149771.05 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 142.6 MB). Free memory was 919.5 MB in the beginning and 1.0 GB in the end (delta: -123.2 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Witness Printer took 96.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 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: 1726]: 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={1058913772: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={1058913772: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={1058913772: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={1058913772: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772: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={1058913772: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772: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 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1583] COND FALSE !(ret <= 0) [L1588] CALL s->state = 8672 [L1588] RET s->state = 8672 [L1589] CALL s->init_num = 0 [L1589] RET s->init_num = 0 [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1058913772:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772: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 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772: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={1058913772: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 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772: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 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1058913772:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 149.7s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 88.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5792 SDtfs, 9982 SDslu, 11405 SDs, 0 SdLazy, 10553 SolverSat, 1120 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 80.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5369 GetRequests, 5198 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3214occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 9573 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.4s SsaConstructionTime, 35.9s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5296 ConstructedInterpolants, 253 QuantifiedInterpolants, 6683003 SizeOfPredicates, 427 NumberOfNonLiveVariables, 25629 ConjunctsInSsa, 462 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 6492/7508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...