./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3873739663157ae1e04c3d1b08afe34dba22bef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3873739663157ae1e04c3d1b08afe34dba22bef ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:50:40,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:50:40,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:50:40,395 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:50:40,396 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:50:40,397 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:50:40,398 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:50:40,399 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:50:40,401 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:50:40,402 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:50:40,402 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:50:40,403 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:50:40,404 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:50:40,405 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:50:40,406 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:50:40,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:50:40,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:50:40,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:50:40,411 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:50:40,412 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:50:40,413 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:50:40,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:50:40,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:50:40,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:50:40,417 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:50:40,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:50:40,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:50:40,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:50:40,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:50:40,421 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:50:40,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:50:40,422 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:50:40,422 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:50:40,422 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:50:40,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:50:40,425 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:50:40,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:50:40,437 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:50:40,437 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:50:40,438 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:50:40,438 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:50:40,438 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:50:40,439 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:50:40,439 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:50:40,439 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:50:40,439 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:50:40,439 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:50:40,439 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:50:40,440 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:50:40,440 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:50:40,440 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:50:40,440 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:50:40,441 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:50:40,442 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:50:40,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:50:40,442 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:50:40,442 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:50:40,442 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:50:40,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:50:40,442 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:50:40,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:50:40,443 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:50:40,443 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:50:40,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:50:40,446 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:50:40,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:50:40,447 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_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-10-26 20:50:40,477 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:50:40,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:50:40,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:50:40,493 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:50:40,493 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:50:40,494 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:50:40,546 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/e8593f943/f9b86d6c29984938b037f5dfea96cadf/FLAG7177e5b78 [2018-10-26 20:50:41,099 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:50:41,100 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:50:41,118 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/e8593f943/f9b86d6c29984938b037f5dfea96cadf/FLAG7177e5b78 [2018-10-26 20:50:41,133 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/e8593f943/f9b86d6c29984938b037f5dfea96cadf [2018-10-26 20:50:41,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:50:41,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:50:41,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:50:41,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:50:41,145 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:50:41,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:50:41" (1/1) ... [2018-10-26 20:50:41,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56deea1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:41, skipping insertion in model container [2018-10-26 20:50:41,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:50:41" (1/1) ... [2018-10-26 20:50:41,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:50:41,241 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:50:41,945 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:50:41,963 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:50:42,313 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:50:42,330 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:50:42,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42 WrapperNode [2018-10-26 20:50:42,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:50:42,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:50:42,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:50:42,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:50:42,465 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:50:42" (1/1) ... [2018-10-26 20:50:42,489 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:50:42" (1/1) ... [2018-10-26 20:50:42,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:50:42,590 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:50:42,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:50:42,590 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:50:42,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... [2018-10-26 20:50:42,738 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:50:42,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:50:42,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:50:42,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:50:42,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:50:42,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:50:42,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:50:42,811 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 20:50:42,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 20:50:42,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:50:42,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:50:42,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:50:42,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:50:43,611 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 20:50:43,611 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 20:50:45,597 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:50:45,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:50:45 BoogieIcfgContainer [2018-10-26 20:50:45,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:50:45,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:50:45,600 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:50:45,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:50:45,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:50:41" (1/3) ... [2018-10-26 20:50:45,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e269983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:50:45, skipping insertion in model container [2018-10-26 20:50:45,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:50:42" (2/3) ... [2018-10-26 20:50:45,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e269983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:50:45, skipping insertion in model container [2018-10-26 20:50:45,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:50:45" (3/3) ... [2018-10-26 20:50:45,610 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:50:45,620 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:50:45,633 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:50:45,653 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:50:45,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:50:45,692 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:50:45,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:50:45,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:50:45,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:50:45,693 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:50:45,693 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:50:45,693 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:50:45,718 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-10-26 20:50:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:50:45,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:45,734 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:50:45,737 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:45,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-10-26 20:50:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:45,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:45,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:45,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:46,238 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:50:46,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:46,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:46,242 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:46,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:46,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:46,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:46,265 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-10-26 20:50:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:46,720 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-10-26 20:50:46,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:46,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 20:50:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:46,737 INFO L225 Difference]: With dead ends: 438 [2018-10-26 20:50:46,738 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 20:50:46,742 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:50:46,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 20:50:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-26 20:50:46,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:50:46,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-10-26 20:50:46,822 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-10-26 20:50:46,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:46,822 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-10-26 20:50:46,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-10-26 20:50:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 20:50:46,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:46,826 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:50:46,826 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:46,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:46,827 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-10-26 20:50:46,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:46,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:46,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:46,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:46,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:47,063 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:50:47,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:47,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:50:47,064 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:47,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:50:47,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:50:47,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:50:47,066 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 4 states. [2018-10-26 20:50:47,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:47,799 INFO L93 Difference]: Finished difference Result 439 states and 663 transitions. [2018-10-26 20:50:47,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:50:47,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2018-10-26 20:50:47,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:47,802 INFO L225 Difference]: With dead ends: 439 [2018-10-26 20:50:47,803 INFO L226 Difference]: Without dead ends: 311 [2018-10-26 20:50:47,804 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:50:47,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-26 20:50:47,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 290. [2018-10-26 20:50:47,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-26 20:50:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 438 transitions. [2018-10-26 20:50:47,824 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 438 transitions. Word has length 60 [2018-10-26 20:50:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:47,824 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 438 transitions. [2018-10-26 20:50:47,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:50:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 438 transitions. [2018-10-26 20:50:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-26 20:50:47,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:47,828 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:50:47,828 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:47,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:47,829 INFO L82 PathProgramCache]: Analyzing trace with hash -182699472, now seen corresponding path program 1 times [2018-10-26 20:50:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:47,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:47,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:47,831 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:48,002 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:50:48,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:48,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:48,004 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:48,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:48,005 INFO L87 Difference]: Start difference. First operand 290 states and 438 transitions. Second operand 3 states. [2018-10-26 20:50:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:48,206 INFO L93 Difference]: Finished difference Result 587 states and 905 transitions. [2018-10-26 20:50:48,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:48,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-10-26 20:50:48,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:48,209 INFO L225 Difference]: With dead ends: 587 [2018-10-26 20:50:48,209 INFO L226 Difference]: Without dead ends: 436 [2018-10-26 20:50:48,210 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:50:48,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-26 20:50:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-10-26 20:50:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-26 20:50:48,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 659 transitions. [2018-10-26 20:50:48,233 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 659 transitions. Word has length 74 [2018-10-26 20:50:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:48,234 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 659 transitions. [2018-10-26 20:50:48,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 659 transitions. [2018-10-26 20:50:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:50:48,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:48,238 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:50:48,238 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:48,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-10-26 20:50:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:48,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:48,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:48,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:48,242 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:48,382 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:50:48,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:48,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:48,383 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:48,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:48,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:48,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:48,385 INFO L87 Difference]: Start difference. First operand 436 states and 659 transitions. Second operand 3 states. [2018-10-26 20:50:48,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:48,881 INFO L93 Difference]: Finished difference Result 882 states and 1351 transitions. [2018-10-26 20:50:48,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:48,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-26 20:50:48,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:48,884 INFO L225 Difference]: With dead ends: 882 [2018-10-26 20:50:48,884 INFO L226 Difference]: Without dead ends: 585 [2018-10-26 20:50:48,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-26 20:50:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2018-10-26 20:50:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-26 20:50:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 888 transitions. [2018-10-26 20:50:48,910 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 888 transitions. Word has length 83 [2018-10-26 20:50:48,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:48,911 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 888 transitions. [2018-10-26 20:50:48,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 888 transitions. [2018-10-26 20:50:48,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:50:48,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:48,916 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:50:48,917 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:48,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-10-26 20:50:48,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:48,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:48,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:48,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:49,098 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:50:49,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:49,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:49,100 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:49,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:49,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:49,101 INFO L87 Difference]: Start difference. First operand 585 states and 888 transitions. Second operand 3 states. [2018-10-26 20:50:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:49,294 INFO L93 Difference]: Finished difference Result 1182 states and 1810 transitions. [2018-10-26 20:50:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:49,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-26 20:50:49,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:49,298 INFO L225 Difference]: With dead ends: 1182 [2018-10-26 20:50:49,298 INFO L226 Difference]: Without dead ends: 736 [2018-10-26 20:50:49,300 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:50:49,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-10-26 20:50:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-10-26 20:50:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-10-26 20:50:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1121 transitions. [2018-10-26 20:50:49,325 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1121 transitions. Word has length 108 [2018-10-26 20:50:49,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:49,325 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1121 transitions. [2018-10-26 20:50:49,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:49,326 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1121 transitions. [2018-10-26 20:50:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-26 20:50:49,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:49,330 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:50:49,331 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:49,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1057268164, now seen corresponding path program 1 times [2018-10-26 20:50:49,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:49,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:49,333 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:49,491 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:50:49,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:49,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:49,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:49,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:49,493 INFO L87 Difference]: Start difference. First operand 734 states and 1121 transitions. Second operand 3 states. [2018-10-26 20:50:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:50,037 INFO L93 Difference]: Finished difference Result 1480 states and 2274 transitions. [2018-10-26 20:50:50,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:50,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2018-10-26 20:50:50,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:50,041 INFO L225 Difference]: With dead ends: 1480 [2018-10-26 20:50:50,042 INFO L226 Difference]: Without dead ends: 885 [2018-10-26 20:50:50,043 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:50:50,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2018-10-26 20:50:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 883. [2018-10-26 20:50:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2018-10-26 20:50:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1340 transitions. [2018-10-26 20:50:50,070 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1340 transitions. Word has length 114 [2018-10-26 20:50:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:50,071 INFO L481 AbstractCegarLoop]: Abstraction has 883 states and 1340 transitions. [2018-10-26 20:50:50,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1340 transitions. [2018-10-26 20:50:50,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 20:50:50,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:50,074 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:50:50,074 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:50,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:50,074 INFO L82 PathProgramCache]: Analyzing trace with hash -487725894, now seen corresponding path program 1 times [2018-10-26 20:50:50,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:50,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:50,078 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:50,308 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:50:50,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:50,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:50,308 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:50,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:50,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:50,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:50,311 INFO L87 Difference]: Start difference. First operand 883 states and 1340 transitions. Second operand 3 states. [2018-10-26 20:50:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:50,835 INFO L93 Difference]: Finished difference Result 1776 states and 2711 transitions. [2018-10-26 20:50:50,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:50,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2018-10-26 20:50:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:50,841 INFO L225 Difference]: With dead ends: 1776 [2018-10-26 20:50:50,842 INFO L226 Difference]: Without dead ends: 1032 [2018-10-26 20:50:50,844 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:50:50,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2018-10-26 20:50:50,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2018-10-26 20:50:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-10-26 20:50:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1570 transitions. [2018-10-26 20:50:50,876 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1570 transitions. Word has length 131 [2018-10-26 20:50:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:50,877 INFO L481 AbstractCegarLoop]: Abstraction has 1032 states and 1570 transitions. [2018-10-26 20:50:50,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1570 transitions. [2018-10-26 20:50:50,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 20:50:50,879 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:50,880 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:50:50,880 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:50,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:50,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-10-26 20:50:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:50,882 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:51,087 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:50:51,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:50:51,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:50:51,088 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:50:51,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:50:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:50:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:50:51,090 INFO L87 Difference]: Start difference. First operand 1032 states and 1570 transitions. Second operand 3 states. [2018-10-26 20:50:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:50:51,591 INFO L93 Difference]: Finished difference Result 1185 states and 1800 transitions. [2018-10-26 20:50:51,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:50:51,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-26 20:50:51,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:50:51,597 INFO L225 Difference]: With dead ends: 1185 [2018-10-26 20:50:51,597 INFO L226 Difference]: Without dead ends: 1183 [2018-10-26 20:50:51,598 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:50:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-10-26 20:50:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1181. [2018-10-26 20:50:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2018-10-26 20:50:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1797 transitions. [2018-10-26 20:50:51,632 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1797 transitions. Word has length 138 [2018-10-26 20:50:51,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:50:51,632 INFO L481 AbstractCegarLoop]: Abstraction has 1181 states and 1797 transitions. [2018-10-26 20:50:51,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:50:51,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1797 transitions. [2018-10-26 20:50:51,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:50:51,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:50:51,637 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:50:51,637 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:50:51,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:50:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1721971004, now seen corresponding path program 1 times [2018-10-26 20:50:51,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:50:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:50:51,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:50:51,641 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:50:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:50:52,269 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:50:52,445 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:50:52,644 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:50:53,279 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:50:53,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:50:53,279 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:50:53,280 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-10-26 20:50:53,282 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [115], [120], [125], [130], [135], [140], [145], [150], [155], [160], [165], [170], [175], [180], [185], [188], [190], [195], [198], [200], [205], [208], [279], [282], [290], [292], [295], [303], [306], [310], [490], [493], [509], [514], [517], [525], [530], [532], [535], [553], [556], [560], [581], [615], [617], [629], [632], [633], [634], [636] [2018-10-26 20:50:53,354 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:50:53,354 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:50:54,231 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:51:44,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:51:44,089 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:51:44,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:44,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:51:44,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:51:44,138 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:51:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:44,154 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:51:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:44,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:51:44,745 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-10-26 20:51:44,784 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:51:44,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:44,965 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:51:44,988 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:51:44,988 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,179 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:51:45,190 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:51:45,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:51:45,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:51:45,219 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:51:45,220 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:51:45,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:51:45,258 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:51:45,259 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,270 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,281 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,352 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:51:45,353 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-10-26 20:51:45,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-26 20:51:45,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-10-26 20:51:45,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:45,799 INFO L303 Elim1Store]: Index analysis took 127 ms [2018-10-26 20:51:45,940 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:51:45,953 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:51:45,954 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,396 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:51:46,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-10-26 20:51:46,513 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:51:46,515 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:51:46,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-26 20:51:46,648 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:51:46,659 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:51:46,660 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:51:46,740 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:51:46,785 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:51:46,796 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:51:46,797 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,809 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:51:46,809 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-10-26 20:51:46,852 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:51:46,857 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:51:46,858 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:51:46,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,881 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:51:46,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-10-26 20:51:46,912 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:51:46,932 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:51:46,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:46,983 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:51:46,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 20:51:47,363 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:51:47,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:51:47,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-10-26 20:51:47,692 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:51:47,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:47,701 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:51:47,714 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:51:47,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:51:47,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:51:47,793 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:51:47,810 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:51:47,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:51:48,316 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:51:48,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:51:48,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-10-26 20:51:48,337 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:51:48,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-26 20:51:48,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-26 20:51:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:51:48,339 INFO L87 Difference]: Start difference. First operand 1181 states and 1797 transitions. Second operand 17 states. [2018-10-26 20:51:50,748 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-10-26 20:51:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:53,138 INFO L93 Difference]: Finished difference Result 3051 states and 4660 transitions. [2018-10-26 20:51:53,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:51:53,148 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2018-10-26 20:51:53,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:53,154 INFO L225 Difference]: With dead ends: 3051 [2018-10-26 20:51:53,154 INFO L226 Difference]: Without dead ends: 1884 [2018-10-26 20:51:53,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 343 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:51:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2018-10-26 20:51:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1445. [2018-10-26 20:51:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2018-10-26 20:51:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2269 transitions. [2018-10-26 20:51:53,223 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2269 transitions. Word has length 175 [2018-10-26 20:51:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:53,224 INFO L481 AbstractCegarLoop]: Abstraction has 1445 states and 2269 transitions. [2018-10-26 20:51:53,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-26 20:51:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2269 transitions. [2018-10-26 20:51:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:51:53,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:53,230 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:51:53,230 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:53,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1065153562, now seen corresponding path program 1 times [2018-10-26 20:51:53,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:53,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:53,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:53,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:53,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:53,589 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:51:53,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:53,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:51:53,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:53,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:51:53,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:51:53,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:51:53,592 INFO L87 Difference]: Start difference. First operand 1445 states and 2269 transitions. Second operand 4 states. [2018-10-26 20:51:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:54,924 INFO L93 Difference]: Finished difference Result 3393 states and 5318 transitions. [2018-10-26 20:51:54,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:51:54,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:51:54,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:54,931 INFO L225 Difference]: With dead ends: 3393 [2018-10-26 20:51:54,932 INFO L226 Difference]: Without dead ends: 1962 [2018-10-26 20:51:54,935 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:51:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2018-10-26 20:51:55,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1677. [2018-10-26 20:51:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1677 states. [2018-10-26 20:51:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2677 transitions. [2018-10-26 20:51:55,008 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2677 transitions. Word has length 184 [2018-10-26 20:51:55,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:55,008 INFO L481 AbstractCegarLoop]: Abstraction has 1677 states and 2677 transitions. [2018-10-26 20:51:55,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:51:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2677 transitions. [2018-10-26 20:51:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 20:51:55,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:55,015 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:51:55,015 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1430987453, now seen corresponding path program 1 times [2018-10-26 20:51:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:55,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:55,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:55,019 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:55,301 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:51:55,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:55,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:51:55,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:55,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:51:55,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:51:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:51:55,302 INFO L87 Difference]: Start difference. First operand 1677 states and 2677 transitions. Second operand 4 states. [2018-10-26 20:51:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:56,352 INFO L93 Difference]: Finished difference Result 3580 states and 5689 transitions. [2018-10-26 20:51:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:51:56,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 20:51:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:56,360 INFO L225 Difference]: With dead ends: 3580 [2018-10-26 20:51:56,360 INFO L226 Difference]: Without dead ends: 1917 [2018-10-26 20:51:56,363 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:51:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2018-10-26 20:51:56,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1813. [2018-10-26 20:51:56,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1813 states. [2018-10-26 20:51:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2893 transitions. [2018-10-26 20:51:56,442 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2893 transitions. Word has length 190 [2018-10-26 20:51:56,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:56,442 INFO L481 AbstractCegarLoop]: Abstraction has 1813 states and 2893 transitions. [2018-10-26 20:51:56,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:51:56,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2893 transitions. [2018-10-26 20:51:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-26 20:51:56,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:56,447 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:51:56,449 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:56,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash 330595703, now seen corresponding path program 1 times [2018-10-26 20:51:56,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:56,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:56,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:56,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:56,763 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:51:56,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:56,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:51:56,764 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:56,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:51:56,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:51:56,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:51:56,766 INFO L87 Difference]: Start difference. First operand 1813 states and 2893 transitions. Second operand 4 states. [2018-10-26 20:51:58,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:58,236 INFO L93 Difference]: Finished difference Result 4851 states and 7709 transitions. [2018-10-26 20:51:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:51:58,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2018-10-26 20:51:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:58,247 INFO L225 Difference]: With dead ends: 4851 [2018-10-26 20:51:58,247 INFO L226 Difference]: Without dead ends: 3052 [2018-10-26 20:51:58,252 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:51:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2018-10-26 20:51:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 2133. [2018-10-26 20:51:58,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2018-10-26 20:51:58,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3477 transitions. [2018-10-26 20:51:58,353 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3477 transitions. Word has length 190 [2018-10-26 20:51:58,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:58,354 INFO L481 AbstractCegarLoop]: Abstraction has 2133 states and 3477 transitions. [2018-10-26 20:51:58,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:51:58,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3477 transitions. [2018-10-26 20:51:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 20:51:58,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:58,362 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:51:58,362 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:58,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1651524846, now seen corresponding path program 1 times [2018-10-26 20:51:58,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:58,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:58,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:58,366 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:58,586 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:51:58,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:58,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:51:58,586 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:58,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:51:58,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:51:58,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:51:58,587 INFO L87 Difference]: Start difference. First operand 2133 states and 3477 transitions. Second operand 4 states. [2018-10-26 20:51:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:51:59,039 INFO L93 Difference]: Finished difference Result 5219 states and 8397 transitions. [2018-10-26 20:51:59,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:51:59,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-10-26 20:51:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:51:59,047 INFO L225 Difference]: With dead ends: 5219 [2018-10-26 20:51:59,047 INFO L226 Difference]: Without dead ends: 3100 [2018-10-26 20:51:59,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:51:59,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3100 states. [2018-10-26 20:51:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3100 to 2461. [2018-10-26 20:51:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-26 20:51:59,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4077 transitions. [2018-10-26 20:51:59,162 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4077 transitions. Word has length 191 [2018-10-26 20:51:59,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:51:59,163 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 4077 transitions. [2018-10-26 20:51:59,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:51:59,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4077 transitions. [2018-10-26 20:51:59,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 20:51:59,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:51:59,170 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:51:59,171 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:51:59,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:51:59,171 INFO L82 PathProgramCache]: Analyzing trace with hash 558354499, now seen corresponding path program 1 times [2018-10-26 20:51:59,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:51:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:59,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:51:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:51:59,172 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:51:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:51:59,451 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:51:59,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:51:59,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:51:59,452 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:51:59,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:51:59,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:51:59,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:51:59,453 INFO L87 Difference]: Start difference. First operand 2461 states and 4077 transitions. Second operand 4 states. [2018-10-26 20:52:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:00,034 INFO L93 Difference]: Finished difference Result 5875 states and 9581 transitions. [2018-10-26 20:52:00,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:52:00,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-26 20:52:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:00,047 INFO L225 Difference]: With dead ends: 5875 [2018-10-26 20:52:00,047 INFO L226 Difference]: Without dead ends: 3428 [2018-10-26 20:52:00,052 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:52:00,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3428 states. [2018-10-26 20:52:00,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3428 to 2813. [2018-10-26 20:52:00,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2813 states. [2018-10-26 20:52:00,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4709 transitions. [2018-10-26 20:52:00,165 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4709 transitions. Word has length 199 [2018-10-26 20:52:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:00,165 INFO L481 AbstractCegarLoop]: Abstraction has 2813 states and 4709 transitions. [2018-10-26 20:52:00,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:52:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4709 transitions. [2018-10-26 20:52:00,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:52:00,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:00,173 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:52:00,173 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:00,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:00,173 INFO L82 PathProgramCache]: Analyzing trace with hash 296745168, now seen corresponding path program 1 times [2018-10-26 20:52:00,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:52:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:52:00,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:52:00,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:52:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:00,459 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:52:00,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:52:00,460 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:52:00,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:52:00,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:52:00,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:52:00,461 INFO L87 Difference]: Start difference. First operand 2813 states and 4709 transitions. Second operand 4 states. [2018-10-26 20:52:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:02,002 INFO L93 Difference]: Finished difference Result 6251 states and 10253 transitions. [2018-10-26 20:52:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:52:02,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-10-26 20:52:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:02,013 INFO L225 Difference]: With dead ends: 6251 [2018-10-26 20:52:02,013 INFO L226 Difference]: Without dead ends: 3436 [2018-10-26 20:52:02,018 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:52:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-10-26 20:52:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 2829. [2018-10-26 20:52:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2829 states. [2018-10-26 20:52:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2829 states to 2829 states and 4733 transitions. [2018-10-26 20:52:02,138 INFO L78 Accepts]: Start accepts. Automaton has 2829 states and 4733 transitions. Word has length 200 [2018-10-26 20:52:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:02,138 INFO L481 AbstractCegarLoop]: Abstraction has 2829 states and 4733 transitions. [2018-10-26 20:52:02,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:52:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2829 states and 4733 transitions. [2018-10-26 20:52:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:52:02,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:02,145 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:52:02,145 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:02,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1969145605, now seen corresponding path program 1 times [2018-10-26 20:52:02,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:52:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:52:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:02,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:52:02,149 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:52:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:52:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:52:02,604 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:52:02,642 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,646 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,647 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,648 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:52:02,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:52:02 BoogieIcfgContainer [2018-10-26 20:52:02,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:52:02,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:52:02,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:52:02,767 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:52:02,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:50:45" (3/4) ... [2018-10-26 20:52:02,771 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 20:52:02,773 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:52:02,773 INFO L168 Benchmark]: Toolchain (without parser) took 81636.75 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 957.0 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,777 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:52:02,778 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1192.71 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 795.9 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,778 INFO L168 Benchmark]: Boogie Procedure Inliner took 258.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 795.9 MB in the beginning and 1.1 GB in the end (delta: -343.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,779 INFO L168 Benchmark]: Boogie Preprocessor took 152.85 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.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,782 INFO L168 Benchmark]: RCFGBuilder took 2854.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 159.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,783 INFO L168 Benchmark]: TraceAbstraction took 77167.55 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 970.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-10-26 20:52:02,783 INFO L168 Benchmark]: Witness Printer took 5.90 ms. Allocated memory is still 5.1 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:52:02,786 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1192.71 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 795.9 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 258.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 795.9 MB in the beginning and 1.1 GB in the end (delta: -343.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.85 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.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2854.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.4 MB in the end (delta: 159.4 MB). Peak memory consumption was 159.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77167.55 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 970.4 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 5.90 ms. Allocated memory is still 5.1 GB. Free memory is still 2.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={24588:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={24588:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={24588:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={24588:0}] [L1583] COND FALSE !(ret <= 0) [L1588] CALL s->state = 8672 [L1588] RET s->state = 8672 [L1589] CALL s->init_num = 0 [L1589] RET s->init_num = 0 [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24588:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={24588:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={24588:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24588:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={24588:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24588:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 77.0s OverallTime, 16 OverallIterations, 7 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3235 SDtfs, 2681 SDslu, 4019 SDs, 0 SdLazy, 2913 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 427 GetRequests, 373 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2829occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 50.8s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 15 MinimizatonAttempts, 3635 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2459 NumberOfCodeBlocks, 2459 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2412 ConstructedInterpolants, 84 QuantifiedInterpolants, 2470273 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1902 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 2390/2906 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:52:05,118 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:52:05,120 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:52:05,131 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:52:05,131 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:52:05,132 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:52:05,133 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:52:05,135 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:52:05,137 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:52:05,138 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:52:05,139 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:52:05,139 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:52:05,140 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:52:05,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:52:05,142 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:52:05,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:52:05,153 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:52:05,154 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:52:05,156 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:52:05,157 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:52:05,158 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:52:05,159 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:52:05,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:52:05,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:52:05,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:52:05,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:52:05,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:52:05,164 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:52:05,165 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:52:05,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:52:05,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:52:05,167 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:52:05,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:52:05,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:52:05,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:52:05,169 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:52:05,169 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 20:52:05,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:52:05,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:52:05,184 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:52:05,184 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:52:05,184 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:52:05,185 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:52:05,185 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:52:05,185 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:52:05,185 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:52:05,186 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:52:05,187 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 20:52:05,187 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 20:52:05,187 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:52:05,189 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:52:05,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:52:05,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:52:05,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:52:05,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:52:05,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:52:05,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:52:05,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 20:52:05,191 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 20:52:05,192 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_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3873739663157ae1e04c3d1b08afe34dba22bef [2018-10-26 20:52:05,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:52:05,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:52:05,252 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:52:05,253 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:52:05,254 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:52:05,254 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:52:05,311 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/6d93595c9/d86a11c5ee934b4cb32f1592137a3fa8/FLAG19d3bb8d5 [2018-10-26 20:52:05,885 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:52:05,891 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/sv-benchmarks/c/ssh/s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:52:05,919 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/6d93595c9/d86a11c5ee934b4cb32f1592137a3fa8/FLAG19d3bb8d5 [2018-10-26 20:52:05,940 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/data/6d93595c9/d86a11c5ee934b4cb32f1592137a3fa8 [2018-10-26 20:52:05,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:52:05,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:52:05,946 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:52:05,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:52:05,950 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:52:05,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:52:05" (1/1) ... [2018-10-26 20:52:05,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e679efa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:05, skipping insertion in model container [2018-10-26 20:52:05,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:52:05" (1/1) ... [2018-10-26 20:52:05,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:52:06,051 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:52:06,898 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:52:06,916 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:52:07,432 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:52:07,457 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:52:07,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07 WrapperNode [2018-10-26 20:52:07,458 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:52:07,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:52:07,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:52:07,459 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:52:07,466 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:52:07" (1/1) ... [2018-10-26 20:52:07,602 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:52:07" (1/1) ... [2018-10-26 20:52:07,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:52:07,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:52:07,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:52:07,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:52:07,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,764 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... [2018-10-26 20:52:07,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:52:07,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:52:07,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:52:07,812 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:52:07,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:07,898 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:52:07,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:52:07,898 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 20:52:07,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 20:52:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:52:07,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:52:07,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:52:07,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:52:10,635 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 20:52:10,636 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 20:52:13,234 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:52:13,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:52:13 BoogieIcfgContainer [2018-10-26 20:52:13,235 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:52:13,235 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:52:13,236 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:52:13,242 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:52:13,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:52:05" (1/3) ... [2018-10-26 20:52:13,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba99025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:52:13, skipping insertion in model container [2018-10-26 20:52:13,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:52:07" (2/3) ... [2018-10-26 20:52:13,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba99025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:52:13, skipping insertion in model container [2018-10-26 20:52:13,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:52:13" (3/3) ... [2018-10-26 20:52:13,248 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09_false-unreach-call.i.cil.c [2018-10-26 20:52:13,260 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:52:13,271 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:52:13,284 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:52:13,319 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:52:13,320 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:52:13,320 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:52:13,320 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:52:13,320 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:52:13,320 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:52:13,320 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:52:13,320 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:52:13,321 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:52:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states. [2018-10-26 20:52:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-26 20:52:13,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:13,352 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:52:13,354 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:13,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:13,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2122663997, now seen corresponding path program 1 times [2018-10-26 20:52:13,367 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:13,368 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:13,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:13,698 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:52:13,698 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:13,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:13,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:13,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:13,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:13,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:13,732 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 3 states. [2018-10-26 20:52:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:14,188 INFO L93 Difference]: Finished difference Result 438 states and 739 transitions. [2018-10-26 20:52:14,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:14,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-10-26 20:52:14,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:14,205 INFO L225 Difference]: With dead ends: 438 [2018-10-26 20:52:14,205 INFO L226 Difference]: Without dead ends: 267 [2018-10-26 20:52:14,209 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:52:14,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-26 20:52:14,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-10-26 20:52:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:52:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 399 transitions. [2018-10-26 20:52:14,292 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 399 transitions. Word has length 42 [2018-10-26 20:52:14,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:14,294 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 399 transitions. [2018-10-26 20:52:14,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 399 transitions. [2018-10-26 20:52:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-26 20:52:14,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:14,300 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:52:14,300 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:14,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:14,301 INFO L82 PathProgramCache]: Analyzing trace with hash 692256734, now seen corresponding path program 1 times [2018-10-26 20:52:14,302 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:14,302 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:14,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:14,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:14,587 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:52:14,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:14,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:14,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:14,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:14,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:14,594 INFO L87 Difference]: Start difference. First operand 267 states and 399 transitions. Second operand 3 states. [2018-10-26 20:52:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:15,172 INFO L93 Difference]: Finished difference Result 518 states and 788 transitions. [2018-10-26 20:52:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:15,173 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-26 20:52:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:15,176 INFO L225 Difference]: With dead ends: 518 [2018-10-26 20:52:15,176 INFO L226 Difference]: Without dead ends: 390 [2018-10-26 20:52:15,178 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:52:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-26 20:52:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-10-26 20:52:15,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-26 20:52:15,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 581 transitions. [2018-10-26 20:52:15,210 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 581 transitions. Word has length 60 [2018-10-26 20:52:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:15,210 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 581 transitions. [2018-10-26 20:52:15,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 581 transitions. [2018-10-26 20:52:15,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:52:15,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:15,215 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:52:15,215 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 610798098, now seen corresponding path program 1 times [2018-10-26 20:52:15,217 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:15,217 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:15,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:15,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:15,568 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:52:15,570 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:15,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:15,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:15,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:15,576 INFO L87 Difference]: Start difference. First operand 390 states and 581 transitions. Second operand 3 states. [2018-10-26 20:52:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:16,142 INFO L93 Difference]: Finished difference Result 764 states and 1153 transitions. [2018-10-26 20:52:16,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:16,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2018-10-26 20:52:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:16,146 INFO L225 Difference]: With dead ends: 764 [2018-10-26 20:52:16,146 INFO L226 Difference]: Without dead ends: 513 [2018-10-26 20:52:16,148 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:52:16,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-26 20:52:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 513. [2018-10-26 20:52:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-26 20:52:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 764 transitions. [2018-10-26 20:52:16,176 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 764 transitions. Word has length 83 [2018-10-26 20:52:16,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:16,177 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 764 transitions. [2018-10-26 20:52:16,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 764 transitions. [2018-10-26 20:52:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:52:16,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:16,185 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:52:16,186 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:16,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:16,186 INFO L82 PathProgramCache]: Analyzing trace with hash -606699514, now seen corresponding path program 1 times [2018-10-26 20:52:16,187 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:16,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:16,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:16,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:16,558 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:52:16,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:16,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:16,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:16,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:16,566 INFO L87 Difference]: Start difference. First operand 513 states and 764 transitions. Second operand 3 states. [2018-10-26 20:52:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:17,104 INFO L93 Difference]: Finished difference Result 1012 states and 1521 transitions. [2018-10-26 20:52:17,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:17,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2018-10-26 20:52:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:17,108 INFO L225 Difference]: With dead ends: 1012 [2018-10-26 20:52:17,108 INFO L226 Difference]: Without dead ends: 638 [2018-10-26 20:52:17,110 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:52:17,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-26 20:52:17,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2018-10-26 20:52:17,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-26 20:52:17,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 949 transitions. [2018-10-26 20:52:17,130 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 949 transitions. Word has length 108 [2018-10-26 20:52:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:17,131 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 949 transitions. [2018-10-26 20:52:17,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 949 transitions. [2018-10-26 20:52:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:52:17,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:17,134 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:52:17,135 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -321735812, now seen corresponding path program 1 times [2018-10-26 20:52:17,138 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:17,138 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:17,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:17,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:17,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:17,533 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:52:17,534 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:17,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:17,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:17,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:17,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:17,539 INFO L87 Difference]: Start difference. First operand 638 states and 949 transitions. Second operand 3 states. [2018-10-26 20:52:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:17,989 INFO L93 Difference]: Finished difference Result 1258 states and 1884 transitions. [2018-10-26 20:52:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:17,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2018-10-26 20:52:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:17,997 INFO L225 Difference]: With dead ends: 1258 [2018-10-26 20:52:17,997 INFO L226 Difference]: Without dead ends: 759 [2018-10-26 20:52:17,999 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:52:18,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-26 20:52:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2018-10-26 20:52:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-26 20:52:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1129 transitions. [2018-10-26 20:52:18,027 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1129 transitions. Word has length 125 [2018-10-26 20:52:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:18,028 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 1129 transitions. [2018-10-26 20:52:18,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1129 transitions. [2018-10-26 20:52:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-26 20:52:18,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:18,031 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:52:18,032 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:18,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1793540287, now seen corresponding path program 1 times [2018-10-26 20:52:18,034 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:18,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:18,459 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:52:18,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:18,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:18,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:18,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:18,465 INFO L87 Difference]: Start difference. First operand 759 states and 1129 transitions. Second operand 3 states. [2018-10-26 20:52:18,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:18,951 INFO L93 Difference]: Finished difference Result 1502 states and 2248 transitions. [2018-10-26 20:52:18,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:18,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2018-10-26 20:52:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:18,956 INFO L225 Difference]: With dead ends: 1502 [2018-10-26 20:52:18,956 INFO L226 Difference]: Without dead ends: 882 [2018-10-26 20:52:18,957 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:52:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2018-10-26 20:52:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-10-26 20:52:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-10-26 20:52:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1311 transitions. [2018-10-26 20:52:18,981 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1311 transitions. Word has length 138 [2018-10-26 20:52:18,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:18,981 INFO L481 AbstractCegarLoop]: Abstraction has 882 states and 1311 transitions. [2018-10-26 20:52:18,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:18,981 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1311 transitions. [2018-10-26 20:52:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:52:18,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:18,985 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:52:18,985 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:18,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:18,986 INFO L82 PathProgramCache]: Analyzing trace with hash 856976646, now seen corresponding path program 1 times [2018-10-26 20:52:18,986 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:18,987 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:19,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:19,476 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:52:19,476 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:52:19,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:52:19,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:52:19,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:52:19,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:52:19,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:52:19,482 INFO L87 Difference]: Start difference. First operand 882 states and 1311 transitions. Second operand 3 states. [2018-10-26 20:52:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:52:19,842 INFO L93 Difference]: Finished difference Result 1749 states and 2611 transitions. [2018-10-26 20:52:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:52:19,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-10-26 20:52:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:52:19,848 INFO L225 Difference]: With dead ends: 1749 [2018-10-26 20:52:19,848 INFO L226 Difference]: Without dead ends: 1006 [2018-10-26 20:52:19,850 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:52:19,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2018-10-26 20:52:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 1004. [2018-10-26 20:52:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2018-10-26 20:52:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1492 transitions. [2018-10-26 20:52:19,879 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1492 transitions. Word has length 169 [2018-10-26 20:52:19,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:52:19,880 INFO L481 AbstractCegarLoop]: Abstraction has 1004 states and 1492 transitions. [2018-10-26 20:52:19,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:52:19,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1492 transitions. [2018-10-26 20:52:19,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:52:19,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:52:19,884 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:52:19,885 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:52:19,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:52:19,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1721971004, now seen corresponding path program 1 times [2018-10-26 20:52:19,886 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:52:19,886 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:19,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:23,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:24,022 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,027 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:52:24,065 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:52:24,221 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-26 20:52:24,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,298 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,305 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:52:24,306 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,528 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:52:24,556 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:52:24,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,573 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,637 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:52:24,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:52:24,660 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,668 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:52:24,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,678 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:24,682 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:52:24,683 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,700 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,722 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:24,768 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:52:24,768 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 20:52:24,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:25,011 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:52:25,018 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:52:25,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,083 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:52:25,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:52:25,114 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:52:25,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,182 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:52:25,182 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 20:52:25,223 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:52:25,228 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:52:25,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,246 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:52:25,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 20:52:25,262 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:52:25,266 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:52:25,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 20:52:25,379 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:25,395 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:52:25,406 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:52:25,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,473 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:52:25,479 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:52:25,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,483 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,519 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:52:25,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:25,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:52:25,533 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:25,533 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:52:25,539 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:52:25,541 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:52:25,560 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:52:25,579 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:52:25,579 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 20:52:25,605 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:52:25,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:25,616 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:52:25,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,642 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:52:25,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:52:25,668 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:52:25,684 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:52:25,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:25,731 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:52:25,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:52:25,905 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:52:25,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:52:26,044 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:52:26,049 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:52:26,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,053 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,058 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:52:26,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-10-26 20:52:26,134 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:52:26,281 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-26 20:52:26,285 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:52:26,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,306 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:52:26,319 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:52:26,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,344 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:52:26,357 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:52:26,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:52:26,397 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:52:26,401 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:52:26,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:26,408 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:52:26,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 20:52:26,968 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:52:26,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:52:26,974 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:52:26,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:52:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:52:27,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:52:27,627 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:52:27,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,679 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:52:27,684 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:52:27,684 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,689 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,731 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:52:27,734 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:52:27,752 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:27,755 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:52:27,760 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:27,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:27,762 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:27,769 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:52:27,770 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,785 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,796 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,806 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:27,828 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:52:27,828 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-10-26 20:52:28,023 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:52:28,029 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:52:28,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,086 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:52:28,095 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:52:28,096 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:52:28,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,110 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:52:28,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-10-26 20:52:28,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 13 treesize of output 10 [2018-10-26 20:52:28,211 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:52:28,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 20:52:28,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:28,348 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:52:28,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 20:52:28,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 20:52:28,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:52:28,419 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:52:28,420 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:52:28,428 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:52:28,439 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:52:28,440 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-10-26 20:52:28,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 23 treesize of output 18 [2018-10-26 20:52:28,457 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:52:28,459 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:52:28,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,475 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:52:28,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:52:28,480 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:52:28,482 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:52:28,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,485 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:52:28,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:52:28,552 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:52:28,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:52:28,693 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:52:28,854 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2018-10-26 20:52:28,857 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:52:28,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,876 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:52:28,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-26 20:52:28,881 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:52:28,896 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:52:28,910 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:52:28,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:52:29,349 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:52:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:52:29,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-10-26 20:52:29,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 20:52:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 20:52:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:52:29,375 INFO L87 Difference]: Start difference. First operand 1004 states and 1492 transitions. Second operand 24 states. [2018-10-26 20:52:51,868 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 20:52:53,109 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-26 20:52:59,586 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 20:53:02,313 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-26 20:53:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:53:03,369 INFO L93 Difference]: Finished difference Result 3908 states and 5839 transitions. [2018-10-26 20:53:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:53:03,371 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-10-26 20:53:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:53:03,381 INFO L225 Difference]: With dead ends: 3908 [2018-10-26 20:53:03,382 INFO L226 Difference]: Without dead ends: 2918 [2018-10-26 20:53:03,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:53:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2918 states. [2018-10-26 20:53:03,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 1324. [2018-10-26 20:53:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2018-10-26 20:53:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 2076 transitions. [2018-10-26 20:53:03,480 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 2076 transitions. Word has length 175 [2018-10-26 20:53:03,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:53:03,481 INFO L481 AbstractCegarLoop]: Abstraction has 1324 states and 2076 transitions. [2018-10-26 20:53:03,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 20:53:03,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 2076 transitions. [2018-10-26 20:53:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 20:53:03,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:53:03,485 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:53:03,485 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:53:03,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:53:03,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1848500927, now seen corresponding path program 1 times [2018-10-26 20:53:03,486 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:53:03,486 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:53:03,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:53:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:53:07,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:53:07,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,497 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:53:07,510 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:53:07,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,578 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,584 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,585 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:53:07,586 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:07,624 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:07,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:07,745 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:53:07,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:53:07,752 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:07,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:07,813 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:53:07,818 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:53:07,822 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,834 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:53:07,879 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,903 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,927 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:07,952 INFO L303 Elim1Store]: Index analysis took 116 ms [2018-10-26 20:53:07,953 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:53:07,953 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:08,128 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:08,221 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:08,320 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:08,484 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:53:08,484 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 20:53:08,832 WARN L179 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-10-26 20:53:08,887 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:08,968 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-10-26 20:53:08,969 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:53:08,982 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:53:08,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-26 20:53:09,105 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:53:09,106 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:53:09,106 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,135 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:53:09,135 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 20:53:09,167 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:53:09,171 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:53:09,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,184 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:53:09,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 20:53:09,232 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:53:09,244 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:53:09,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 20:53:09,336 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:09,350 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:53:09,359 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:53:09,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,427 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:53:09,433 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:53:09,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,435 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,474 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:53:09,479 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:53:09,480 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:09,482 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:09,482 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:53:09,488 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:53:09,490 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:53:09,501 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:53:09,513 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:53:09,513 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 20:53:09,580 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:53:09,587 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:09,589 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:53:09,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,606 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:53:09,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:53:09,611 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:53:09,613 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:53:09,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:53:09,754 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:53:09,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:53:09,890 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:53:09,895 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:53:09,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:09,940 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:53:09,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:30 [2018-10-26 20:53:10,052 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:53:10,169 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-26 20:53:10,172 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:53:10,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:10,194 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:53:10,216 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:53:10,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:10,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:10,234 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:53:10,247 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:53:10,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:53:10,320 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:53:10,332 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:53:10,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:10,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:10,339 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:53:10,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 20:53:10,689 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:53:10,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:53:10,695 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:53:10,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:53:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:53:11,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:53:11,060 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:53:11,076 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:53:11,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:11,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:11,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:11,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:53:11,181 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:53:11,185 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:53:11,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:11,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:11,265 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:53:11,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-26 20:53:11,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:53:11,319 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:53:11,319 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:21, output treesize:27 [2018-10-26 20:53:11,447 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:53:13,487 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:53:13,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:13,519 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:13,525 INFO L303 Elim1Store]: Index analysis took 2075 ms [2018-10-26 20:53:13,575 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:53:13,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-26 20:53:13,703 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:13,707 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:53:13,707 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:13,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:53:13,824 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:53:13,828 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:13,831 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:53:13,831 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:13,843 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:13,893 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:53:13,894 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:54, output treesize:36 [2018-10-26 20:53:14,417 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:53:14,423 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:53:14,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:14,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:14,426 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:53:14,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:53:14,474 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:53:14,475 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:53:14,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-10-26 20:53:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [9, 9] total 22 [2018-10-26 20:53:14,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-26 20:53:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-26 20:53:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:53:14,503 INFO L87 Difference]: Start difference. First operand 1324 states and 2076 transitions. Second operand 22 states. [2018-10-26 20:53:25,079 WARN L179 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 20:53:26,397 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-10-26 20:53:31,977 WARN L179 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-26 20:53:32,233 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-10-26 20:53:33,485 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-26 20:53:34,935 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2018-10-26 20:53:38,368 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-10-26 20:53:40,673 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-26 20:53:41,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:53:41,351 INFO L93 Difference]: Finished difference Result 4881 states and 7423 transitions. [2018-10-26 20:53:41,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-26 20:53:41,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 176 [2018-10-26 20:53:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:53:41,366 INFO L225 Difference]: With dead ends: 4881 [2018-10-26 20:53:41,366 INFO L226 Difference]: Without dead ends: 3571 [2018-10-26 20:53:41,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 539 GetRequests, 509 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-10-26 20:53:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3571 states. [2018-10-26 20:53:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3571 to 1916. [2018-10-26 20:53:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2018-10-26 20:53:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 3140 transitions. [2018-10-26 20:53:41,504 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 3140 transitions. Word has length 176 [2018-10-26 20:53:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:53:41,505 INFO L481 AbstractCegarLoop]: Abstraction has 1916 states and 3140 transitions. [2018-10-26 20:53:41,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-26 20:53:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 3140 transitions. [2018-10-26 20:53:41,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:53:41,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:53:41,509 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:53:41,510 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:53:41,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:53:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1065153562, now seen corresponding path program 1 times [2018-10-26 20:53:41,511 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:53:41,513 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:53:41,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:53:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:53:44,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:53:44,956 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:53:44,968 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:53:44,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:44,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:44,984 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:53:44,986 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:53:44,986 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:44,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:44,996 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:53:44,996 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:23, output treesize:1 [2018-10-26 20:53:45,024 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:53:45,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:53:45,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:45,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:45,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:45,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-10-26 20:53:45,055 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:53:45,059 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:53:45,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:45,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:45,063 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:53:45,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:3 [2018-10-26 20:53:45,082 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:53:45,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:53:45,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:53:45,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:53:45,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:53:45,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:53:45,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:53:45,089 INFO L87 Difference]: Start difference. First operand 1916 states and 3140 transitions. Second operand 4 states. [2018-10-26 20:53:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:53:47,839 INFO L93 Difference]: Finished difference Result 3913 states and 6415 transitions. [2018-10-26 20:53:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:53:47,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:53:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:53:47,852 INFO L225 Difference]: With dead ends: 3913 [2018-10-26 20:53:47,854 INFO L226 Difference]: Without dead ends: 2011 [2018-10-26 20:53:47,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:53:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2018-10-26 20:53:47,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1932. [2018-10-26 20:53:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2018-10-26 20:53:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 3156 transitions. [2018-10-26 20:53:48,003 INFO L78 Accepts]: Start accepts. Automaton has 1932 states and 3156 transitions. Word has length 184 [2018-10-26 20:53:48,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:53:48,004 INFO L481 AbstractCegarLoop]: Abstraction has 1932 states and 3156 transitions. [2018-10-26 20:53:48,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:53:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1932 states and 3156 transitions. [2018-10-26 20:53:48,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:53:48,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:53:48,011 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:53:48,011 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:53:48,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:53:48,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1353330916, now seen corresponding path program 1 times [2018-10-26 20:53:48,012 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:53:48,013 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:53:48,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:53:50,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:53:51,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:53:51,556 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:53:51,558 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:53:51,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:53:51,585 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:53:51,589 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:51,591 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:53:51,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,608 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:53:51,612 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:53:51,614 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:53:51,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:51,617 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:53:51,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:53:51,643 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:53:51,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:53:51,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:53:51,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:53:51,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:53:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:53:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:53:51,650 INFO L87 Difference]: Start difference. First operand 1932 states and 3156 transitions. Second operand 7 states. [2018-10-26 20:53:55,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:53:55,190 INFO L93 Difference]: Finished difference Result 4678 states and 7521 transitions. [2018-10-26 20:53:55,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:53:55,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2018-10-26 20:53:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:53:55,202 INFO L225 Difference]: With dead ends: 4678 [2018-10-26 20:53:55,202 INFO L226 Difference]: Without dead ends: 2760 [2018-10-26 20:53:55,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 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:53:55,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2018-10-26 20:53:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2146. [2018-10-26 20:53:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2018-10-26 20:53:55,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 3514 transitions. [2018-10-26 20:53:55,358 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 3514 transitions. Word has length 184 [2018-10-26 20:53:55,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:53:55,358 INFO L481 AbstractCegarLoop]: Abstraction has 2146 states and 3514 transitions. [2018-10-26 20:53:55,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:53:55,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 3514 transitions. [2018-10-26 20:53:55,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:53:55,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:53:55,366 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:53:55,366 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:53:55,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:53:55,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1542682778, now seen corresponding path program 1 times [2018-10-26 20:53:55,367 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:53:55,367 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:53:55,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:53:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:53:58,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:53:58,905 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:53:58,907 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:53:58,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:53:58,917 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:53:58,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:53:58,924 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:58,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:53:58,940 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:53:58,940 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:53:58,994 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:53:58,994 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:53:59,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:53:59,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:53:59,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:53:59,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:53:59,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:53:59,001 INFO L87 Difference]: Start difference. First operand 2146 states and 3514 transitions. Second operand 7 states. [2018-10-26 20:54:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:02,248 INFO L93 Difference]: Finished difference Result 4794 states and 7801 transitions. [2018-10-26 20:54:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:02,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2018-10-26 20:54:02,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:02,258 INFO L225 Difference]: With dead ends: 4794 [2018-10-26 20:54:02,259 INFO L226 Difference]: Without dead ends: 2662 [2018-10-26 20:54:02,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:54:02,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2018-10-26 20:54:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2378. [2018-10-26 20:54:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-10-26 20:54:02,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 3922 transitions. [2018-10-26 20:54:02,462 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 3922 transitions. Word has length 184 [2018-10-26 20:54:02,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:02,463 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 3922 transitions. [2018-10-26 20:54:02,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 3922 transitions. [2018-10-26 20:54:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 20:54:02,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:02,470 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:02,471 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:02,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1883273073, now seen corresponding path program 1 times [2018-10-26 20:54:02,472 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:02,472 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:02,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:03,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:03,924 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:54:03,926 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:54:03,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:03,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:03,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:03,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:54:03,948 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:54:03,950 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:54:03,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:03,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:03,955 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:54:03,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:54:03,975 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:54:03,975 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:03,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:03,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:54:03,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:54:03,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:54:03,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:54:03,980 INFO L87 Difference]: Start difference. First operand 2378 states and 3922 transitions. Second operand 4 states. [2018-10-26 20:54:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:06,657 INFO L93 Difference]: Finished difference Result 4982 states and 8179 transitions. [2018-10-26 20:54:06,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:54:06,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-26 20:54:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:06,665 INFO L225 Difference]: With dead ends: 4982 [2018-10-26 20:54:06,666 INFO L226 Difference]: Without dead ends: 2618 [2018-10-26 20:54:06,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:54:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2018-10-26 20:54:06,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 2514. [2018-10-26 20:54:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2018-10-26 20:54:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 4138 transitions. [2018-10-26 20:54:06,839 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 4138 transitions. Word has length 199 [2018-10-26 20:54:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:06,840 INFO L481 AbstractCegarLoop]: Abstraction has 2514 states and 4138 transitions. [2018-10-26 20:54:06,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:54:06,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4138 transitions. [2018-10-26 20:54:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-26 20:54:06,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:06,848 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:06,848 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:06,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:06,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2032657603, now seen corresponding path program 1 times [2018-10-26 20:54:06,850 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:06,850 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:06,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:08,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:08,371 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:54:08,384 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:54:08,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:08,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:08,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:08,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:54:08,492 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:54:08,494 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:54:08,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:08,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:08,501 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:54:08,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:54:08,526 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:54:08,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:08,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:08,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:54:08,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:54:08,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:54:08,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:54:08,532 INFO L87 Difference]: Start difference. First operand 2514 states and 4138 transitions. Second operand 4 states. [2018-10-26 20:54:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:11,585 INFO L93 Difference]: Finished difference Result 5828 states and 9471 transitions. [2018-10-26 20:54:11,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:54:11,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2018-10-26 20:54:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:11,597 INFO L225 Difference]: With dead ends: 5828 [2018-10-26 20:54:11,597 INFO L226 Difference]: Without dead ends: 3328 [2018-10-26 20:54:11,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:54:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3328 states. [2018-10-26 20:54:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3328 to 2866. [2018-10-26 20:54:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-10-26 20:54:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4770 transitions. [2018-10-26 20:54:11,789 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4770 transitions. Word has length 199 [2018-10-26 20:54:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:11,789 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4770 transitions. [2018-10-26 20:54:11,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:54:11,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4770 transitions. [2018-10-26 20:54:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:54:11,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:11,795 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:11,796 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:11,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1016708007, now seen corresponding path program 1 times [2018-10-26 20:54:11,797 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:11,797 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:11,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:15,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:15,906 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:54:15,911 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:54:15,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:15,917 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:54:15,917 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:15,925 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:15,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:15,940 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:54:15,941 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:15,956 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:54:15,962 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:54:15,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:15,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:15,968 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:54:15,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:54:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-10-26 20:54:15,998 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:16,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:16,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:54:16,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:54:16,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:54:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:54:16,005 INFO L87 Difference]: Start difference. First operand 2866 states and 4770 transitions. Second operand 7 states. [2018-10-26 20:54:19,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:19,524 INFO L93 Difference]: Finished difference Result 5994 states and 9889 transitions. [2018-10-26 20:54:19,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:19,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-10-26 20:54:19,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:19,532 INFO L225 Difference]: With dead ends: 5994 [2018-10-26 20:54:19,532 INFO L226 Difference]: Without dead ends: 3142 [2018-10-26 20:54:19,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:54:19,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-10-26 20:54:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2866. [2018-10-26 20:54:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-10-26 20:54:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4762 transitions. [2018-10-26 20:54:19,713 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4762 transitions. Word has length 200 [2018-10-26 20:54:19,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:19,713 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4762 transitions. [2018-10-26 20:54:19,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4762 transitions. [2018-10-26 20:54:19,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:54:19,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:19,718 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:19,718 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:19,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:19,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1684114373, now seen corresponding path program 1 times [2018-10-26 20:54:19,720 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:19,720 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:19,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:23,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:23,730 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:54:23,734 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:54:23,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:23,743 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:54:23,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,751 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,767 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:54:23,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:23,783 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:54:23,786 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:54:23,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:23,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:54:23,821 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:54:23,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:23,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:23,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:54:23,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:54:23,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:54:23,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:54:23,828 INFO L87 Difference]: Start difference. First operand 2866 states and 4762 transitions. Second operand 7 states. [2018-10-26 20:54:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:27,179 INFO L93 Difference]: Finished difference Result 5994 states and 9873 transitions. [2018-10-26 20:54:27,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:27,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-10-26 20:54:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:27,185 INFO L225 Difference]: With dead ends: 5994 [2018-10-26 20:54:27,186 INFO L226 Difference]: Without dead ends: 3142 [2018-10-26 20:54:27,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:54:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2018-10-26 20:54:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 2866. [2018-10-26 20:54:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2866 states. [2018-10-26 20:54:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4754 transitions. [2018-10-26 20:54:27,360 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4754 transitions. Word has length 200 [2018-10-26 20:54:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:27,361 INFO L481 AbstractCegarLoop]: Abstraction has 2866 states and 4754 transitions. [2018-10-26 20:54:27,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4754 transitions. [2018-10-26 20:54:27,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-26 20:54:27,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:27,365 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:27,365 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:27,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:27,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1244498864, now seen corresponding path program 1 times [2018-10-26 20:54:27,367 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:27,367 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:27,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:28,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:28,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:54:28,828 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:54:28,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:28,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:28,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:28,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:54:28,944 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:54:28,960 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:54:28,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:28,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:29,011 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:54:29,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:54:29,119 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:54:29,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:29,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:29,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:54:29,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:54:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:54:29,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:54:29,128 INFO L87 Difference]: Start difference. First operand 2866 states and 4754 transitions. Second operand 4 states. [2018-10-26 20:54:32,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:32,172 INFO L93 Difference]: Finished difference Result 6145 states and 10025 transitions. [2018-10-26 20:54:32,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:54:32,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2018-10-26 20:54:32,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:32,181 INFO L225 Difference]: With dead ends: 6145 [2018-10-26 20:54:32,181 INFO L226 Difference]: Without dead ends: 3277 [2018-10-26 20:54:32,186 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 197 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:54:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2018-10-26 20:54:32,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2858. [2018-10-26 20:54:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-10-26 20:54:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4738 transitions. [2018-10-26 20:54:32,362 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4738 transitions. Word has length 200 [2018-10-26 20:54:32,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:32,363 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 4738 transitions. [2018-10-26 20:54:32,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:54:32,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4738 transitions. [2018-10-26 20:54:32,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:54:32,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:32,370 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:32,370 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:32,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:32,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1196440281, now seen corresponding path program 1 times [2018-10-26 20:54:32,374 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:32,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:32,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:36,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:36,487 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:54:36,489 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:54:36,492 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:36,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 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:54:36,497 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:36,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:36,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:36,520 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:54:36,520 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:36,536 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:54:36,537 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:54:36,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:36,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:36,543 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:54:36,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:54:36,573 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:54:36,573 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:36,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:36,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:54:36,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:54:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:54:36,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:54:36,583 INFO L87 Difference]: Start difference. First operand 2858 states and 4738 transitions. Second operand 7 states. [2018-10-26 20:54:37,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:37,907 INFO L93 Difference]: Finished difference Result 5978 states and 9825 transitions. [2018-10-26 20:54:37,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:37,909 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-10-26 20:54:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:37,915 INFO L225 Difference]: With dead ends: 5978 [2018-10-26 20:54:37,915 INFO L226 Difference]: Without dead ends: 3134 [2018-10-26 20:54:37,919 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:54:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2018-10-26 20:54:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 2858. [2018-10-26 20:54:38,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2858 states. [2018-10-26 20:54:38,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4730 transitions. [2018-10-26 20:54:38,096 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4730 transitions. Word has length 201 [2018-10-26 20:54:38,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:38,096 INFO L481 AbstractCegarLoop]: Abstraction has 2858 states and 4730 transitions. [2018-10-26 20:54:38,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:38,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4730 transitions. [2018-10-26 20:54:38,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 20:54:38,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:38,103 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:38,103 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:38,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:38,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1239269249, now seen corresponding path program 1 times [2018-10-26 20:54:38,104 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:38,104 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:38,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:41,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:42,021 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:54:42,023 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:54:42,026 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:42,028 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:54:42,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,036 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,051 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:54:42,052 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:42,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 17 treesize of output 13 [2018-10-26 20:54:42,071 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:54:42,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,075 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:54:42,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:54:42,104 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:54:42,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:54:42,138 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:54:42,139 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:42,140 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:54:42,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:54:42,159 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:54:42,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:54:42,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:54:42,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:54:42,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:54:42,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:54:42,166 INFO L87 Difference]: Start difference. First operand 2858 states and 4730 transitions. Second operand 9 states. [2018-10-26 20:54:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:46,474 INFO L93 Difference]: Finished difference Result 6596 states and 10657 transitions. [2018-10-26 20:54:46,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:54:46,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-10-26 20:54:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:46,480 INFO L225 Difference]: With dead ends: 6596 [2018-10-26 20:54:46,480 INFO L226 Difference]: Without dead ends: 4107 [2018-10-26 20:54:46,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 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:54:46,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2018-10-26 20:54:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 3018. [2018-10-26 20:54:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-10-26 20:54:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4954 transitions. [2018-10-26 20:54:46,688 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4954 transitions. Word has length 202 [2018-10-26 20:54:46,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:46,689 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4954 transitions. [2018-10-26 20:54:46,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:54:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4954 transitions. [2018-10-26 20:54:46,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-26 20:54:46,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:46,696 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:46,696 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:46,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:46,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1718347776, now seen corresponding path program 1 times [2018-10-26 20:54:46,698 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:46,698 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:46,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:50,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:50,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:54:50,818 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:54:50,821 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:50,824 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:54:50,824 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:50,834 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:50,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:50,847 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:54:50,848 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:50,861 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:54:50,862 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:54:50,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:50,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:50,868 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:54:50,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:54:50,892 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:54:50,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:50,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:50,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:54:50,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:54:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:54:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:54:50,899 INFO L87 Difference]: Start difference. First operand 3018 states and 4954 transitions. Second operand 7 states. [2018-10-26 20:54:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:52,048 INFO L93 Difference]: Finished difference Result 6298 states and 10257 transitions. [2018-10-26 20:54:52,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:52,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2018-10-26 20:54:52,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:52,054 INFO L225 Difference]: With dead ends: 6298 [2018-10-26 20:54:52,054 INFO L226 Difference]: Without dead ends: 3294 [2018-10-26 20:54:52,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 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:54:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2018-10-26 20:54:52,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3018. [2018-10-26 20:54:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-10-26 20:54:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4946 transitions. [2018-10-26 20:54:52,237 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4946 transitions. Word has length 202 [2018-10-26 20:54:52,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:52,237 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4946 transitions. [2018-10-26 20:54:52,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4946 transitions. [2018-10-26 20:54:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 20:54:52,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:52,244 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:52,244 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:52,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1730709876, now seen corresponding path program 1 times [2018-10-26 20:54:52,246 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:52,246 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:52,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:54:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:54:55,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:54:55,981 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:54:55,986 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:54:55,989 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:54:55,992 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:54:55,992 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:56,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:56,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:56,015 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:54:56,015 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:54:56,028 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:54:56,030 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:54:56,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:54:56,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:54:56,034 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:54:56,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:54:56,059 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:54:56,059 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:54:56,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:54:56,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:54:56,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:54:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:54:56,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:54:56,067 INFO L87 Difference]: Start difference. First operand 3018 states and 4946 transitions. Second operand 7 states. [2018-10-26 20:54:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:54:57,157 INFO L93 Difference]: Finished difference Result 6218 states and 10137 transitions. [2018-10-26 20:54:57,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:54:57,158 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-10-26 20:54:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:54:57,161 INFO L225 Difference]: With dead ends: 6218 [2018-10-26 20:54:57,162 INFO L226 Difference]: Without dead ends: 3214 [2018-10-26 20:54:57,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:54:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2018-10-26 20:54:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3018. [2018-10-26 20:54:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3018 states. [2018-10-26 20:54:57,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3018 states to 3018 states and 4938 transitions. [2018-10-26 20:54:57,332 INFO L78 Accepts]: Start accepts. Automaton has 3018 states and 4938 transitions. Word has length 203 [2018-10-26 20:54:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:54:57,332 INFO L481 AbstractCegarLoop]: Abstraction has 3018 states and 4938 transitions. [2018-10-26 20:54:57,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:54:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3018 states and 4938 transitions. [2018-10-26 20:54:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 20:54:57,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:54:57,338 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:54:57,338 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:54:57,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:54:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1932618470, now seen corresponding path program 1 times [2018-10-26 20:54:57,339 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:54:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:54:57,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:55:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:55:00,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:55:01,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:55:01,065 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:55:01,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:55:01,072 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:55:01,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,091 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:55:01,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:55:01,105 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:55:01,107 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:55:01,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:55:01,136 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:55:01,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:55:01,158 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:55:01,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:01,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:55:01,175 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:55:01,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:55:01,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:55:01,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:55:01,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:55:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:55:01,181 INFO L87 Difference]: Start difference. First operand 3018 states and 4938 transitions. Second operand 9 states. [2018-10-26 20:55:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:55:04,701 INFO L93 Difference]: Finished difference Result 6668 states and 10692 transitions. [2018-10-26 20:55:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:55:04,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-10-26 20:55:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:55:04,708 INFO L225 Difference]: With dead ends: 6668 [2018-10-26 20:55:04,709 INFO L226 Difference]: Without dead ends: 4039 [2018-10-26 20:55:04,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 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:55:04,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4039 states. [2018-10-26 20:55:04,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4039 to 3038. [2018-10-26 20:55:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3038 states. [2018-10-26 20:55:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3038 states to 3038 states and 4927 transitions. [2018-10-26 20:55:04,883 INFO L78 Accepts]: Start accepts. Automaton has 3038 states and 4927 transitions. Word has length 203 [2018-10-26 20:55:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:55:04,883 INFO L481 AbstractCegarLoop]: Abstraction has 3038 states and 4927 transitions. [2018-10-26 20:55:04,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:55:04,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3038 states and 4927 transitions. [2018-10-26 20:55:04,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:55:04,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:55:04,886 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:55:04,886 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:55:04,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:55:04,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1098817530, now seen corresponding path program 1 times [2018-10-26 20:55:04,909 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:55:04,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:55:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:55:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:55:08,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:55:08,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:55:08,539 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:55:08,542 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:55:08,544 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:55:08,544 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,566 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:55:08,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:55:08,588 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:55:08,590 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:55:08,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,594 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:55:08,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:55:08,620 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:55:08,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:55:08,648 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:55:08,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:55:08,650 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:55:08,650 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:55:08,667 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:55:08,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:55:08,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:55:08,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:55:08,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:55:08,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:55:08,674 INFO L87 Difference]: Start difference. First operand 3038 states and 4927 transitions. Second operand 9 states. [2018-10-26 20:55:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:55:12,388 INFO L93 Difference]: Finished difference Result 6820 states and 10864 transitions. [2018-10-26 20:55:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:55:12,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2018-10-26 20:55:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:55:12,392 INFO L225 Difference]: With dead ends: 6820 [2018-10-26 20:55:12,393 INFO L226 Difference]: Without dead ends: 4184 [2018-10-26 20:55:12,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:55:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4184 states. [2018-10-26 20:55:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4184 to 3214. [2018-10-26 20:55:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3214 states. [2018-10-26 20:55:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3214 states to 3214 states and 5167 transitions. [2018-10-26 20:55:12,605 INFO L78 Accepts]: Start accepts. Automaton has 3214 states and 5167 transitions. Word has length 204 [2018-10-26 20:55:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:55:12,605 INFO L481 AbstractCegarLoop]: Abstraction has 3214 states and 5167 transitions. [2018-10-26 20:55:12,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:55:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3214 states and 5167 transitions. [2018-10-26 20:55:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:55:12,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:55:12,608 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:55:12,608 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:55:12,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:55:12,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1969145605, now seen corresponding path program 1 times [2018-10-26 20:55:12,609 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:55:12,610 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/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:55:12,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:55:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:55:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:55:23,498 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:55:23,538 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,540 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,541 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,541 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,543 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:55:23 BoogieIcfgContainer [2018-10-26 20:55:23,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:55:23,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:55:23,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:55:23,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:55:23,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:52:13" (3/4) ... [2018-10-26 20:55:23,658 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,674 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:55:23,796 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8cef62db-be5c-4339-a303-b78b195dceca/bin-2019/utaipan/witness.graphml [2018-10-26 20:55:23,797 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:55:23,798 INFO L168 Benchmark]: Toolchain (without parser) took 197854.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 278.4 MB). Free memory was 945.2 MB in the beginning and 1.0 GB in the end (delta: -75.3 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,799 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:55:23,799 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1512.40 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 777.4 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,799 INFO L168 Benchmark]: Boogie Procedure Inliner took 212.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 777.4 MB in the beginning and 1.1 GB in the end (delta: -302.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,799 INFO L168 Benchmark]: Boogie Preprocessor took 139.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,800 INFO L168 Benchmark]: RCFGBuilder took 5423.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 902.5 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,800 INFO L168 Benchmark]: TraceAbstraction took 190416.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 902.5 MB in the beginning and 1.0 GB in the end (delta: -138.7 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,800 INFO L168 Benchmark]: Witness Printer took 145.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:55:23,805 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.57 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1512.40 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 777.4 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 212.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 777.4 MB in the beginning and 1.1 GB in the end (delta: -302.4 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 139.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5423.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 902.5 MB in the end (delta: 171.1 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 190416.81 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 902.5 MB in the beginning and 1.0 GB in the end (delta: -138.7 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * Witness Printer took 145.13 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 20.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] CALL static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1043] RET static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] EXPR, FCALL malloc(sizeof(SSL)) [L1070] s = malloc(sizeof(SSL)) [L1071] EXPR, FCALL malloc(sizeof(struct ssl3_state_st)) [L1071] CALL s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1071] RET s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] EXPR, FCALL malloc(sizeof(SSL_CTX)) [L1072] CALL s->ctx = malloc(sizeof(SSL_CTX)) [L1072] RET s->ctx = malloc(sizeof(SSL_CTX)) [L1073] EXPR, FCALL malloc(sizeof(SSL_SESSION)) [L1073] CALL s->session = malloc(sizeof(SSL_SESSION)) [L1073] RET s->session = malloc(sizeof(SSL_SESSION)) [L1074] CALL ssl3_accept(s) VAL [init=1, SSLv3_server_data={1058913772:0}] [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] CALL s->state = 8464 [L1105] RET s->state = 8464 [L1106] blastFlag = 0 [L1107] CALL s->hit=__VERIFIER_nondet_int () [L1107] RET s->hit=__VERIFIER_nondet_int () [L1108] CALL s->state = 8464 [L1108] RET s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] CALL, EXPR s->info_callback [L1115] RET, EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] CALL, EXPR s->info_callback [L1116] RET, EXPR s->info_callback [L1116] cb = s->info_callback [L1120] CALL, EXPR s->in_handshake [L1120] RET, EXPR s->in_handshake [L1120] CALL s->in_handshake += 1 [L1120] RET s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={1058913772:0}] [L1130] CALL, EXPR s->cert [L1130] RET, EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] CALL s->shutdown = 0 [L1323] RET s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] CALL s->state = 8496 [L1336] RET s->state = 8496 [L1337] CALL s->init_num = 0 [L1337] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1347] COND FALSE !(ret <= 0) [L1352] CALL s->hit [L1352] RET s->hit [L1352] COND TRUE s->hit [L1353] CALL s->state = 8656 [L1353] RET s->state = 8656 [L1357] CALL s->init_num = 0 [L1357] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND TRUE s->state == 8656 [L1570] CALL, EXPR s->session [L1570] RET, EXPR s->session [L1570] CALL, EXPR s->s3 [L1570] RET, EXPR s->s3 [L1570] CALL, EXPR (s->s3)->tmp.new_cipher [L1570] RET, EXPR (s->s3)->tmp.new_cipher [L1570] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1570] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1583] COND FALSE !(ret <= 0) [L1588] CALL s->state = 8672 [L1588] RET s->state = 8672 [L1589] CALL s->init_num = 0 [L1589] RET s->init_num = 0 [L1590] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1058913772:0}] [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] CALL, EXPR s->state [L1226] RET, EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] CALL, EXPR s->state [L1229] RET, EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] CALL, EXPR s->state [L1232] RET, EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] CALL, EXPR s->state [L1235] RET, EXPR s->state [L1235] COND TRUE s->state == 8672 [L1599] ret = __VERIFIER_nondet_int() [L1600] COND TRUE blastFlag == 3 [L1601] blastFlag = 4 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1613] COND FALSE !(ret <= 0) [L1618] CALL s->state = 8448 [L1618] RET s->state = 8448 [L1619] CALL s->hit [L1619] RET s->hit [L1619] COND TRUE s->hit [L1620] CALL, EXPR s->s3 [L1620] RET, EXPR s->s3 [L1620] CALL (s->s3)->tmp.next_state = 8640 [L1620] RET (s->s3)->tmp.next_state = 8640 [L1624] CALL s->init_num = 0 [L1624] RET s->init_num = 0 [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={1058913772:0}] [L1503] CALL, EXPR s->s3 [L1503] RET, EXPR s->s3 [L1503] CALL, EXPR (s->s3)->tmp.next_state [L1503] RET, EXPR (s->s3)->tmp.next_state [L1503] CALL s->state = (s->s3)->tmp.next_state [L1503] RET s->state = (s->s3)->tmp.next_state [L1685] CALL, EXPR s->s3 [L1685] RET, EXPR s->s3 [L1685] CALL, EXPR (s->s3)->tmp.reuse_message [L1685] RET, EXPR (s->s3)->tmp.reuse_message [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1138] CALL, EXPR s->state [L1138] RET, EXPR s->state [L1138] state = s->state [L1139] CALL, EXPR s->state [L1139] RET, EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] CALL, EXPR s->state [L1142] RET, EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] CALL, EXPR s->state [L1145] RET, EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] CALL, EXPR s->state [L1148] RET, EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] CALL, EXPR s->state [L1151] RET, EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] CALL, EXPR s->state [L1154] RET, EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] CALL, EXPR s->state [L1157] RET, EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] CALL, EXPR s->state [L1160] RET, EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] CALL, EXPR s->state [L1163] RET, EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] CALL, EXPR s->state [L1166] RET, EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] CALL, EXPR s->state [L1169] RET, EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] CALL, EXPR s->state [L1172] RET, EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] CALL, EXPR s->state [L1175] RET, EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] CALL, EXPR s->state [L1178] RET, EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] CALL, EXPR s->state [L1181] RET, EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] CALL, EXPR s->state [L1184] RET, EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] CALL, EXPR s->state [L1187] RET, EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] CALL, EXPR s->state [L1190] RET, EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] CALL, EXPR s->state [L1193] RET, EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] CALL, EXPR s->state [L1196] RET, EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] CALL, EXPR s->state [L1199] RET, EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] CALL, EXPR s->state [L1202] RET, EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] CALL, EXPR s->state [L1205] RET, EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] CALL, EXPR s->state [L1208] RET, EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] CALL, EXPR s->state [L1211] RET, EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] CALL, EXPR s->state [L1214] RET, EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] CALL, EXPR s->state [L1217] RET, EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] CALL, EXPR s->state [L1220] RET, EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] CALL, EXPR s->state [L1223] RET, EXPR s->state [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={1058913772:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1058913772:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 160 locations, 1 error locations. UNSAFE Result, 190.3s OverallTime, 24 OverallIterations, 7 TraceHistogramMax, 104.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5792 SDtfs, 9982 SDslu, 11405 SDs, 0 SdLazy, 10553 SolverSat, 1120 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 93.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5369 GetRequests, 5198 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3214occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 9573 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.1s SsaConstructionTime, 49.0s SatisfiabilityAnalysisTime, 23.6s InterpolantComputationTime, 4397 NumberOfCodeBlocks, 4397 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5296 ConstructedInterpolants, 253 QuantifiedInterpolants, 6683003 SizeOfPredicates, 427 NumberOfNonLiveVariables, 25629 ConjunctsInSsa, 462 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 6492/7508 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...