./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_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_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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 26d2d88b107593355990b3892c0d3e9a5490a1a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:28:50,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:28:50,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:28:50,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:28:50,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:28:50,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:28:50,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:28:50,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:28:50,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:28:50,280 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:28:50,281 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:28:50,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:28:50,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:28:50,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:28:50,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:28:50,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:28:50,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:28:50,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:28:50,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:28:50,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:28:50,298 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:28:50,299 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:28:50,301 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:28:50,302 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:28:50,302 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:28:50,303 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:28:50,306 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:28:50,307 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:28:50,308 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:28:50,310 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:28:50,310 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:28:50,311 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:28:50,311 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:28:50,311 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:28:50,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:28:50,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:28:50,313 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:28:50,328 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:28:50,328 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:28:50,329 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:28:50,329 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:28:50,329 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:28:50,329 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:28:50,329 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:28:50,329 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:28:50,329 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:28:50,330 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:28:50,330 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:28:50,330 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:28:50,330 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:28:50,331 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:28:50,335 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:28:50,336 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:28:50,336 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:28:50,336 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:28:50,336 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:28:50,336 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:28:50,336 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:28:50,337 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:28:50,337 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:28:50,338 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:28:50,338 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_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-10-26 20:28:50,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:28:50,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:28:50,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:28:50,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:28:50,387 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:28:50,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:28:50,436 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/77d9449bf/53c80791caa04faa840e75118e7a8561/FLAG0712b1c30 [2018-10-26 20:28:50,922 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:28:50,926 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:28:50,955 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/77d9449bf/53c80791caa04faa840e75118e7a8561/FLAG0712b1c30 [2018-10-26 20:28:50,974 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/77d9449bf/53c80791caa04faa840e75118e7a8561 [2018-10-26 20:28:50,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:28:50,978 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:28:50,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:28:50,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:28:50,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:28:50,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:28:50" (1/1) ... [2018-10-26 20:28:50,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6ef57d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:50, skipping insertion in model container [2018-10-26 20:28:50,987 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:28:50" (1/1) ... [2018-10-26 20:28:50,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:28:51,065 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:28:51,654 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:28:51,673 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:28:51,994 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:28:52,153 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:28:52,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52 WrapperNode [2018-10-26 20:28:52,154 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:28:52,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:28:52,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:28:52,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:28:52,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,185 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:28:52,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:28:52,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:28:52,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:28:52,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... [2018-10-26 20:28:52,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:28:52,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:28:52,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:28:52,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:28:52,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:28:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:28:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:28:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 20:28:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 20:28:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:28:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:28:52,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:28:52,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:28:53,219 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 20:28:53,220 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 20:28:54,607 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:28:54,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:54 BoogieIcfgContainer [2018-10-26 20:28:54,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:28:54,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:28:54,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:28:54,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:28:54,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:28:50" (1/3) ... [2018-10-26 20:28:54,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341f84c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:28:54, skipping insertion in model container [2018-10-26 20:28:54,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:28:52" (2/3) ... [2018-10-26 20:28:54,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@341f84c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:28:54, skipping insertion in model container [2018-10-26 20:28:54,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:54" (3/3) ... [2018-10-26 20:28:54,614 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:28:54,623 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:28:54,630 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:28:54,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:28:54,676 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:28:54,676 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:28:54,677 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:28:54,677 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:28:54,677 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:28:54,677 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:28:54,677 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:28:54,677 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:28:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-10-26 20:28:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:28:54,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:54,705 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-10-26 20:28:54,708 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:54,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-10-26 20:28:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:54,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:54,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:54,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:54,772 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:55,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:55,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:55,117 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:55,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:55,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:55,134 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-10-26 20:28:55,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:55,560 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-10-26 20:28:55,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:55,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 20:28:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:55,574 INFO L225 Difference]: With dead ends: 438 [2018-10-26 20:28:55,574 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 20:28:55,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:55,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 20:28:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-26 20:28:55,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:28:55,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-10-26 20:28:55,644 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-10-26 20:28:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:55,645 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-10-26 20:28:55,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-10-26 20:28:55,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 20:28:55,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:55,652 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-10-26 20:28:55,652 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:55,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-10-26 20:28:55,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:55,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:55,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:55,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:28:55,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:55,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:28:55,886 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:55,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:28:55,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:28:55,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:28:55,888 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 4 states. [2018-10-26 20:28:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:56,710 INFO L93 Difference]: Finished difference Result 439 states and 663 transitions. [2018-10-26 20:28:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:28:56,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-26 20:28:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:56,716 INFO L225 Difference]: With dead ends: 439 [2018-10-26 20:28:56,716 INFO L226 Difference]: Without dead ends: 311 [2018-10-26 20:28:56,717 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-10-26 20:28:56,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-26 20:28:56,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-10-26 20:28:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-26 20:28:56,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 438 transitions. [2018-10-26 20:28:56,736 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 438 transitions. Word has length 60 [2018-10-26 20:28:56,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:56,736 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 438 transitions. [2018-10-26 20:28:56,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:28:56,736 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 438 transitions. [2018-10-26 20:28:56,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 20:28:56,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:56,739 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-10-26 20:28:56,739 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:56,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash -182699472, now seen corresponding path program 1 times [2018-10-26 20:28:56,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:56,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:56,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:56,741 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:56,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:28:56,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:56,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:56,906 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:56,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:56,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:56,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:56,907 INFO L87 Difference]: Start difference. First operand 290 states and 438 transitions. Second operand 3 states. [2018-10-26 20:28:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:57,155 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2018-10-26 20:28:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:57,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-26 20:28:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:57,157 INFO L225 Difference]: With dead ends: 587 [2018-10-26 20:28:57,157 INFO L226 Difference]: Without dead ends: 436 [2018-10-26 20:28:57,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:57,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-26 20:28:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-10-26 20:28:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-26 20:28:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2018-10-26 20:28:57,186 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 74 [2018-10-26 20:28:57,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:57,187 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2018-10-26 20:28:57,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2018-10-26 20:28:57,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:28:57,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:57,190 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-10-26 20:28:57,190 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:57,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:57,190 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-10-26 20:28:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:57,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:57,193 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:57,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:28:57,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:57,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:57,337 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:57,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:57,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:57,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:57,337 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand 3 states. [2018-10-26 20:28:57,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:57,508 INFO L93 Difference]: Finished difference Result 882 states and 1351 transitions. [2018-10-26 20:28:57,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:57,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-26 20:28:57,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:57,510 INFO L225 Difference]: With dead ends: 882 [2018-10-26 20:28:57,510 INFO L226 Difference]: Without dead ends: 585 [2018-10-26 20:28:57,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-26 20:28:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2018-10-26 20:28:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-26 20:28:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 888 transitions. [2018-10-26 20:28:57,542 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 888 transitions. Word has length 83 [2018-10-26 20:28:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:57,542 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 888 transitions. [2018-10-26 20:28:57,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 888 transitions. [2018-10-26 20:28:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:28:57,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:57,550 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-10-26 20:28:57,550 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:57,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-10-26 20:28:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:57,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:57,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:57,552 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:28:57,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:57,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:57,779 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:57,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:57,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:57,781 INFO L87 Difference]: Start difference. First operand 585 states and 888 transitions. Second operand 3 states. [2018-10-26 20:28:57,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:57,989 INFO L93 Difference]: Finished difference Result 1182 states and 1810 transitions. [2018-10-26 20:28:57,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:57,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-26 20:28:57,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:57,993 INFO L225 Difference]: With dead ends: 1182 [2018-10-26 20:28:57,993 INFO L226 Difference]: Without dead ends: 736 [2018-10-26 20:28:57,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-26 20:28:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-10-26 20:28:58,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-26 20:28:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1121 transitions. [2018-10-26 20:28:58,015 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1121 transitions. Word has length 108 [2018-10-26 20:28:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:58,015 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1121 transitions. [2018-10-26 20:28:58,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1121 transitions. [2018-10-26 20:28:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 20:28:58,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:58,018 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-10-26 20:28:58,019 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:58,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1057268164, now seen corresponding path program 1 times [2018-10-26 20:28:58,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:58,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:58,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:58,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:58,022 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:28:58,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:58,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:58,164 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:58,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:58,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:58,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:58,165 INFO L87 Difference]: Start difference. First operand 734 states and 1121 transitions. Second operand 3 states. [2018-10-26 20:28:58,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:58,680 INFO L93 Difference]: Finished difference Result 1480 states and 2274 transitions. [2018-10-26 20:28:58,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:58,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-10-26 20:28:58,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:58,684 INFO L225 Difference]: With dead ends: 1480 [2018-10-26 20:28:58,684 INFO L226 Difference]: Without dead ends: 885 [2018-10-26 20:28:58,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:58,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-26 20:28:58,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2018-10-26 20:28:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-26 20:28:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1340 transitions. [2018-10-26 20:28:58,711 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1340 transitions. Word has length 114 [2018-10-26 20:28:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:58,712 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1340 transitions. [2018-10-26 20:28:58,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1340 transitions. [2018-10-26 20:28:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 20:28:58,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:58,715 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-10-26 20:28:58,715 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:58,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:58,717 INFO L82 PathProgramCache]: Analyzing trace with hash 606270970, now seen corresponding path program 1 times [2018-10-26 20:28:58,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:58,719 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:58,922 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:28:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:58,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:58,923 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:58,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:58,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:58,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:58,925 INFO L87 Difference]: Start difference. First operand 883 states and 1340 transitions. Second operand 3 states. [2018-10-26 20:28:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:28:59,462 INFO L93 Difference]: Finished difference Result 1776 states and 2711 transitions. [2018-10-26 20:28:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:28:59,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-26 20:28:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:28:59,467 INFO L225 Difference]: With dead ends: 1776 [2018-10-26 20:28:59,467 INFO L226 Difference]: Without dead ends: 1032 [2018-10-26 20:28:59,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-26 20:28:59,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-10-26 20:28:59,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-10-26 20:28:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1570 transitions. [2018-10-26 20:28:59,494 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1570 transitions. Word has length 131 [2018-10-26 20:28:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:28:59,495 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1570 transitions. [2018-10-26 20:28:59,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:28:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1570 transitions. [2018-10-26 20:28:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 20:28:59,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:28:59,497 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-10-26 20:28:59,497 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:28:59,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:28:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-10-26 20:28:59,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:28:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:28:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:28:59,499 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:28:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:28:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 20:28:59,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:28:59,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:28:59,653 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:28:59,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:28:59,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:28:59,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:28:59,653 INFO L87 Difference]: Start difference. First operand 1032 states and 1570 transitions. Second operand 3 states. [2018-10-26 20:29:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:00,042 INFO L93 Difference]: Finished difference Result 1185 states and 1800 transitions. [2018-10-26 20:29:00,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:29:00,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-26 20:29:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:00,046 INFO L225 Difference]: With dead ends: 1185 [2018-10-26 20:29:00,046 INFO L226 Difference]: Without dead ends: 1183 [2018-10-26 20:29:00,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:29:00,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-10-26 20:29:00,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2018-10-26 20:29:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-10-26 20:29:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1797 transitions. [2018-10-26 20:29:00,079 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1797 transitions. Word has length 138 [2018-10-26 20:29:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:00,080 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1797 transitions. [2018-10-26 20:29:00,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:29:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1797 transitions. [2018-10-26 20:29:00,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:29:00,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:00,084 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-10-26 20:29:00,084 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:00,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:00,084 INFO L82 PathProgramCache]: Analyzing trace with hash 850355908, now seen corresponding path program 1 times [2018-10-26 20:29:00,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:00,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:00,574 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:29:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-26 20:29:01,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:29:01,159 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:29:01,159 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-10-26 20:29:01,161 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], [535], [540], [542], [545], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-10-26 20:29:01,227 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:29:01,228 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:29:02,001 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:29:43,939 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:29:43,940 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-10-26 20:29:43,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:43,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:29:43,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:29:43,985 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:29:43,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:43,999 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:29:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:44,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:29:44,540 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-26 20:29:44,566 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-10-26 20:29:44,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:44,765 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-10-26 20:29:44,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:29:44,780 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:44,808 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,010 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-10-26 20:29:45,025 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-10-26 20:29:45,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:29:45,096 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-10-26 20:29:45,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:29:45,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:29:45,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:29:45,252 INFO L303 Elim1Store]: Index analysis took 154 ms [2018-10-26 20:29:45,253 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-10-26 20:29:45,253 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,421 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,434 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,521 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-10-26 20:29:45,521 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-10-26 20:29:45,676 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-10-26 20:29:45,687 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-10-26 20:29:45,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:45,712 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-10-26 20:29:45,744 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-10-26 20:29:45,744 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,060 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-10-26 20:29:46,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:29:46,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:29:46,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-26 20:29:46,200 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-10-26 20:29:46,211 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-10-26 20:29:46,212 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:29:46,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:29:46,286 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-10-26 20:29:46,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:29:46,288 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-10-26 20:29:46,318 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-10-26 20:29:46,324 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:29:46,325 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-10-26 20:29:46,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-10-26 20:29:46,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:29:46,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:29:46,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:46,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 20:29:46,442 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:29:46,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:29:47,069 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-10-26 20:29:47,280 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-26 20:29:47,282 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-10-26 20:29:47,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:47,289 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-10-26 20:29:47,291 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-10-26 20:29:47,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:29:47,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:47,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:47,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:29:47,302 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:29:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:29:48,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:29:48,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-10-26 20:29:48,089 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:29:48,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 20:29:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 20:29:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:29:48,091 INFO L87 Difference]: Start difference. First operand 1181 states and 1797 transitions. Second operand 17 states. [2018-10-26 20:29:52,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:52,948 INFO L93 Difference]: Finished difference Result 3051 states and 4660 transitions. [2018-10-26 20:29:52,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:29:52,956 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2018-10-26 20:29:52,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:52,961 INFO L225 Difference]: With dead ends: 3051 [2018-10-26 20:29:52,961 INFO L226 Difference]: Without dead ends: 1884 [2018-10-26 20:29:52,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:29:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-10-26 20:29:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1445. [2018-10-26 20:29:53,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-10-26 20:29:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2269 transitions. [2018-10-26 20:29:53,018 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2269 transitions. Word has length 175 [2018-10-26 20:29:53,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:53,018 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2269 transitions. [2018-10-26 20:29:53,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 20:29:53,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2269 transitions. [2018-10-26 20:29:53,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:29:53,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:53,023 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] [2018-10-26 20:29:53,023 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:53,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:53,024 INFO L82 PathProgramCache]: Analyzing trace with hash -10605328, now seen corresponding path program 1 times [2018-10-26 20:29:53,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:53,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:53,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:53,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:53,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:53,317 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 20:29:53,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:53,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:53,317 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:53,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:53,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:53,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:53,318 INFO L87 Difference]: Start difference. First operand 1445 states and 2269 transitions. Second operand 4 states. [2018-10-26 20:29:54,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:54,277 INFO L93 Difference]: Finished difference Result 3393 states and 5318 transitions. [2018-10-26 20:29:54,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:29:54,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-26 20:29:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:54,289 INFO L225 Difference]: With dead ends: 3393 [2018-10-26 20:29:54,289 INFO L226 Difference]: Without dead ends: 1962 [2018-10-26 20:29:54,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:54,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-26 20:29:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1677. [2018-10-26 20:29:54,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-10-26 20:29:54,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2677 transitions. [2018-10-26 20:29:54,350 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2677 transitions. Word has length 182 [2018-10-26 20:29:54,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:54,351 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2677 transitions. [2018-10-26 20:29:54,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:29:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2677 transitions. [2018-10-26 20:29:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 20:29:54,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:54,356 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-10-26 20:29:54,356 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:54,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:54,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1629534909, now seen corresponding path program 1 times [2018-10-26 20:29:54,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:54,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:54,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:54,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-26 20:29:54,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:54,618 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:54,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:54,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:54,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:54,619 INFO L87 Difference]: Start difference. First operand 1677 states and 2677 transitions. Second operand 4 states. [2018-10-26 20:29:56,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:56,201 INFO L93 Difference]: Finished difference Result 3580 states and 5689 transitions. [2018-10-26 20:29:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:29:56,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 20:29:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:56,207 INFO L225 Difference]: With dead ends: 3580 [2018-10-26 20:29:56,207 INFO L226 Difference]: Without dead ends: 1917 [2018-10-26 20:29:56,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:29:56,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-10-26 20:29:56,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1813. [2018-10-26 20:29:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-10-26 20:29:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2893 transitions. [2018-10-26 20:29:56,270 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2893 transitions. Word has length 190 [2018-10-26 20:29:56,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:56,271 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2893 transitions. [2018-10-26 20:29:56,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:29:56,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2893 transitions. [2018-10-26 20:29:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 20:29:56,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:56,276 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-10-26 20:29:56,276 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:56,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:56,277 INFO L82 PathProgramCache]: Analyzing trace with hash 132048247, now seen corresponding path program 1 times [2018-10-26 20:29:56,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:56,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:56,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:56,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:56,278 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:56,532 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-26 20:29:56,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:56,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:56,532 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:56,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:56,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:56,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:56,533 INFO L87 Difference]: Start difference. First operand 1813 states and 2893 transitions. Second operand 4 states. [2018-10-26 20:29:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:57,526 INFO L93 Difference]: Finished difference Result 4851 states and 7709 transitions. [2018-10-26 20:29:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:29:57,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 20:29:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:57,548 INFO L225 Difference]: With dead ends: 4851 [2018-10-26 20:29:57,549 INFO L226 Difference]: Without dead ends: 3052 [2018-10-26 20:29:57,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:29:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-10-26 20:29:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2133. [2018-10-26 20:29:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-10-26 20:29:57,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3477 transitions. [2018-10-26 20:29:57,635 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3477 transitions. Word has length 190 [2018-10-26 20:29:57,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:57,635 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 3477 transitions. [2018-10-26 20:29:57,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:29:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3477 transitions. [2018-10-26 20:29:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 20:29:57,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:57,641 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-10-26 20:29:57,641 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:57,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:57,642 INFO L82 PathProgramCache]: Analyzing trace with hash -208478994, now seen corresponding path program 1 times [2018-10-26 20:29:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:57,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:57,645 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2018-10-26 20:29:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:57,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:57,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:57,868 INFO L87 Difference]: Start difference. First operand 2133 states and 3477 transitions. Second operand 4 states. [2018-10-26 20:29:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:58,241 INFO L93 Difference]: Finished difference Result 5219 states and 8397 transitions. [2018-10-26 20:29:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:29:58,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-10-26 20:29:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:58,256 INFO L225 Difference]: With dead ends: 5219 [2018-10-26 20:29:58,257 INFO L226 Difference]: Without dead ends: 3100 [2018-10-26 20:29:58,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:29:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-26 20:29:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2461. [2018-10-26 20:29:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-26 20:29:58,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4077 transitions. [2018-10-26 20:29:58,349 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4077 transitions. Word has length 191 [2018-10-26 20:29:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:58,349 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 4077 transitions. [2018-10-26 20:29:58,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:29:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4077 transitions. [2018-10-26 20:29:58,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:29:58,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:58,356 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] [2018-10-26 20:29:58,356 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:58,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash -867015539, now seen corresponding path program 1 times [2018-10-26 20:29:58,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:58,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:58,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:58,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:29:58,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:58,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:58,594 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:58,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:58,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:58,595 INFO L87 Difference]: Start difference. First operand 2461 states and 4077 transitions. Second operand 4 states. [2018-10-26 20:29:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:29:59,382 INFO L93 Difference]: Finished difference Result 5890 states and 9596 transitions. [2018-10-26 20:29:59,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:29:59,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-26 20:29:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:29:59,389 INFO L225 Difference]: With dead ends: 5890 [2018-10-26 20:29:59,389 INFO L226 Difference]: Without dead ends: 3443 [2018-10-26 20:29:59,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:29:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3443 states. [2018-10-26 20:29:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3443 to 2812. [2018-10-26 20:29:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2812 states. [2018-10-26 20:29:59,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4692 transitions. [2018-10-26 20:29:59,493 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4692 transitions. Word has length 197 [2018-10-26 20:29:59,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:29:59,494 INFO L481 AbstractCegarLoop]: Abstraction has 2812 states and 4692 transitions. [2018-10-26 20:29:59,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:29:59,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4692 transitions. [2018-10-26 20:29:59,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:29:59,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:29:59,501 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] [2018-10-26 20:29:59,501 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:29:59,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:29:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1043556602, now seen corresponding path program 1 times [2018-10-26 20:29:59,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:29:59,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:59,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:29:59,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:29:59,502 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:29:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:29:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:29:59,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:29:59,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:29:59,786 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:29:59,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:29:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:29:59,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:29:59,787 INFO L87 Difference]: Start difference. First operand 2812 states and 4692 transitions. Second operand 4 states. [2018-10-26 20:30:00,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:30:00,162 INFO L93 Difference]: Finished difference Result 6249 states and 10219 transitions. [2018-10-26 20:30:00,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:30:00,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-10-26 20:30:00,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:30:00,175 INFO L225 Difference]: With dead ends: 6249 [2018-10-26 20:30:00,176 INFO L226 Difference]: Without dead ends: 3451 [2018-10-26 20:30:00,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:30:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2018-10-26 20:30:00,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 2828. [2018-10-26 20:30:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2018-10-26 20:30:00,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4716 transitions. [2018-10-26 20:30:00,285 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4716 transitions. Word has length 198 [2018-10-26 20:30:00,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:30:00,286 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 4716 transitions. [2018-10-26 20:30:00,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:30:00,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4716 transitions. [2018-10-26 20:30:00,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:30:00,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:30:00,291 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:30:00,291 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:30:00,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:30:00,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1016428612, now seen corresponding path program 1 times [2018-10-26 20:30:00,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:30:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:30:00,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:30:00,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:30:00,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:30:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:30:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 251 proven. 6 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-10-26 20:30:00,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:30:00,513 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:30:00,514 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-10-26 20:30:00,514 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], [113], [115], [120], [123], [125], [130], [133], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [190], [195], [198], [279], [282], [290], [292], [295], [297], [303], [306], [310], [312], [317], [320], [328], [330], [332], [337], [339], [342], [371], [374], [382], [392], [394], [397], [408], [410], [420], [422], [425], [509], [514], [519], [524], [527], [535], [540], [581], [615], [617], [629], [632], [633], [634], [636] [2018-10-26 20:30:00,521 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:30:00,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:30:00,979 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:31:02,181 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:31:02,182 INFO L272 AbstractInterpreter]: Visited 92 different actions 668 times. Merged at 73 different actions 528 times. Widened at 13 different actions 41 times. Found 31 fixpoints after 14 different actions. Largest state had 166 variables. [2018-10-26 20:31:02,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:02,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:31:02,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:31:02,192 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:31:02,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:02,199 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:31:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:02,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:02,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:31:02,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:02,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,513 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:31:02,522 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-10-26 20:31:02,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:02,529 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-10-26 20:31:02,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:9 [2018-10-26 20:31:02,564 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-10-26 20:31:02,574 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-10-26 20:31:02,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:02,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:3 [2018-10-26 20:31:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-10-26 20:31:02,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:31:03,068 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 20 treesize of output 16 [2018-10-26 20:31:03,076 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 16 treesize of output 1 [2018-10-26 20:31:03,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:03,077 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:03,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:03,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2018-10-26 20:31:03,269 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 237 proven. 4 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-26 20:31:03,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:31:03,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 13 [2018-10-26 20:31:03,290 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:31:03,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:31:03,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:31:03,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-10-26 20:31:03,291 INFO L87 Difference]: Start difference. First operand 2828 states and 4716 transitions. Second operand 4 states. [2018-10-26 20:31:03,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:03,662 INFO L93 Difference]: Finished difference Result 6127 states and 10028 transitions. [2018-10-26 20:31:03,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:31:03,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-10-26 20:31:03,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:03,669 INFO L225 Difference]: With dead ends: 6127 [2018-10-26 20:31:03,670 INFO L226 Difference]: Without dead ends: 3313 [2018-10-26 20:31:03,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 405 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:31:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2018-10-26 20:31:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2828. [2018-10-26 20:31:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2828 states. [2018-10-26 20:31:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 4708 transitions. [2018-10-26 20:31:03,777 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 4708 transitions. Word has length 205 [2018-10-26 20:31:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:03,777 INFO L481 AbstractCegarLoop]: Abstraction has 2828 states and 4708 transitions. [2018-10-26 20:31:03,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:31:03,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 4708 transitions. [2018-10-26 20:31:03,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:31:03,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:03,785 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-10-26 20:31:03,785 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:03,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:03,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1084632837, now seen corresponding path program 1 times [2018-10-26 20:31:03,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:31:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:31:03,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:03,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:31:03,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:31:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:31:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:31:04,199 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:31:04,226 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,228 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,228 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,229 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,230 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,230 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:31:04,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:31:04 BoogieIcfgContainer [2018-10-26 20:31:04,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:31:04,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:31:04,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:31:04,337 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:31:04,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:28:54" (3/4) ... [2018-10-26 20:31:04,342 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 20:31:04,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:31:04,343 INFO L168 Benchmark]: Toolchain (without parser) took 133365.56 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 955.0 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 394.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,344 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:31:04,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1174.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 187.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,345 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.64 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,345 INFO L168 Benchmark]: Boogie Preprocessor took 131.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,345 INFO L168 Benchmark]: RCFGBuilder took 2207.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.3 MB in the end (delta: 157.8 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,346 INFO L168 Benchmark]: TraceAbstraction took 129728.43 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 968.3 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:31:04,346 INFO L168 Benchmark]: Witness Printer took 5.60 ms. Allocated memory is still 5.1 GB. Free memory is still 4.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:31:04,355 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1174.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 187.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.64 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: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 131.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2207.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.3 MB in the end (delta: 157.8 MB). Peak memory consumption was 157.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129728.43 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 968.3 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 260.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.60 ms. Allocated memory is still 5.1 GB. Free memory is still 4.6 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}] [L1591] COND FALSE !(ret <= 0) [L1596] CALL s->state = 8672 [L1596] RET s->state = 8672 [L1597] CALL s->init_num = 0 [L1597] RET s->init_num = 0 [L1598] 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 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] 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, 129.6s OverallTime, 17 OverallIterations, 7 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3510 SDtfs, 2784 SDslu, 4409 SDs, 0 SdLazy, 3198 SolverSat, 380 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 845 GetRequests, 778 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2828occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 104.5s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 4152 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 2863 NumberOfCodeBlocks, 2863 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 3018 ConstructedInterpolants, 84 QuantifiedInterpolants, 2724901 SizeOfPredicates, 68 NumberOfNonLiveVariables, 4055 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 20 InterpolantComputations, 15 PerfectInterpolantSequences, 3481/4007 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:31:06,350 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:31:06,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:31:06,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:31:06,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:31:06,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:31:06,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:31:06,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:31:06,377 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:31:06,378 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:31:06,378 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:31:06,378 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:31:06,379 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:31:06,381 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:31:06,381 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:31:06,382 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:31:06,383 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:31:06,385 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:31:06,386 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:31:06,388 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:31:06,389 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:31:06,390 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:31:06,392 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:31:06,392 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:31:06,392 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:31:06,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:31:06,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:31:06,394 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:31:06,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:31:06,397 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:31:06,397 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:31:06,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:31:06,398 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:31:06,398 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:31:06,399 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:31:06,399 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:31:06,399 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 20:31:06,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:31:06,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:31:06,417 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:31:06,417 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:31:06,417 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:31:06,418 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:31:06,418 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:31:06,418 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:31:06,418 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:31:06,418 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 20:31:06,419 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:31:06,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:31:06,420 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:31:06,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:31:06,421 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 20:31:06,422 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 20:31:06,422 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_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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 -> 26d2d88b107593355990b3892c0d3e9a5490a1a3 [2018-10-26 20:31:06,463 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:31:06,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:31:06,479 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:31:06,480 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:31:06,481 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:31:06,481 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:31:06,531 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/4b9f98b4e/36a57771ce82402da66cc8c772ea9558/FLAG7406c27e8 [2018-10-26 20:31:07,039 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:31:07,041 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/sv-benchmarks/c/ssh/s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:31:07,057 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/4b9f98b4e/36a57771ce82402da66cc8c772ea9558/FLAG7406c27e8 [2018-10-26 20:31:07,067 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/data/4b9f98b4e/36a57771ce82402da66cc8c772ea9558 [2018-10-26 20:31:07,070 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:31:07,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:31:07,073 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:31:07,073 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:31:07,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:31:07,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:31:07" (1/1) ... [2018-10-26 20:31:07,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f0fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:07, skipping insertion in model container [2018-10-26 20:31:07,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:31:07" (1/1) ... [2018-10-26 20:31:07,090 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:31:07,168 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:31:07,821 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:31:07,833 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:31:08,207 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:31:08,227 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:31:08,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08 WrapperNode [2018-10-26 20:31:08,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:31:08,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:31:08,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:31:08,229 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:31:08,237 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:31:08,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:31:08,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:31:08,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:31:08,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... [2018-10-26 20:31:08,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:31:08,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:31:08,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:31:08,542 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:31:08,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:31:08,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:31:08,605 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:31:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 20:31:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 20:31:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:31:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:31:08,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:31:08,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:31:11,235 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 20:31:11,236 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 20:31:12,686 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:31:12,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:31:12 BoogieIcfgContainer [2018-10-26 20:31:12,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:31:12,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:31:12,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:31:12,691 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:31:12,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:31:07" (1/3) ... [2018-10-26 20:31:12,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5dff04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:31:12, skipping insertion in model container [2018-10-26 20:31:12,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:31:08" (2/3) ... [2018-10-26 20:31:12,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5dff04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:31:12, skipping insertion in model container [2018-10-26 20:31:12,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:31:12" (3/3) ... [2018-10-26 20:31:12,694 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07_false-unreach-call.i.cil.c [2018-10-26 20:31:12,703 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:31:12,709 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:31:12,725 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:31:12,757 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:31:12,758 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:31:12,758 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:31:12,758 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:31:12,759 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:31:12,759 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:31:12,759 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:31:12,759 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:31:12,759 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:31:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-10-26 20:31:12,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:31:12,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:12,787 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-10-26 20:31:12,790 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:12,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-10-26 20:31:12,802 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:12,804 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:12,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:13,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:31:13,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:13,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:13,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:13,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:13,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:13,112 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-10-26 20:31:13,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:13,390 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-10-26 20:31:13,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:13,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 20:31:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:13,402 INFO L225 Difference]: With dead ends: 438 [2018-10-26 20:31:13,402 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 20:31:13,406 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-10-26 20:31:13,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 20:31:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-26 20:31:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:31:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-10-26 20:31:13,463 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-10-26 20:31:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:13,464 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-10-26 20:31:13,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:13,464 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-10-26 20:31:13,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 20:31:13,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:13,466 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-10-26 20:31:13,467 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:13,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-10-26 20:31:13,469 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:13,469 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:13,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:13,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:31:13,730 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-10-26 20:31:13,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:13,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:13,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:13,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:13,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:13,735 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 3 states. [2018-10-26 20:31:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:14,032 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2018-10-26 20:31:14,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:14,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-26 20:31:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:14,035 INFO L225 Difference]: With dead ends: 518 [2018-10-26 20:31:14,035 INFO L226 Difference]: Without dead ends: 390 [2018-10-26 20:31:14,036 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-10-26 20:31:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-26 20:31:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-10-26 20:31:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-26 20:31:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2018-10-26 20:31:14,064 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 60 [2018-10-26 20:31:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:14,064 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2018-10-26 20:31:14,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2018-10-26 20:31:14,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:31:14,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:14,069 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-10-26 20:31:14,069 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:14,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:14,069 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-10-26 20:31:14,070 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:14,070 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:14,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:14,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:14,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:31:14,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:14,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:14,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:14,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:14,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:14,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:14,405 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2018-10-26 20:31:14,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:14,884 INFO L93 Difference]: Finished difference Result 762 states and 1149 transitions. [2018-10-26 20:31:14,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:14,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-26 20:31:14,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:14,887 INFO L225 Difference]: With dead ends: 762 [2018-10-26 20:31:14,887 INFO L226 Difference]: Without dead ends: 511 [2018-10-26 20:31:14,889 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-10-26 20:31:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-26 20:31:14,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-10-26 20:31:14,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-26 20:31:14,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 762 transitions. [2018-10-26 20:31:14,916 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 762 transitions. Word has length 83 [2018-10-26 20:31:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:14,917 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 762 transitions. [2018-10-26 20:31:14,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 762 transitions. [2018-10-26 20:31:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:31:14,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:14,927 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-10-26 20:31:14,927 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:14,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:14,927 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-10-26 20:31:14,928 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:14,928 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:14,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:15,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:15,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:15,237 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:15,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:15,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:15,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:15,242 INFO L87 Difference]: Start difference. First operand 511 states and 762 transitions. Second operand 3 states. [2018-10-26 20:31:15,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:15,568 INFO L93 Difference]: Finished difference Result 1008 states and 1517 transitions. [2018-10-26 20:31:15,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:15,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-26 20:31:15,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:15,571 INFO L225 Difference]: With dead ends: 1008 [2018-10-26 20:31:15,571 INFO L226 Difference]: Without dead ends: 636 [2018-10-26 20:31:15,572 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-10-26 20:31:15,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-10-26 20:31:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2018-10-26 20:31:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-26 20:31:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 947 transitions. [2018-10-26 20:31:15,590 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 947 transitions. Word has length 108 [2018-10-26 20:31:15,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:15,591 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 947 transitions. [2018-10-26 20:31:15,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:15,591 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 947 transitions. [2018-10-26 20:31:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:31:15,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:15,594 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-10-26 20:31:15,595 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:15,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash 981316796, now seen corresponding path program 1 times [2018-10-26 20:31:15,596 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:15,596 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:15,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:15,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:15,910 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:15,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:15,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:15,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:15,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:15,917 INFO L87 Difference]: Start difference. First operand 636 states and 947 transitions. Second operand 3 states. [2018-10-26 20:31:16,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:16,240 INFO L93 Difference]: Finished difference Result 1256 states and 1884 transitions. [2018-10-26 20:31:16,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:16,242 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-10-26 20:31:16,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:16,244 INFO L225 Difference]: With dead ends: 1256 [2018-10-26 20:31:16,245 INFO L226 Difference]: Without dead ends: 759 [2018-10-26 20:31:16,247 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-10-26 20:31:16,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-26 20:31:16,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-10-26 20:31:16,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-26 20:31:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1129 transitions. [2018-10-26 20:31:16,269 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1129 transitions. Word has length 125 [2018-10-26 20:31:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:16,271 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1129 transitions. [2018-10-26 20:31:16,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:16,271 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1129 transitions. [2018-10-26 20:31:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 20:31:16,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:16,274 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-10-26 20:31:16,274 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:16,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-10-26 20:31:16,276 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:16,277 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:16,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:16,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 20:31:16,557 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:16,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:16,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:16,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:16,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:16,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:16,560 INFO L87 Difference]: Start difference. First operand 759 states and 1129 transitions. Second operand 3 states. [2018-10-26 20:31:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:16,879 INFO L93 Difference]: Finished difference Result 1503 states and 2250 transitions. [2018-10-26 20:31:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:16,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-26 20:31:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:16,883 INFO L225 Difference]: With dead ends: 1503 [2018-10-26 20:31:16,883 INFO L226 Difference]: Without dead ends: 883 [2018-10-26 20:31:16,885 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-10-26 20:31:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2018-10-26 20:31:16,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2018-10-26 20:31:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-26 20:31:16,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1313 transitions. [2018-10-26 20:31:16,904 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1313 transitions. Word has length 138 [2018-10-26 20:31:16,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:16,904 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1313 transitions. [2018-10-26 20:31:16,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:16,905 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1313 transitions. [2018-10-26 20:31:16,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:31:16,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:16,907 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-10-26 20:31:16,907 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:16,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:16,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2076637946, now seen corresponding path program 1 times [2018-10-26 20:31:16,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:16,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:16,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:17,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 20:31:17,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:31:17,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:31:17,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:31:17,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:31:17,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:31:17,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:31:17,289 INFO L87 Difference]: Start difference. First operand 883 states and 1313 transitions. Second operand 3 states. [2018-10-26 20:31:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:17,576 INFO L93 Difference]: Finished difference Result 1749 states and 2613 transitions. [2018-10-26 20:31:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:31:17,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-10-26 20:31:17,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:17,580 INFO L225 Difference]: With dead ends: 1749 [2018-10-26 20:31:17,581 INFO L226 Difference]: Without dead ends: 1005 [2018-10-26 20:31:17,582 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-10-26 20:31:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2018-10-26 20:31:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 1003. [2018-10-26 20:31:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1003 states. [2018-10-26 20:31:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1492 transitions. [2018-10-26 20:31:17,611 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1492 transitions. Word has length 169 [2018-10-26 20:31:17,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:17,611 INFO L481 AbstractCegarLoop]: Abstraction has 1003 states and 1492 transitions. [2018-10-26 20:31:17,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:31:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1492 transitions. [2018-10-26 20:31:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:31:17,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:17,615 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-10-26 20:31:17,616 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:17,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 850355908, now seen corresponding path program 1 times [2018-10-26 20:31:17,618 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:17,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:17,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:21,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:21,302 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,307 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-10-26 20:31:21,337 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-10-26 20:31:21,400 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,405 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,408 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,408 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-10-26 20:31:21,409 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,572 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-10-26 20:31:21,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:21,577 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,631 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-10-26 20:31:21,641 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-10-26 20:31:21,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,670 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-10-26 20:31:21,677 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,704 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:21,706 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-10-26 20:31:21,707 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,719 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,729 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:21,773 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-10-26 20:31:21,773 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 20:31:21,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:22,012 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-10-26 20:31:22,013 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-10-26 20:31:22,033 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-10-26 20:31:22,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,263 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-10-26 20:31:22,269 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:22,269 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-10-26 20:31:22,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,299 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 20:31:22,375 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-10-26 20:31:22,380 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-10-26 20:31:22,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 20:31:22,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:31:22,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:22,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 20:31:22,647 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:22,662 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-10-26 20:31:22,672 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-10-26 20:31:22,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,766 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-10-26 20:31:22,773 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-10-26 20:31:22,773 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,815 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-10-26 20:31:22,823 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:22,824 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:22,825 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:22,826 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:22,831 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-10-26 20:31:22,832 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:22,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:22,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,855 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 20:31:22,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:31:22,885 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:22,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:31:22,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:31:22,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:31:22,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:31:22,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:22,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:31:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:23,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:31:23,193 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-10-26 20:31:23,208 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-10-26 20:31:23,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,228 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-10-26 20:31:23,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-10-26 20:31:23,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, 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-10-26 20:31:23,366 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-10-26 20:31:23,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,384 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-10-26 20:31:23,393 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-10-26 20:31:23,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:31:23,467 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-10-26 20:31:23,469 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-10-26 20:31:23,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:23,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 20:31:23,892 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:23,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:31:23,898 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:31:23,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:24,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:24,418 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-10-26 20:31:24,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,464 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-10-26 20:31:24,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:24,469 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,510 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-10-26 20:31:24,512 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-10-26 20:31:24,516 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:24,518 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-10-26 20:31:24,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:24,523 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:24,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:24,530 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-10-26 20:31:24,530 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,544 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,562 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,581 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-10-26 20:31:24,581 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-10-26 20:31:24,738 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-10-26 20:31:24,750 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-10-26 20:31:24,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,798 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-10-26 20:31:24,805 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:24,806 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-10-26 20:31:24,806 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-10-26 20:31:24,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:31:24,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:24,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:24,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 20:31:24,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:25,002 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-10-26 20:31:25,009 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-10-26 20:31:25,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,030 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-10-26 20:31:25,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:25,033 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-10-26 20:31:25,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:25,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:25,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,051 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-10-26 20:31:25,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:31:25,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:25,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:31:25,063 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:31:25,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:31:25,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:31:25,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:31:25,172 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:25,172 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:31:25,282 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-10-26 20:31:25,449 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-26 20:31:25,452 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-10-26 20:31:25,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,468 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-10-26 20:31:25,472 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-10-26 20:31:25,472 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:25,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:31:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:26,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:31:26,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-10-26 20:31:26,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 20:31:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 20:31:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:31:26,044 INFO L87 Difference]: Start difference. First operand 1003 states and 1492 transitions. Second operand 24 states. [2018-10-26 20:31:40,620 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 20:31:42,569 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-26 20:31:47,137 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 20:31:49,453 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-26 20:31:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:31:50,364 INFO L93 Difference]: Finished difference Result 3904 states and 5837 transitions. [2018-10-26 20:31:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:31:50,369 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-10-26 20:31:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:31:50,377 INFO L225 Difference]: With dead ends: 3904 [2018-10-26 20:31:50,377 INFO L226 Difference]: Without dead ends: 2915 [2018-10-26 20:31:50,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:31:50,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2018-10-26 20:31:50,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1323. [2018-10-26 20:31:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1323 states. [2018-10-26 20:31:50,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 2076 transitions. [2018-10-26 20:31:50,458 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 2076 transitions. Word has length 175 [2018-10-26 20:31:50,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:31:50,458 INFO L481 AbstractCegarLoop]: Abstraction has 1323 states and 2076 transitions. [2018-10-26 20:31:50,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 20:31:50,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 2076 transitions. [2018-10-26 20:31:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 20:31:50,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:31:50,462 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-10-26 20:31:50,462 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:31:50,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:31:50,462 INFO L82 PathProgramCache]: Analyzing trace with hash 584222017, now seen corresponding path program 1 times [2018-10-26 20:31:50,464 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:31:50,465 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:31:50,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:54,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:54,254 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,255 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-10-26 20:31:54,274 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-10-26 20:31:54,292 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,298 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-10-26 20:31:54,299 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,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, 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-10-26 20:31:54,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:54,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,488 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-10-26 20:31:54,505 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-10-26 20:31:54,513 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,515 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-10-26 20:31:54,522 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,524 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,525 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,527 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-10-26 20:31:54,528 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,541 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,551 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,559 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:54,589 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-10-26 20:31:54,589 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 20:31:54,739 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:54,812 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-10-26 20:31:54,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-26 20:31:54,832 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-10-26 20:31:54,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-26 20:31:55,144 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:55,145 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-10-26 20:31:55,145 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 20:31:55,209 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-10-26 20:31:55,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, 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-10-26 20:31:55,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 20:31:55,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:31:55,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:55,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 20:31:55,416 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:55,430 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-10-26 20:31:55,437 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-10-26 20:31:55,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,494 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-10-26 20:31:55,498 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-10-26 20:31:55,499 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,528 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-10-26 20:31:55,537 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:55,539 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:55,541 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:55,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:31:55,546 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-10-26 20:31:55,547 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:55,556 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:31:55,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,566 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 20:31:55,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 23 treesize of output 18 [2018-10-26 20:31:55,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:55,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:31:55,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:31:55,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:31:55,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:31:55,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,629 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:31:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:55,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:31:55,871 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-10-26 20:31:55,875 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-10-26 20:31:55,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:55,884 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-10-26 20:31:55,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-10-26 20:31:55,955 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-10-26 20:31:56,001 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-10-26 20:31:56,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,018 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-10-26 20:31:56,036 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-10-26 20:31:56,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:31:56,133 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-10-26 20:31:56,145 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-10-26 20:31:56,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,156 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 20:31:56,468 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:31:56,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:31:56,474 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:31:56,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:31:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:31:56,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:31:56,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:31:56,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:31:56,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:56,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:31:57,312 INFO L303 Elim1Store]: Index analysis took 140 ms [2018-10-26 20:31:57,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-10-26 20:31:57,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:31:57,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:57,463 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:57,496 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-10-26 20:31:57,496 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-26 20:31:57,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:31:57,540 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-10-26 20:31:57,540 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:27 [2018-10-26 20:31:57,629 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-10-26 20:31:59,677 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-10-26 20:31:59,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:59,682 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:59,688 INFO L303 Elim1Store]: Index analysis took 2058 ms [2018-10-26 20:31:59,734 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-10-26 20:31:59,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 20:31:59,830 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:59,833 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-10-26 20:31:59,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:59,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:31:59,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:31:59,935 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:31:59,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:31:59,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:31:59,947 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:31:59,989 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-10-26 20:31:59,989 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:36 [2018-10-26 20:32:00,428 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-10-26 20:32:00,432 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-10-26 20:32:00,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:00,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:00,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:00,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:32:00,473 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-26 20:32:00,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:00,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:32:00,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 22 [2018-10-26 20:32:00,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 20:32:00,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 20:32:00,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:32:00,495 INFO L87 Difference]: Start difference. First operand 1323 states and 2076 transitions. Second operand 22 states. [2018-10-26 20:32:17,072 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 20:32:18,358 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-26 20:32:23,703 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-26 20:32:23,935 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 20:32:24,852 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-26 20:32:25,728 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-10-26 20:32:28,493 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-10-26 20:32:30,325 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-26 20:32:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:30,807 INFO L93 Difference]: Finished difference Result 4878 states and 7422 transitions. [2018-10-26 20:32:30,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:32:30,813 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 176 [2018-10-26 20:32:30,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:30,823 INFO L225 Difference]: With dead ends: 4878 [2018-10-26 20:32:30,823 INFO L226 Difference]: Without dead ends: 3569 [2018-10-26 20:32:30,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-10-26 20:32:30,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3569 states. [2018-10-26 20:32:30,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3569 to 1915. [2018-10-26 20:32:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-10-26 20:32:30,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 3140 transitions. [2018-10-26 20:32:30,943 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 3140 transitions. Word has length 176 [2018-10-26 20:32:30,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:30,943 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 3140 transitions. [2018-10-26 20:32:30,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 20:32:30,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 3140 transitions. [2018-10-26 20:32:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:32:30,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:30,949 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] [2018-10-26 20:32:30,949 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:30,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash -10605328, now seen corresponding path program 1 times [2018-10-26 20:32:30,950 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:30,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:32:30,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:32:33,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:32:33,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:32:33,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:32:33,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:32:33,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:32:33,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-10-26 20:32:33,472 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-10-26 20:32:33,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:32:33,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-10-26 20:32:33,496 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-10-26 20:32:33,499 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-10-26 20:32:33,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:33,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-10-26 20:32:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:32:33,560 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:32:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:32:33,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:32:33,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:32:33,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:32:33,567 INFO L87 Difference]: Start difference. First operand 1915 states and 3140 transitions. Second operand 4 states. [2018-10-26 20:32:36,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:36,117 INFO L93 Difference]: Finished difference Result 3911 states and 6415 transitions. [2018-10-26 20:32:36,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:32:36,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-26 20:32:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:36,127 INFO L225 Difference]: With dead ends: 3911 [2018-10-26 20:32:36,127 INFO L226 Difference]: Without dead ends: 2010 [2018-10-26 20:32:36,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:32:36,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2010 states. [2018-10-26 20:32:36,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2010 to 1931. [2018-10-26 20:32:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2018-10-26 20:32:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 3156 transitions. [2018-10-26 20:32:36,234 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 3156 transitions. Word has length 182 [2018-10-26 20:32:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:36,235 INFO L481 AbstractCegarLoop]: Abstraction has 1931 states and 3156 transitions. [2018-10-26 20:32:36,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:32:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3156 transitions. [2018-10-26 20:32:36,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:32:36,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:36,241 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] [2018-10-26 20:32:36,241 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:36,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:36,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1335461522, now seen corresponding path program 1 times [2018-10-26 20:32:36,243 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:36,243 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:32:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:32:38,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:32:38,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:32:38,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:32:38,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:32:38,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:32:38,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:32:38,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:32:38,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:32:38,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:32:38,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:32:38,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:38,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:39,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:39,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:32:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-26 20:32:39,020 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:39,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:32:39,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:32:39,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:32:39,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:32:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:32:39,026 INFO L87 Difference]: Start difference. First operand 1931 states and 3156 transitions. Second operand 7 states. [2018-10-26 20:32:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:42,483 INFO L93 Difference]: Finished difference Result 4675 states and 7520 transitions. [2018-10-26 20:32:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:32:42,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-10-26 20:32:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:42,492 INFO L225 Difference]: With dead ends: 4675 [2018-10-26 20:32:42,492 INFO L226 Difference]: Without dead ends: 2758 [2018-10-26 20:32:42,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:32:42,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2018-10-26 20:32:42,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2145. [2018-10-26 20:32:42,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2018-10-26 20:32:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3514 transitions. [2018-10-26 20:32:42,616 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3514 transitions. Word has length 182 [2018-10-26 20:32:42,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:42,616 INFO L481 AbstractCegarLoop]: Abstraction has 2145 states and 3514 transitions. [2018-10-26 20:32:42,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:32:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3514 transitions. [2018-10-26 20:32:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:32:42,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:42,622 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] [2018-10-26 20:32:42,622 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:42,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash -971995024, now seen corresponding path program 1 times [2018-10-26 20:32:42,626 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:42,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:32:42,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:32:45,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:32:45,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:32:45,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:32:45,168 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:32:45,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:32:45,171 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:45,177 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:45,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:45,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:45,191 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:32:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-10-26 20:32:45,267 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:45,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:32:45,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:32:45,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:32:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:32:45,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:32:45,274 INFO L87 Difference]: Start difference. First operand 2145 states and 3514 transitions. Second operand 7 states. [2018-10-26 20:32:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:48,501 INFO L93 Difference]: Finished difference Result 4792 states and 7801 transitions. [2018-10-26 20:32:48,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:32:48,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 182 [2018-10-26 20:32:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:48,509 INFO L225 Difference]: With dead ends: 4792 [2018-10-26 20:32:48,509 INFO L226 Difference]: Without dead ends: 2661 [2018-10-26 20:32:48,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 176 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-10-26 20:32:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2018-10-26 20:32:48,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2377. [2018-10-26 20:32:48,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-10-26 20:32:48,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3922 transitions. [2018-10-26 20:32:48,639 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3922 transitions. Word has length 182 [2018-10-26 20:32:48,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:48,639 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3922 transitions. [2018-10-26 20:32:48,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:32:48,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3922 transitions. [2018-10-26 20:32:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:32:48,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:48,646 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] [2018-10-26 20:32:48,647 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:48,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:48,647 INFO L82 PathProgramCache]: Analyzing trace with hash 229883865, now seen corresponding path program 1 times [2018-10-26 20:32:48,650 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:48,655 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:32:48,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:32:49,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:32:49,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:32:49,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:32:49,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:49,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:49,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:49,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:32:49,998 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-10-26 20:32:50,000 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-10-26 20:32:50,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:50,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:50,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:50,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:32:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-10-26 20:32:50,019 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:50,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:32:50,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:32:50,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:32:50,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:32:50,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:32:50,025 INFO L87 Difference]: Start difference. First operand 2377 states and 3922 transitions. Second operand 4 states. [2018-10-26 20:32:52,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:52,633 INFO L93 Difference]: Finished difference Result 4980 states and 8179 transitions. [2018-10-26 20:32:52,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:32:52,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-26 20:32:52,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:52,639 INFO L225 Difference]: With dead ends: 4980 [2018-10-26 20:32:52,639 INFO L226 Difference]: Without dead ends: 2617 [2018-10-26 20:32:52,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:32:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2617 states. [2018-10-26 20:32:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2617 to 2513. [2018-10-26 20:32:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2018-10-26 20:32:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 4138 transitions. [2018-10-26 20:32:52,745 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 4138 transitions. Word has length 197 [2018-10-26 20:32:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:52,746 INFO L481 AbstractCegarLoop]: Abstraction has 2513 states and 4138 transitions. [2018-10-26 20:32:52,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:32:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 4138 transitions. [2018-10-26 20:32:52,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-26 20:32:52,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:52,753 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] [2018-10-26 20:32:52,753 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:52,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash 774740237, now seen corresponding path program 1 times [2018-10-26 20:32:52,754 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:52,754 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:32:52,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:32:53,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:32:53,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:32:53,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:32:53,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:53,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:53,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:53,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:32:54,008 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-10-26 20:32:54,045 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-10-26 20:32:54,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:32:54,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:54,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:32:54,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:32:54,069 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:32:54,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:32:54,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:32:54,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:32:54,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:32:54,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:32:54,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:32:54,076 INFO L87 Difference]: Start difference. First operand 2513 states and 4138 transitions. Second operand 4 states. [2018-10-26 20:32:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:32:56,954 INFO L93 Difference]: Finished difference Result 5825 states and 9470 transitions. [2018-10-26 20:32:56,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:32:56,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-10-26 20:32:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:32:56,963 INFO L225 Difference]: With dead ends: 5825 [2018-10-26 20:32:56,963 INFO L226 Difference]: Without dead ends: 3326 [2018-10-26 20:32:56,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:32:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2018-10-26 20:32:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 2849. [2018-10-26 20:32:57,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2849 states. [2018-10-26 20:32:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2849 states to 2849 states and 4738 transitions. [2018-10-26 20:32:57,095 INFO L78 Accepts]: Start accepts. Automaton has 2849 states and 4738 transitions. Word has length 197 [2018-10-26 20:32:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:32:57,095 INFO L481 AbstractCegarLoop]: Abstraction has 2849 states and 4738 transitions. [2018-10-26 20:32:57,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:32:57,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2849 states and 4738 transitions. [2018-10-26 20:32:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:32:57,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:32:57,102 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] [2018-10-26 20:32:57,102 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:32:57,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:32:57,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1456482063, now seen corresponding path program 1 times [2018-10-26 20:32:57,104 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:32:57,104 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:32:57,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:32:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:00,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:00,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:33:00,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:33:00,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:33:00,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:33:00,208 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:00,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:00,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,224 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:33:00,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:33:00,231 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:00,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:00,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:33:00,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:33:00,272 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:00,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:00,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:33:00,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 20 treesize of output 16 [2018-10-26 20:33:00,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:33:00,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:00,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-10-26 20:33:00,329 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-10-26 20:33:00,330 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:00,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:33:00,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:33:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:33:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:33:00,348 INFO L87 Difference]: Start difference. First operand 2849 states and 4738 transitions. Second operand 8 states. [2018-10-26 20:33:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:05,438 INFO L93 Difference]: Finished difference Result 5756 states and 9555 transitions. [2018-10-26 20:33:05,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:33:05,439 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 198 [2018-10-26 20:33:05,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:05,444 INFO L225 Difference]: With dead ends: 5756 [2018-10-26 20:33:05,444 INFO L226 Difference]: Without dead ends: 2921 [2018-10-26 20:33:05,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:33:05,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2018-10-26 20:33:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2921. [2018-10-26 20:33:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2018-10-26 20:33:05,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4826 transitions. [2018-10-26 20:33:05,611 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4826 transitions. Word has length 198 [2018-10-26 20:33:05,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:05,612 INFO L481 AbstractCegarLoop]: Abstraction has 2921 states and 4826 transitions. [2018-10-26 20:33:05,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:33:05,612 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4826 transitions. [2018-10-26 20:33:05,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:33:05,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:05,617 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] [2018-10-26 20:33:05,617 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:05,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:05,617 INFO L82 PathProgramCache]: Analyzing trace with hash 292660869, now seen corresponding path program 1 times [2018-10-26 20:33:05,618 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:05,618 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:33:05,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:08,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:08,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:08,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:08,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:08,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:08,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,682 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:08,695 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-10-26 20:33:08,696 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-10-26 20:33:08,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:08,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:33:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:08,724 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:08,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:08,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:33:08,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:33:08,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:33:08,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:33:08,732 INFO L87 Difference]: Start difference. First operand 2921 states and 4826 transitions. Second operand 7 states. [2018-10-26 20:33:11,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:11,937 INFO L93 Difference]: Finished difference Result 6184 states and 10097 transitions. [2018-10-26 20:33:11,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:33:11,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 198 [2018-10-26 20:33:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:11,944 INFO L225 Difference]: With dead ends: 6184 [2018-10-26 20:33:11,944 INFO L226 Difference]: Without dead ends: 3277 [2018-10-26 20:33:11,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 192 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-10-26 20:33:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-10-26 20:33:12,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2921. [2018-10-26 20:33:12,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2921 states. [2018-10-26 20:33:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 4818 transitions. [2018-10-26 20:33:12,052 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 4818 transitions. Word has length 198 [2018-10-26 20:33:12,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:12,053 INFO L481 AbstractCegarLoop]: Abstraction has 2921 states and 4818 transitions. [2018-10-26 20:33:12,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:33:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 4818 transitions. [2018-10-26 20:33:12,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-26 20:33:12,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:12,056 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] [2018-10-26 20:33:12,057 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:12,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:12,057 INFO L82 PathProgramCache]: Analyzing trace with hash 398378106, now seen corresponding path program 1 times [2018-10-26 20:33:12,058 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:12,058 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:33:12,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:13,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:13,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:33:13,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:33:13,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:33:13,308 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-10-26 20:33:13,310 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-10-26 20:33:13,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,312 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:13,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:33:13,364 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-10-26 20:33:13,365 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:13,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:33:13,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:33:13,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:33:13,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:33:13,370 INFO L87 Difference]: Start difference. First operand 2921 states and 4818 transitions. Second operand 4 states. [2018-10-26 20:33:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:16,262 INFO L93 Difference]: Finished difference Result 6335 states and 10265 transitions. [2018-10-26 20:33:16,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:33:16,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2018-10-26 20:33:16,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:16,269 INFO L225 Difference]: With dead ends: 6335 [2018-10-26 20:33:16,269 INFO L226 Difference]: Without dead ends: 3428 [2018-10-26 20:33:16,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:33:16,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2018-10-26 20:33:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2929. [2018-10-26 20:33:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-10-26 20:33:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4826 transitions. [2018-10-26 20:33:16,420 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4826 transitions. Word has length 198 [2018-10-26 20:33:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:16,420 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 4826 transitions. [2018-10-26 20:33:16,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:33:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4826 transitions. [2018-10-26 20:33:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 20:33:16,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:16,426 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] [2018-10-26 20:33:16,426 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:16,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:16,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1044005489, now seen corresponding path program 1 times [2018-10-26 20:33:16,427 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:16,427 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:33:16,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:19,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:19,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:19,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:19,497 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:19,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:19,501 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,523 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:19,537 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-10-26 20:33:19,539 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-10-26 20:33:19,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:19,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:33:19,570 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:19,570 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:19,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:19,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:33:19,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:33:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:33:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:33:19,577 INFO L87 Difference]: Start difference. First operand 2929 states and 4826 transitions. Second operand 7 states. [2018-10-26 20:33:22,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:22,782 INFO L93 Difference]: Finished difference Result 6200 states and 10097 transitions. [2018-10-26 20:33:22,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:33:22,784 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 199 [2018-10-26 20:33:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:22,792 INFO L225 Difference]: With dead ends: 6200 [2018-10-26 20:33:22,792 INFO L226 Difference]: Without dead ends: 3285 [2018-10-26 20:33:22,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 193 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-10-26 20:33:22,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2018-10-26 20:33:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2929. [2018-10-26 20:33:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2929 states. [2018-10-26 20:33:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4818 transitions. [2018-10-26 20:33:22,975 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4818 transitions. Word has length 199 [2018-10-26 20:33:22,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:22,976 INFO L481 AbstractCegarLoop]: Abstraction has 2929 states and 4818 transitions. [2018-10-26 20:33:22,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:33:22,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4818 transitions. [2018-10-26 20:33:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:33:22,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:22,982 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] [2018-10-26 20:33:22,982 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:22,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1740393527, now seen corresponding path program 1 times [2018-10-26 20:33:22,983 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:22,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:25,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:25,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:25,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:25,789 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:25,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:25,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,799 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:25,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:33:25,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:33:25,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:33:25,865 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 230 proven. 4 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:25,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:33:25,888 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:33:25,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:25,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:33:25,904 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:25,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:33:25,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:33:25,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:33:25,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:33:25,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:33:25,912 INFO L87 Difference]: Start difference. First operand 2929 states and 4818 transitions. Second operand 9 states. [2018-10-26 20:33:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:29,993 INFO L93 Difference]: Finished difference Result 6880 states and 11005 transitions. [2018-10-26 20:33:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:33:29,994 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2018-10-26 20:33:29,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:29,999 INFO L225 Difference]: With dead ends: 6880 [2018-10-26 20:33:29,999 INFO L226 Difference]: Without dead ends: 4329 [2018-10-26 20:33:30,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:33:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4329 states. [2018-10-26 20:33:30,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4329 to 3089. [2018-10-26 20:33:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-10-26 20:33:30,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5042 transitions. [2018-10-26 20:33:30,133 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5042 transitions. Word has length 200 [2018-10-26 20:33:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:30,134 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5042 transitions. [2018-10-26 20:33:30,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:33:30,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5042 transitions. [2018-10-26 20:33:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:33:30,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:30,137 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] [2018-10-26 20:33:30,137 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:30,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1109608330, now seen corresponding path program 1 times [2018-10-26 20:33:30,138 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:30,138 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:30,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:33,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:33,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:33,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:33,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:33,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:33,316 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,322 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,336 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:33,349 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-10-26 20:33:33,351 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-10-26 20:33:33,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:33,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:33:33,380 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:33,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:33,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:33,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:33:33,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:33:33,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:33:33,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:33:33,387 INFO L87 Difference]: Start difference. First operand 3089 states and 5042 transitions. Second operand 7 states. [2018-10-26 20:33:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:36,619 INFO L93 Difference]: Finished difference Result 6520 states and 10529 transitions. [2018-10-26 20:33:36,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:33:36,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-10-26 20:33:36,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:36,625 INFO L225 Difference]: With dead ends: 6520 [2018-10-26 20:33:36,625 INFO L226 Difference]: Without dead ends: 3445 [2018-10-26 20:33:36,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:33:36,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3445 states. [2018-10-26 20:33:36,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3445 to 3089. [2018-10-26 20:33:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-10-26 20:33:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5034 transitions. [2018-10-26 20:33:36,797 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5034 transitions. Word has length 200 [2018-10-26 20:33:36,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:36,797 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5034 transitions. [2018-10-26 20:33:36,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:33:36,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5034 transitions. [2018-10-26 20:33:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:33:36,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:36,801 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] [2018-10-26 20:33:36,801 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:36,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1392052502, now seen corresponding path program 1 times [2018-10-26 20:33:36,802 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:36,802 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:36,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:39,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:39,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:40,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:40,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:40,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:40,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:40,007 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,027 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:40,039 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-10-26 20:33:40,042 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-10-26 20:33:40,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:40,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:33:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:40,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:33:40,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:33:40,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:33:40,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:33:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:33:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:33:40,077 INFO L87 Difference]: Start difference. First operand 3089 states and 5034 transitions. Second operand 7 states. [2018-10-26 20:33:43,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:43,280 INFO L93 Difference]: Finished difference Result 6440 states and 10409 transitions. [2018-10-26 20:33:43,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:33:43,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-10-26 20:33:43,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:43,285 INFO L225 Difference]: With dead ends: 6440 [2018-10-26 20:33:43,285 INFO L226 Difference]: Without dead ends: 3365 [2018-10-26 20:33:43,288 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-10-26 20:33:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3365 states. [2018-10-26 20:33:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3365 to 3089. [2018-10-26 20:33:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3089 states. [2018-10-26 20:33:43,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3089 states to 3089 states and 5026 transitions. [2018-10-26 20:33:43,416 INFO L78 Accepts]: Start accepts. Automaton has 3089 states and 5026 transitions. Word has length 201 [2018-10-26 20:33:43,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:43,416 INFO L481 AbstractCegarLoop]: Abstraction has 3089 states and 5026 transitions. [2018-10-26 20:33:43,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:33:43,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3089 states and 5026 transitions. [2018-10-26 20:33:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:33:43,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:43,420 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] [2018-10-26 20:33:43,420 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:43,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:43,420 INFO L82 PathProgramCache]: Analyzing trace with hash -132625424, now seen corresponding path program 1 times [2018-10-26 20:33:43,421 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:43,421 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:43,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:46,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:46,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:46,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:46,175 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:46,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:46,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,184 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:46,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 17 treesize of output 13 [2018-10-26 20:33:46,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 13 treesize of output 5 [2018-10-26 20:33:46,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:33:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:46,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:33:46,303 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:33:46,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:46,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:33:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 239 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:46,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:33:46,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:33:46,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:33:46,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:33:46,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:33:46,326 INFO L87 Difference]: Start difference. First operand 3089 states and 5026 transitions. Second operand 9 states. [2018-10-26 20:33:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:50,089 INFO L93 Difference]: Finished difference Result 6952 states and 11040 transitions. [2018-10-26 20:33:50,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:33:50,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2018-10-26 20:33:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:50,094 INFO L225 Difference]: With dead ends: 6952 [2018-10-26 20:33:50,094 INFO L226 Difference]: Without dead ends: 4261 [2018-10-26 20:33:50,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:33:50,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2018-10-26 20:33:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 3109. [2018-10-26 20:33:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3109 states. [2018-10-26 20:33:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3109 states to 3109 states and 5015 transitions. [2018-10-26 20:33:50,216 INFO L78 Accepts]: Start accepts. Automaton has 3109 states and 5015 transitions. Word has length 201 [2018-10-26 20:33:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:50,217 INFO L481 AbstractCegarLoop]: Abstraction has 3109 states and 5015 transitions. [2018-10-26 20:33:50,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:33:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3109 states and 5015 transitions. [2018-10-26 20:33:50,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 20:33:50,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:50,220 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] [2018-10-26 20:33:50,220 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:50,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash -392710652, now seen corresponding path program 1 times [2018-10-26 20:33:50,221 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:50,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:33:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:33:52,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:33:52,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:33:52,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:33:52,996 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:33:52,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:33:52,999 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,119 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:33:53,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:33:53,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:33:53,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:33:53,530 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 241 proven. 3 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:53,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:33:53,556 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:33:53,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:33:53,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:33:53,575 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:33:53,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:33:53,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:33:53,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:33:53,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:33:53,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:33:53,582 INFO L87 Difference]: Start difference. First operand 3109 states and 5015 transitions. Second operand 9 states. [2018-10-26 20:33:57,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:33:57,237 INFO L93 Difference]: Finished difference Result 7104 states and 11212 transitions. [2018-10-26 20:33:57,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:33:57,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-10-26 20:33:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:33:57,242 INFO L225 Difference]: With dead ends: 7104 [2018-10-26 20:33:57,242 INFO L226 Difference]: Without dead ends: 4406 [2018-10-26 20:33:57,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:33:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2018-10-26 20:33:57,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3285. [2018-10-26 20:33:57,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2018-10-26 20:33:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 5255 transitions. [2018-10-26 20:33:57,397 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 5255 transitions. Word has length 202 [2018-10-26 20:33:57,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:33:57,398 INFO L481 AbstractCegarLoop]: Abstraction has 3285 states and 5255 transitions. [2018-10-26 20:33:57,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:33:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 5255 transitions. [2018-10-26 20:33:57,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:33:57,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:33:57,401 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-10-26 20:33:57,401 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:33:57,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:33:57,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1084632837, now seen corresponding path program 1 times [2018-10-26 20:33:57,402 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:33:57,402 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/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-10-26 20:33:57,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:34:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:34:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:34:08,420 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:34:08,442 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,443 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,444 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,445 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:34:08 BoogieIcfgContainer [2018-10-26 20:34:08,539 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:34:08,539 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:34:08,539 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:34:08,539 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:34:08,540 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:31:12" (3/4) ... [2018-10-26 20:34:08,545 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:34:08,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,558 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,559 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:34:08,677 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4d1fc8b7-50e8-4eb9-9979-69af4ac06d38/bin-2019/utaipan/witness.graphml [2018-10-26 20:34:08,677 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:34:08,679 INFO L168 Benchmark]: Toolchain (without parser) took 181608.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 345.0 MB). Free memory was 941.2 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 188.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,680 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:34:08,680 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1154.95 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 774.7 MB in the end (delta: 166.4 MB). Peak memory consumption was 166.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 195.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 774.7 MB in the beginning and 1.1 GB in the end (delta: -373.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,680 INFO L168 Benchmark]: Boogie Preprocessor took 117.45 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: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,680 INFO L168 Benchmark]: RCFGBuilder took 4145.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,681 INFO L168 Benchmark]: TraceAbstraction took 175850.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 974.1 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,684 INFO L168 Benchmark]: Witness Printer took 139.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:34:08,686 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1154.95 ms. Allocated memory is still 1.0 GB. Free memory was 941.2 MB in the beginning and 774.7 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 195.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 774.7 MB in the beginning and 1.1 GB in the end (delta: -373.1 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.45 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: 5.8 MB). Peak memory consumption was 5.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4145.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.1 MB in the end (delta: 167.9 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 175850.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 184.0 MB). Free memory was 974.1 MB in the beginning and 1.1 GB in the end (delta: -144.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 11.5 GB. * Witness Printer took 139.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 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={2122317174: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={2122317174: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={2122317174: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={2122317174: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={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174: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={2122317174: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={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174: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={2122317174:0}] [L1591] COND FALSE !(ret <= 0) [L1596] CALL s->state = 8672 [L1596] RET s->state = 8672 [L1597] CALL s->init_num = 0 [L1597] RET s->init_num = 0 [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2122317174: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={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174: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 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={2122317174: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={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174: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={2122317174: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={2122317174:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2122317174: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={2122317174:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2122317174:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 175.7s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 104.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5768 SDtfs, 10352 SDslu, 11667 SDs, 0 SdLazy, 10834 SolverSat, 1193 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 94.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5336 GetRequests, 5163 SyntacticMatches, 4 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 6.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3285occurred 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: 2.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 10161 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.8s SsaConstructionTime, 38.4s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 4369 NumberOfCodeBlocks, 4369 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5262 ConstructedInterpolants, 253 QuantifiedInterpolants, 6660349 SizeOfPredicates, 447 NumberOfNonLiveVariables, 25279 ConjunctsInSsa, 480 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...