./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12_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_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/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 8d12a4ed635b67a581b2f50c213476981b0de70d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/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 8d12a4ed635b67a581b2f50c213476981b0de70d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:30:48,524 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:30:48,525 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:30:48,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:30:48,531 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:30:48,532 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:30:48,533 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:30:48,534 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:30:48,535 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:30:48,535 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:30:48,536 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:30:48,536 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:30:48,537 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:30:48,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:30:48,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:30:48,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:30:48,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:30:48,540 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:30:48,541 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:30:48,542 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:30:48,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:30:48,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:30:48,545 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:30:48,545 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:30:48,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:30:48,546 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:30:48,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:30:48,547 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:30:48,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:30:48,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:30:48,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:30:48,549 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:30:48,549 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:30:48,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:30:48,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:30:48,550 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:30:48,550 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:30:48,557 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:30:48,557 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:30:48,558 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:30:48,558 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:30:48,558 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:30:48,559 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:30:48,559 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:30:48,559 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:30:48,559 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:30:48,559 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:30:48,559 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:30:48,560 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:30:48,560 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:30:48,561 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:30:48,561 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:30:48,562 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:30:48,562 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:30:48,563 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:30:48,563 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_73d196db-a2fe-457e-bcac-f23409b13969/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 -> 8d12a4ed635b67a581b2f50c213476981b0de70d [2018-11-10 13:30:48,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:30:48,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:30:48,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:30:48,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:30:48,601 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:30:48,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:30:48,648 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5df06d676/7d8c2307276846149198bc543240d338/FLAG7fa8e2b27 [2018-11-10 13:30:49,130 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:30:49,131 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:30:49,144 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5df06d676/7d8c2307276846149198bc543240d338/FLAG7fa8e2b27 [2018-11-10 13:30:49,156 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5df06d676/7d8c2307276846149198bc543240d338 [2018-11-10 13:30:49,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:30:49,160 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:30:49,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:49,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:30:49,164 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:30:49,164 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:49,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6b6041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49, skipping insertion in model container [2018-11-10 13:30:49,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:49,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:30:49,220 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:30:49,630 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:49,638 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:30:49,921 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:49,937 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:30:49,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49 WrapperNode [2018-11-10 13:30:49,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:49,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:49,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:30:49,938 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:30:49,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:49,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:50,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:30:50,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:30:50,010 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:30:50,018 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,018 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,070 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... [2018-11-10 13:30:50,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:30:50,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:30:50,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:30:50,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:30:50,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:30:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:30:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:30:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 13:30:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 13:30:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:30:50,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:30:50,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:30:50,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:30:50,584 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 13:30:50,585 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 13:30:51,133 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:30:51,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:51 BoogieIcfgContainer [2018-11-10 13:30:51,134 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:30:51,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:30:51,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:30:51,136 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:30:51,136 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:30:49" (1/3) ... [2018-11-10 13:30:51,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2b61bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:51, skipping insertion in model container [2018-11-10 13:30:51,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:49" (2/3) ... [2018-11-10 13:30:51,137 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d2b61bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:51, skipping insertion in model container [2018-11-10 13:30:51,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:51" (3/3) ... [2018-11-10 13:30:51,139 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:30:51,144 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:30:51,150 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:30:51,159 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:30:51,182 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:30:51,182 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:30:51,182 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:30:51,182 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:30:51,182 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:30:51,182 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:30:51,182 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:30:51,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:30:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-11-10 13:30:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 13:30:51,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:51,203 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:51,205 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:51,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1976703281, now seen corresponding path program 1 times [2018-11-10 13:30:51,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:51,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:51,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:51,245 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:51,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:51,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:51,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:51,492 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:51,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:51,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:51,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:51,508 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-11-10 13:30:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:51,852 INFO L93 Difference]: Finished difference Result 340 states and 569 transitions. [2018-11-10 13:30:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:51,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-11-10 13:30:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:51,860 INFO L225 Difference]: With dead ends: 340 [2018-11-10 13:30:51,861 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 13:30:51,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 13:30:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2018-11-10 13:30:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 13:30:51,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-11-10 13:30:51,894 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 48 [2018-11-10 13:30:51,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:51,895 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-11-10 13:30:51,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-11-10 13:30:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 13:30:51,897 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:51,897 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:51,897 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:51,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash -42223919, now seen corresponding path program 1 times [2018-11-10 13:30:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:51,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:51,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:51,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:52,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:52,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:52,055 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:52,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:52,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:52,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:52,056 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 4 states. [2018-11-10 13:30:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:52,434 INFO L93 Difference]: Finished difference Result 360 states and 555 transitions. [2018-11-10 13:30:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:52,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-11-10 13:30:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:52,436 INFO L225 Difference]: With dead ends: 360 [2018-11-10 13:30:52,436 INFO L226 Difference]: Without dead ends: 230 [2018-11-10 13:30:52,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-11-10 13:30:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 189. [2018-11-10 13:30:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-11-10 13:30:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 297 transitions. [2018-11-10 13:30:52,447 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 297 transitions. Word has length 62 [2018-11-10 13:30:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:52,447 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 297 transitions. [2018-11-10 13:30:52,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 297 transitions. [2018-11-10 13:30:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:30:52,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:52,449 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:30:52,449 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:52,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 36231652, now seen corresponding path program 1 times [2018-11-10 13:30:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:52,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:52,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:52,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:52,453 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:52,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:52,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:52,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:52,549 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:52,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:52,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:52,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:52,551 INFO L87 Difference]: Start difference. First operand 189 states and 297 transitions. Second operand 4 states. [2018-11-10 13:30:52,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:52,935 INFO L93 Difference]: Finished difference Result 478 states and 753 transitions. [2018-11-10 13:30:52,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:52,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-10 13:30:52,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:52,937 INFO L225 Difference]: With dead ends: 478 [2018-11-10 13:30:52,938 INFO L226 Difference]: Without dead ends: 315 [2018-11-10 13:30:52,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-10 13:30:52,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 230. [2018-11-10 13:30:52,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 13:30:52,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 371 transitions. [2018-11-10 13:30:52,951 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 371 transitions. Word has length 63 [2018-11-10 13:30:52,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:52,952 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 371 transitions. [2018-11-10 13:30:52,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:52,952 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 371 transitions. [2018-11-10 13:30:52,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:30:52,954 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:52,955 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:30:52,955 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:52,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:52,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1115427517, now seen corresponding path program 1 times [2018-11-10 13:30:52,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:52,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:52,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:52,956 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:53,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:53,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:53,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:53,061 INFO L87 Difference]: Start difference. First operand 230 states and 371 transitions. Second operand 4 states. [2018-11-10 13:30:53,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:53,449 INFO L93 Difference]: Finished difference Result 559 states and 900 transitions. [2018-11-10 13:30:53,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:53,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 13:30:53,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:53,451 INFO L225 Difference]: With dead ends: 559 [2018-11-10 13:30:53,451 INFO L226 Difference]: Without dead ends: 355 [2018-11-10 13:30:53,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:53,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-10 13:30:53,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 271. [2018-11-10 13:30:53,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 13:30:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 446 transitions. [2018-11-10 13:30:53,461 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 446 transitions. Word has length 64 [2018-11-10 13:30:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:53,462 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 446 transitions. [2018-11-10 13:30:53,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:53,463 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 446 transitions. [2018-11-10 13:30:53,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:30:53,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:53,465 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-10 13:30:53,466 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:53,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:53,466 INFO L82 PathProgramCache]: Analyzing trace with hash 697401560, now seen corresponding path program 1 times [2018-11-10 13:30:53,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:53,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:53,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:53,467 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:53,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:53,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:53,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:53,568 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:53,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:53,569 INFO L87 Difference]: Start difference. First operand 271 states and 446 transitions. Second operand 4 states. [2018-11-10 13:30:53,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:53,797 INFO L93 Difference]: Finished difference Result 533 states and 876 transitions. [2018-11-10 13:30:53,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:53,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 13:30:53,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:53,799 INFO L225 Difference]: With dead ends: 533 [2018-11-10 13:30:53,799 INFO L226 Difference]: Without dead ends: 288 [2018-11-10 13:30:53,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:53,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-11-10 13:30:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 271. [2018-11-10 13:30:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 13:30:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 445 transitions. [2018-11-10 13:30:53,808 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 445 transitions. Word has length 92 [2018-11-10 13:30:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:53,808 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 445 transitions. [2018-11-10 13:30:53,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 445 transitions. [2018-11-10 13:30:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:30:53,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:53,809 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2018-11-10 13:30:53,809 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:53,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash -500809557, now seen corresponding path program 1 times [2018-11-10 13:30:53,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:53,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:53,811 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:53,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:53,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:53,913 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:53,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:53,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:53,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:53,913 INFO L87 Difference]: Start difference. First operand 271 states and 445 transitions. Second operand 4 states. [2018-11-10 13:30:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:54,250 INFO L93 Difference]: Finished difference Result 678 states and 1117 transitions. [2018-11-10 13:30:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:54,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:30:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:54,253 INFO L225 Difference]: With dead ends: 678 [2018-11-10 13:30:54,253 INFO L226 Difference]: Without dead ends: 433 [2018-11-10 13:30:54,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-10 13:30:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 337. [2018-11-10 13:30:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 13:30:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 563 transitions. [2018-11-10 13:30:54,266 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 563 transitions. Word has length 93 [2018-11-10 13:30:54,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:54,267 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 563 transitions. [2018-11-10 13:30:54,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 563 transitions. [2018-11-10 13:30:54,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:30:54,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:54,268 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-11-10 13:30:54,269 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:54,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:54,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1648532608, now seen corresponding path program 1 times [2018-11-10 13:30:54,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:54,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:54,347 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:54,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:54,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:54,348 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:54,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:54,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:54,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:54,349 INFO L87 Difference]: Start difference. First operand 337 states and 563 transitions. Second operand 4 states. [2018-11-10 13:30:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:54,601 INFO L93 Difference]: Finished difference Result 663 states and 1109 transitions. [2018-11-10 13:30:54,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:54,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:30:54,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:54,603 INFO L225 Difference]: With dead ends: 663 [2018-11-10 13:30:54,603 INFO L226 Difference]: Without dead ends: 352 [2018-11-10 13:30:54,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-11-10 13:30:54,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 337. [2018-11-10 13:30:54,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-10 13:30:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 562 transitions. [2018-11-10 13:30:54,610 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 562 transitions. Word has length 93 [2018-11-10 13:30:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:54,610 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 562 transitions. [2018-11-10 13:30:54,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 562 transitions. [2018-11-10 13:30:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:30:54,611 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:54,611 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:30:54,611 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:54,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash 267565761, now seen corresponding path program 1 times [2018-11-10 13:30:54,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:54,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,612 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 13:30:54,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:54,662 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:54,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:54,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:54,663 INFO L87 Difference]: Start difference. First operand 337 states and 562 transitions. Second operand 3 states. [2018-11-10 13:30:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:54,701 INFO L93 Difference]: Finished difference Result 955 states and 1611 transitions. [2018-11-10 13:30:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:54,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-10 13:30:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:54,703 INFO L225 Difference]: With dead ends: 955 [2018-11-10 13:30:54,703 INFO L226 Difference]: Without dead ends: 644 [2018-11-10 13:30:54,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:54,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-11-10 13:30:54,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2018-11-10 13:30:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-11-10 13:30:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1071 transitions. [2018-11-10 13:30:54,714 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1071 transitions. Word has length 99 [2018-11-10 13:30:54,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:54,714 INFO L481 AbstractCegarLoop]: Abstraction has 642 states and 1071 transitions. [2018-11-10 13:30:54,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:54,714 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1071 transitions. [2018-11-10 13:30:54,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:30:54,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:54,715 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:30:54,716 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:54,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:54,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1104241537, now seen corresponding path program 1 times [2018-11-10 13:30:54,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:54,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:54,717 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:54,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:54,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:54,788 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:54,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:54,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:54,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:54,789 INFO L87 Difference]: Start difference. First operand 642 states and 1071 transitions. Second operand 4 states. [2018-11-10 13:30:55,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:55,088 INFO L93 Difference]: Finished difference Result 1503 states and 2474 transitions. [2018-11-10 13:30:55,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:55,088 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 13:30:55,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:55,091 INFO L225 Difference]: With dead ends: 1503 [2018-11-10 13:30:55,091 INFO L226 Difference]: Without dead ends: 887 [2018-11-10 13:30:55,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-11-10 13:30:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 718. [2018-11-10 13:30:55,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-10 13:30:55,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1205 transitions. [2018-11-10 13:30:55,103 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1205 transitions. Word has length 99 [2018-11-10 13:30:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:55,103 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 1205 transitions. [2018-11-10 13:30:55,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:55,103 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1205 transitions. [2018-11-10 13:30:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:30:55,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:55,105 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:30:55,105 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:55,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash 2110886264, now seen corresponding path program 1 times [2018-11-10 13:30:55,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:55,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,106 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:55,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:55,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:55,160 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:55,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:55,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:55,161 INFO L87 Difference]: Start difference. First operand 718 states and 1205 transitions. Second operand 4 states. [2018-11-10 13:30:55,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:55,431 INFO L93 Difference]: Finished difference Result 1573 states and 2596 transitions. [2018-11-10 13:30:55,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:55,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 13:30:55,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:55,434 INFO L225 Difference]: With dead ends: 1573 [2018-11-10 13:30:55,434 INFO L226 Difference]: Without dead ends: 881 [2018-11-10 13:30:55,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2018-11-10 13:30:55,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 718. [2018-11-10 13:30:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-10 13:30:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1201 transitions. [2018-11-10 13:30:55,448 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1201 transitions. Word has length 100 [2018-11-10 13:30:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:55,448 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 1201 transitions. [2018-11-10 13:30:55,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1201 transitions. [2018-11-10 13:30:55,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:30:55,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:55,450 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2018-11-10 13:30:55,450 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:55,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:55,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1515972717, now seen corresponding path program 1 times [2018-11-10 13:30:55,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:55,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,451 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 13:30:55,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:55,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:55,512 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:55,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:55,512 INFO L87 Difference]: Start difference. First operand 718 states and 1201 transitions. Second operand 4 states. [2018-11-10 13:30:55,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:55,678 INFO L93 Difference]: Finished difference Result 1424 states and 2384 transitions. [2018-11-10 13:30:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:55,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 13:30:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:55,680 INFO L225 Difference]: With dead ends: 1424 [2018-11-10 13:30:55,680 INFO L226 Difference]: Without dead ends: 732 [2018-11-10 13:30:55,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2018-11-10 13:30:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 718. [2018-11-10 13:30:55,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2018-11-10 13:30:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1200 transitions. [2018-11-10 13:30:55,692 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1200 transitions. Word has length 107 [2018-11-10 13:30:55,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:55,693 INFO L481 AbstractCegarLoop]: Abstraction has 718 states and 1200 transitions. [2018-11-10 13:30:55,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:55,693 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1200 transitions. [2018-11-10 13:30:55,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:30:55,694 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:55,694 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2018-11-10 13:30:55,694 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:55,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:55,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1061193895, now seen corresponding path program 1 times [2018-11-10 13:30:55,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:55,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:55,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:55,696 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 13:30:55,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:55,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:30:55,773 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:55,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:30:55,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:30:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:55,773 INFO L87 Difference]: Start difference. First operand 718 states and 1200 transitions. Second operand 5 states. [2018-11-10 13:30:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:56,074 INFO L93 Difference]: Finished difference Result 1430 states and 2392 transitions. [2018-11-10 13:30:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:30:56,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-11-10 13:30:56,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:56,076 INFO L225 Difference]: With dead ends: 1430 [2018-11-10 13:30:56,076 INFO L226 Difference]: Without dead ends: 738 [2018-11-10 13:30:56,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:30:56,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-11-10 13:30:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-11-10 13:30:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-11-10 13:30:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1210 transitions. [2018-11-10 13:30:56,090 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1210 transitions. Word has length 107 [2018-11-10 13:30:56,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:56,090 INFO L481 AbstractCegarLoop]: Abstraction has 736 states and 1210 transitions. [2018-11-10 13:30:56,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:30:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1210 transitions. [2018-11-10 13:30:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:30:56,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:56,091 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2018-11-10 13:30:56,092 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1662192289, now seen corresponding path program 1 times [2018-11-10 13:30:56,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:56,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:56,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:56,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:56,165 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:56,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:56,166 INFO L87 Difference]: Start difference. First operand 736 states and 1210 transitions. Second operand 4 states. [2018-11-10 13:30:56,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:56,437 INFO L93 Difference]: Finished difference Result 1689 states and 2743 transitions. [2018-11-10 13:30:56,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:56,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 13:30:56,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:56,440 INFO L225 Difference]: With dead ends: 1689 [2018-11-10 13:30:56,440 INFO L226 Difference]: Without dead ends: 979 [2018-11-10 13:30:56,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2018-11-10 13:30:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 770. [2018-11-10 13:30:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2018-11-10 13:30:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1252 transitions. [2018-11-10 13:30:56,456 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1252 transitions. Word has length 107 [2018-11-10 13:30:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:56,456 INFO L481 AbstractCegarLoop]: Abstraction has 770 states and 1252 transitions. [2018-11-10 13:30:56,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1252 transitions. [2018-11-10 13:30:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:30:56,458 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:56,458 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:30:56,459 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:56,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:56,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1333830944, now seen corresponding path program 1 times [2018-11-10 13:30:56,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:56,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,460 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:56,511 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:56,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:56,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:56,511 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:56,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:56,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:56,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:56,512 INFO L87 Difference]: Start difference. First operand 770 states and 1252 transitions. Second operand 4 states. [2018-11-10 13:30:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:56,825 INFO L93 Difference]: Finished difference Result 1757 states and 2825 transitions. [2018-11-10 13:30:56,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:56,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 13:30:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:56,828 INFO L225 Difference]: With dead ends: 1757 [2018-11-10 13:30:56,828 INFO L226 Difference]: Without dead ends: 1013 [2018-11-10 13:30:56,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-11-10 13:30:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 858. [2018-11-10 13:30:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 858 states. [2018-11-10 13:30:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1400 transitions. [2018-11-10 13:30:56,844 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1400 transitions. Word has length 107 [2018-11-10 13:30:56,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:56,844 INFO L481 AbstractCegarLoop]: Abstraction has 858 states and 1400 transitions. [2018-11-10 13:30:56,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:56,844 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1400 transitions. [2018-11-10 13:30:56,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:30:56,846 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:56,846 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:30:56,846 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:56,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:56,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1609228975, now seen corresponding path program 1 times [2018-11-10 13:30:56,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:56,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:56,847 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:56,896 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:30:56,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:56,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:56,897 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:56,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:56,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:56,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:56,897 INFO L87 Difference]: Start difference. First operand 858 states and 1400 transitions. Second operand 4 states. [2018-11-10 13:30:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:57,161 INFO L93 Difference]: Finished difference Result 1851 states and 2983 transitions. [2018-11-10 13:30:57,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:57,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 13:30:57,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:57,164 INFO L225 Difference]: With dead ends: 1851 [2018-11-10 13:30:57,164 INFO L226 Difference]: Without dead ends: 1015 [2018-11-10 13:30:57,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:57,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-10 13:30:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 862. [2018-11-10 13:30:57,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-10 13:30:57,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1406 transitions. [2018-11-10 13:30:57,182 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1406 transitions. Word has length 108 [2018-11-10 13:30:57,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:57,182 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 1406 transitions. [2018-11-10 13:30:57,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:57,182 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1406 transitions. [2018-11-10 13:30:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:30:57,183 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:57,183 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2018-11-10 13:30:57,184 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:57,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:57,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1492274135, now seen corresponding path program 1 times [2018-11-10 13:30:57,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:57,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,185 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:57,234 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:57,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:57,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:57,234 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:57,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:57,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:57,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:57,235 INFO L87 Difference]: Start difference. First operand 862 states and 1406 transitions. Second operand 4 states. [2018-11-10 13:30:57,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:57,538 INFO L93 Difference]: Finished difference Result 1851 states and 2981 transitions. [2018-11-10 13:30:57,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:57,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 13:30:57,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:57,541 INFO L225 Difference]: With dead ends: 1851 [2018-11-10 13:30:57,541 INFO L226 Difference]: Without dead ends: 1015 [2018-11-10 13:30:57,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2018-11-10 13:30:57,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 862. [2018-11-10 13:30:57,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-11-10 13:30:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1392 transitions. [2018-11-10 13:30:57,559 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1392 transitions. Word has length 108 [2018-11-10 13:30:57,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:57,559 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 1392 transitions. [2018-11-10 13:30:57,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:57,559 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1392 transitions. [2018-11-10 13:30:57,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:30:57,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:57,561 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:30:57,561 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:57,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:57,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1394322204, now seen corresponding path program 1 times [2018-11-10 13:30:57,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:57,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:57,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:57,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:57,611 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:57,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:57,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:57,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:57,612 INFO L87 Difference]: Start difference. First operand 862 states and 1392 transitions. Second operand 4 states. [2018-11-10 13:30:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:57,877 INFO L93 Difference]: Finished difference Result 1937 states and 3095 transitions. [2018-11-10 13:30:57,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:57,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-11-10 13:30:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:57,880 INFO L225 Difference]: With dead ends: 1937 [2018-11-10 13:30:57,881 INFO L226 Difference]: Without dead ends: 1101 [2018-11-10 13:30:57,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-11-10 13:30:57,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 924. [2018-11-10 13:30:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-10 13:30:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1484 transitions. [2018-11-10 13:30:57,899 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1484 transitions. Word has length 121 [2018-11-10 13:30:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:57,900 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 1484 transitions. [2018-11-10 13:30:57,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1484 transitions. [2018-11-10 13:30:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:30:57,901 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:57,901 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:30:57,901 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1103383558, now seen corresponding path program 1 times [2018-11-10 13:30:57,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:57,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:57,903 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:57,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:57,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:57,947 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:57,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:57,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:57,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:57,948 INFO L87 Difference]: Start difference. First operand 924 states and 1484 transitions. Second operand 4 states. [2018-11-10 13:30:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:58,341 INFO L93 Difference]: Finished difference Result 1975 states and 3137 transitions. [2018-11-10 13:30:58,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:58,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-10 13:30:58,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:58,345 INFO L225 Difference]: With dead ends: 1975 [2018-11-10 13:30:58,345 INFO L226 Difference]: Without dead ends: 1077 [2018-11-10 13:30:58,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:58,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2018-11-10 13:30:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 924. [2018-11-10 13:30:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 924 states. [2018-11-10 13:30:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1470 transitions. [2018-11-10 13:30:58,378 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1470 transitions. Word has length 122 [2018-11-10 13:30:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:58,378 INFO L481 AbstractCegarLoop]: Abstraction has 924 states and 1470 transitions. [2018-11-10 13:30:58,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1470 transitions. [2018-11-10 13:30:58,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 13:30:58,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:58,382 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:30:58,382 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:58,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:58,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1130421593, now seen corresponding path program 1 times [2018-11-10 13:30:58,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:58,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:58,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:58,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:58,383 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:58,448 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:58,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:58,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:58,448 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:58,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:58,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:58,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:58,449 INFO L87 Difference]: Start difference. First operand 924 states and 1470 transitions. Second operand 4 states. [2018-11-10 13:30:58,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:58,855 INFO L93 Difference]: Finished difference Result 2061 states and 3247 transitions. [2018-11-10 13:30:58,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:58,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-11-10 13:30:58,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:58,859 INFO L225 Difference]: With dead ends: 2061 [2018-11-10 13:30:58,859 INFO L226 Difference]: Without dead ends: 1163 [2018-11-10 13:30:58,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2018-11-10 13:30:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 982. [2018-11-10 13:30:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-11-10 13:30:58,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1552 transitions. [2018-11-10 13:30:58,891 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1552 transitions. Word has length 125 [2018-11-10 13:30:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:58,892 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1552 transitions. [2018-11-10 13:30:58,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1552 transitions. [2018-11-10 13:30:58,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 13:30:58,894 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:58,894 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:58,894 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:58,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:58,895 INFO L82 PathProgramCache]: Analyzing trace with hash 965365277, now seen corresponding path program 1 times [2018-11-10 13:30:58,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:58,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:58,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:58,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:58,896 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 13:30:58,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:58,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:58,998 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:58,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:58,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:58,999 INFO L87 Difference]: Start difference. First operand 982 states and 1552 transitions. Second operand 4 states. [2018-11-10 13:30:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:59,289 INFO L93 Difference]: Finished difference Result 2091 states and 3273 transitions. [2018-11-10 13:30:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:59,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-10 13:30:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:59,291 INFO L225 Difference]: With dead ends: 2091 [2018-11-10 13:30:59,292 INFO L226 Difference]: Without dead ends: 1135 [2018-11-10 13:30:59,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2018-11-10 13:30:59,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 982. [2018-11-10 13:30:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-11-10 13:30:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1536 transitions. [2018-11-10 13:30:59,311 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1536 transitions. Word has length 126 [2018-11-10 13:30:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:59,311 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1536 transitions. [2018-11-10 13:30:59,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1536 transitions. [2018-11-10 13:30:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 13:30:59,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:59,313 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-10 13:30:59,313 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:59,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1858826906, now seen corresponding path program 1 times [2018-11-10 13:30:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:59,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:59,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:59,315 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:59,361 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:30:59,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:59,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:59,361 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:59,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:59,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:59,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:59,362 INFO L87 Difference]: Start difference. First operand 982 states and 1536 transitions. Second operand 4 states. [2018-11-10 13:30:59,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:59,606 INFO L93 Difference]: Finished difference Result 2177 states and 3375 transitions. [2018-11-10 13:30:59,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:30:59,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2018-11-10 13:30:59,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:59,609 INFO L225 Difference]: With dead ends: 2177 [2018-11-10 13:30:59,609 INFO L226 Difference]: Without dead ends: 1221 [2018-11-10 13:30:59,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2018-11-10 13:30:59,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1054. [2018-11-10 13:30:59,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-10 13:30:59,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1644 transitions. [2018-11-10 13:30:59,643 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1644 transitions. Word has length 133 [2018-11-10 13:30:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:59,643 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1644 transitions. [2018-11-10 13:30:59,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1644 transitions. [2018-11-10 13:30:59,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-10 13:30:59,645 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:59,646 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2018-11-10 13:30:59,646 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:59,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:59,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1188971305, now seen corresponding path program 1 times [2018-11-10 13:30:59,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:59,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:59,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:59,647 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 13:30:59,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:59,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:59,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:59,724 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:59,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:59,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:59,725 INFO L87 Difference]: Start difference. First operand 1054 states and 1644 transitions. Second operand 4 states. [2018-11-10 13:31:00,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:00,076 INFO L93 Difference]: Finished difference Result 2235 states and 3457 transitions. [2018-11-10 13:31:00,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:00,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-11-10 13:31:00,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:00,080 INFO L225 Difference]: With dead ends: 2235 [2018-11-10 13:31:00,080 INFO L226 Difference]: Without dead ends: 1207 [2018-11-10 13:31:00,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-11-10 13:31:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1054. [2018-11-10 13:31:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2018-11-10 13:31:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1636 transitions. [2018-11-10 13:31:00,114 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1636 transitions. Word has length 134 [2018-11-10 13:31:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:00,114 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 1636 transitions. [2018-11-10 13:31:00,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1636 transitions. [2018-11-10 13:31:00,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-11-10 13:31:00,117 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:00,117 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:31:00,117 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:00,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:00,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2030538346, now seen corresponding path program 1 times [2018-11-10 13:31:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:00,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:00,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:00,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:00,119 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:31:00,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:00,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:00,225 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:00,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:00,227 INFO L87 Difference]: Start difference. First operand 1054 states and 1636 transitions. Second operand 4 states. [2018-11-10 13:31:00,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:00,523 INFO L93 Difference]: Finished difference Result 2324 states and 3574 transitions. [2018-11-10 13:31:00,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:00,524 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-11-10 13:31:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:00,527 INFO L225 Difference]: With dead ends: 2324 [2018-11-10 13:31:00,527 INFO L226 Difference]: Without dead ends: 1296 [2018-11-10 13:31:00,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2018-11-10 13:31:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1141. [2018-11-10 13:31:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1141 states. [2018-11-10 13:31:00,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1763 transitions. [2018-11-10 13:31:00,564 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1763 transitions. Word has length 149 [2018-11-10 13:31:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:00,564 INFO L481 AbstractCegarLoop]: Abstraction has 1141 states and 1763 transitions. [2018-11-10 13:31:00,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1763 transitions. [2018-11-10 13:31:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-10 13:31:00,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:00,568 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:00,568 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:00,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:00,569 INFO L82 PathProgramCache]: Analyzing trace with hash -416057049, now seen corresponding path program 1 times [2018-11-10 13:31:00,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:00,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:00,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:00,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:00,570 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 13:31:00,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:00,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:00,674 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:00,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:00,674 INFO L87 Difference]: Start difference. First operand 1141 states and 1763 transitions. Second operand 4 states. [2018-11-10 13:31:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:00,996 INFO L93 Difference]: Finished difference Result 2409 states and 3695 transitions. [2018-11-10 13:31:00,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:00,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2018-11-10 13:31:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:00,998 INFO L225 Difference]: With dead ends: 2409 [2018-11-10 13:31:00,998 INFO L226 Difference]: Without dead ends: 1278 [2018-11-10 13:31:00,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2018-11-10 13:31:01,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1125. [2018-11-10 13:31:01,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2018-11-10 13:31:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1735 transitions. [2018-11-10 13:31:01,029 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1735 transitions. Word has length 150 [2018-11-10 13:31:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:01,029 INFO L481 AbstractCegarLoop]: Abstraction has 1125 states and 1735 transitions. [2018-11-10 13:31:01,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1735 transitions. [2018-11-10 13:31:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 13:31:01,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:01,031 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:31:01,031 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:01,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:01,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1265382730, now seen corresponding path program 1 times [2018-11-10 13:31:01,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:01,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:01,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,032 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:01,081 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 13:31:01,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:01,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:01,082 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:01,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:01,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:01,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:01,083 INFO L87 Difference]: Start difference. First operand 1125 states and 1735 transitions. Second operand 4 states. [2018-11-10 13:31:01,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:01,329 INFO L93 Difference]: Finished difference Result 2447 states and 3749 transitions. [2018-11-10 13:31:01,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:01,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-10 13:31:01,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:01,332 INFO L225 Difference]: With dead ends: 2447 [2018-11-10 13:31:01,332 INFO L226 Difference]: Without dead ends: 1348 [2018-11-10 13:31:01,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:01,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-11-10 13:31:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1179. [2018-11-10 13:31:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-11-10 13:31:01,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1803 transitions. [2018-11-10 13:31:01,357 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1803 transitions. Word has length 154 [2018-11-10 13:31:01,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:01,357 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1803 transitions. [2018-11-10 13:31:01,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1803 transitions. [2018-11-10 13:31:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 13:31:01,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:01,359 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:31:01,359 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:01,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:01,359 INFO L82 PathProgramCache]: Analyzing trace with hash -959065548, now seen corresponding path program 1 times [2018-11-10 13:31:01,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,361 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 13:31:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:01,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:01,444 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:01,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:01,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:01,445 INFO L87 Difference]: Start difference. First operand 1179 states and 1803 transitions. Second operand 4 states. [2018-11-10 13:31:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:01,749 INFO L93 Difference]: Finished difference Result 2485 states and 3775 transitions. [2018-11-10 13:31:01,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:01,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-10 13:31:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:01,752 INFO L225 Difference]: With dead ends: 2485 [2018-11-10 13:31:01,752 INFO L226 Difference]: Without dead ends: 1332 [2018-11-10 13:31:01,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-11-10 13:31:01,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1179. [2018-11-10 13:31:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1179 states. [2018-11-10 13:31:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1781 transitions. [2018-11-10 13:31:01,775 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1781 transitions. Word has length 155 [2018-11-10 13:31:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:01,775 INFO L481 AbstractCegarLoop]: Abstraction has 1179 states and 1781 transitions. [2018-11-10 13:31:01,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1781 transitions. [2018-11-10 13:31:01,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:31:01,776 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:01,776 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:31:01,776 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:01,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1805750833, now seen corresponding path program 1 times [2018-11-10 13:31:01,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:01,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:01,777 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 13:31:01,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:01,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:01,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:01,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:01,888 INFO L87 Difference]: Start difference. First operand 1179 states and 1781 transitions. Second operand 4 states. [2018-11-10 13:31:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:02,198 INFO L93 Difference]: Finished difference Result 2555 states and 3839 transitions. [2018-11-10 13:31:02,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:02,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-11-10 13:31:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:02,202 INFO L225 Difference]: With dead ends: 2555 [2018-11-10 13:31:02,202 INFO L226 Difference]: Without dead ends: 1402 [2018-11-10 13:31:02,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-11-10 13:31:02,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1247. [2018-11-10 13:31:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2018-11-10 13:31:02,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1875 transitions. [2018-11-10 13:31:02,236 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1875 transitions. Word has length 168 [2018-11-10 13:31:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:02,236 INFO L481 AbstractCegarLoop]: Abstraction has 1247 states and 1875 transitions. [2018-11-10 13:31:02,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:02,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1875 transitions. [2018-11-10 13:31:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-11-10 13:31:02,237 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:02,237 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:02,237 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:02,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:02,237 INFO L82 PathProgramCache]: Analyzing trace with hash -735402880, now seen corresponding path program 1 times [2018-11-10 13:31:02,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:02,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:02,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:02,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:02,312 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 13:31:02,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:02,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:02,313 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:02,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:02,314 INFO L87 Difference]: Start difference. First operand 1247 states and 1875 transitions. Second operand 4 states. [2018-11-10 13:31:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:02,595 INFO L93 Difference]: Finished difference Result 2621 states and 3919 transitions. [2018-11-10 13:31:02,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:02,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-11-10 13:31:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:02,598 INFO L225 Difference]: With dead ends: 2621 [2018-11-10 13:31:02,598 INFO L226 Difference]: Without dead ends: 1382 [2018-11-10 13:31:02,600 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2018-11-10 13:31:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1163. [2018-11-10 13:31:02,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-11-10 13:31:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1735 transitions. [2018-11-10 13:31:02,625 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1735 transitions. Word has length 169 [2018-11-10 13:31:02,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:02,626 INFO L481 AbstractCegarLoop]: Abstraction has 1163 states and 1735 transitions. [2018-11-10 13:31:02,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1735 transitions. [2018-11-10 13:31:02,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 13:31:02,626 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:02,627 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2018-11-10 13:31:02,627 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:02,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:02,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1781797916, now seen corresponding path program 1 times [2018-11-10 13:31:02,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:02,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:02,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:02,628 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 13:31:02,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:02,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:02,717 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:02,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:02,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:02,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:02,718 INFO L87 Difference]: Start difference. First operand 1163 states and 1735 transitions. Second operand 4 states. [2018-11-10 13:31:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:02,986 INFO L93 Difference]: Finished difference Result 2479 states and 3681 transitions. [2018-11-10 13:31:02,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:02,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-11-10 13:31:02,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:02,989 INFO L225 Difference]: With dead ends: 2479 [2018-11-10 13:31:02,989 INFO L226 Difference]: Without dead ends: 1342 [2018-11-10 13:31:02,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:02,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2018-11-10 13:31:03,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1186. [2018-11-10 13:31:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-11-10 13:31:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1748 transitions. [2018-11-10 13:31:03,017 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1748 transitions. Word has length 172 [2018-11-10 13:31:03,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:03,017 INFO L481 AbstractCegarLoop]: Abstraction has 1186 states and 1748 transitions. [2018-11-10 13:31:03,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:03,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1748 transitions. [2018-11-10 13:31:03,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 13:31:03,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:03,019 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-11-10 13:31:03,019 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:03,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash -203826234, now seen corresponding path program 1 times [2018-11-10 13:31:03,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:03,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:03,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,020 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 13:31:03,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:03,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:03,075 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:03,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:03,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:03,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:03,076 INFO L87 Difference]: Start difference. First operand 1186 states and 1748 transitions. Second operand 4 states. [2018-11-10 13:31:03,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:03,397 INFO L93 Difference]: Finished difference Result 2495 states and 3660 transitions. [2018-11-10 13:31:03,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:03,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-11-10 13:31:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:03,399 INFO L225 Difference]: With dead ends: 2495 [2018-11-10 13:31:03,399 INFO L226 Difference]: Without dead ends: 1335 [2018-11-10 13:31:03,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-11-10 13:31:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1186. [2018-11-10 13:31:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2018-11-10 13:31:03,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1724 transitions. [2018-11-10 13:31:03,435 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1724 transitions. Word has length 173 [2018-11-10 13:31:03,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:03,435 INFO L481 AbstractCegarLoop]: Abstraction has 1186 states and 1724 transitions. [2018-11-10 13:31:03,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1724 transitions. [2018-11-10 13:31:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:31:03,437 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:03,437 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:03,437 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:03,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1535817506, now seen corresponding path program 1 times [2018-11-10 13:31:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-10 13:31:03,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:03,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:31:03,543 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:03,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:31:03,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:31:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:31:03,543 INFO L87 Difference]: Start difference. First operand 1186 states and 1724 transitions. Second operand 3 states. [2018-11-10 13:31:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:03,651 INFO L93 Difference]: Finished difference Result 2372 states and 3465 transitions. [2018-11-10 13:31:03,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:31:03,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-10 13:31:03,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:03,654 INFO L225 Difference]: With dead ends: 2372 [2018-11-10 13:31:03,654 INFO L226 Difference]: Without dead ends: 1777 [2018-11-10 13:31:03,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:31:03,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2018-11-10 13:31:03,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1759. [2018-11-10 13:31:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1759 states. [2018-11-10 13:31:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2566 transitions. [2018-11-10 13:31:03,703 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2566 transitions. Word has length 175 [2018-11-10 13:31:03,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:03,704 INFO L481 AbstractCegarLoop]: Abstraction has 1759 states and 2566 transitions. [2018-11-10 13:31:03,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:31:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2566 transitions. [2018-11-10 13:31:03,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:31:03,706 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:03,706 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:03,706 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:03,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:03,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1287671012, now seen corresponding path program 1 times [2018-11-10 13:31:03,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:03,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:03,707 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 153 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:31:04,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:04,102 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:04,103 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 176 with the following transitions: [2018-11-10 13:31:04,104 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], [515], [520], [535], [540], [545], [551], [556], [558], [563], [569], [572], [576], [597], [631], [633], [645], [648], [649], [650], [652] [2018-11-10 13:31:04,150 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:04,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:04,671 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:31:39,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:31:39,420 INFO L272 AbstractInterpreter]: Visited 77 different actions 390 times. Merged at 63 different actions 298 times. Widened at 9 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 13:31:39,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:39,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:31:39,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:39,432 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:31:39,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:39,438 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:31:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:39,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:31:39,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:31:39,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:31:39,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:31:39,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:31:39,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:31:39,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:39,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:31:39,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:39,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:39,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:39,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:31:39,843 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,853 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,859 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,876 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 13:31:39,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 13:31:39,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 13:31:39,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 13:31:39,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 13:31:39,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:39,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 13:31:40,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:31:40,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:31:40,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 13:31:40,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 13:31:40,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-10 13:31:40,139 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:31:40,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:31:40,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 13:31:40,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:31:40,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,171 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 13:31:40,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 13:31:40,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:31:40,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:31:40,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 13:31:40,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-10 13:31:40,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:31:40,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 13:31:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:31:40,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:31:40,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 13:31:40,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:31:40,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:31:40,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 13:31:40,393 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:31:40,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 13:31:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:31:40,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:31:40,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-11-10 13:31:40,733 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:31:40,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 13:31:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 13:31:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-11-10 13:31:40,734 INFO L87 Difference]: Start difference. First operand 1759 states and 2566 transitions. Second operand 16 states. [2018-11-10 13:31:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:41,674 INFO L93 Difference]: Finished difference Result 3554 states and 5176 transitions. [2018-11-10 13:31:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:31:41,675 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 175 [2018-11-10 13:31:41,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:41,678 INFO L225 Difference]: With dead ends: 3554 [2018-11-10 13:31:41,678 INFO L226 Difference]: Without dead ends: 1821 [2018-11-10 13:31:41,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 341 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-11-10 13:31:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2018-11-10 13:31:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1555. [2018-11-10 13:31:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-11-10 13:31:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2266 transitions. [2018-11-10 13:31:41,764 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2266 transitions. Word has length 175 [2018-11-10 13:31:41,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:41,764 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 2266 transitions. [2018-11-10 13:31:41,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 13:31:41,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2266 transitions. [2018-11-10 13:31:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 13:31:41,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:41,768 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-10 13:31:41,768 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:41,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1478737200, now seen corresponding path program 1 times [2018-11-10 13:31:41,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:41,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:41,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:41,769 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 13:31:41,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:41,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:41,843 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:41,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:41,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:41,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:41,844 INFO L87 Difference]: Start difference. First operand 1555 states and 2266 transitions. Second operand 4 states. [2018-11-10 13:31:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:42,360 INFO L93 Difference]: Finished difference Result 3366 states and 4888 transitions. [2018-11-10 13:31:42,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:42,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-11-10 13:31:42,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:42,363 INFO L225 Difference]: With dead ends: 3366 [2018-11-10 13:31:42,363 INFO L226 Difference]: Without dead ends: 1837 [2018-11-10 13:31:42,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2018-11-10 13:31:42,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1630. [2018-11-10 13:31:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2018-11-10 13:31:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2353 transitions. [2018-11-10 13:31:42,446 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2353 transitions. Word has length 177 [2018-11-10 13:31:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:42,446 INFO L481 AbstractCegarLoop]: Abstraction has 1630 states and 2353 transitions. [2018-11-10 13:31:42,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:42,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2353 transitions. [2018-11-10 13:31:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 13:31:42,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:42,449 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-11-10 13:31:42,449 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:42,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash -654875130, now seen corresponding path program 1 times [2018-11-10 13:31:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:42,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:42,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:42,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 13:31:42,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:42,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:31:42,547 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:42,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:31:42,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:31:42,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:31:42,550 INFO L87 Difference]: Start difference. First operand 1630 states and 2353 transitions. Second operand 4 states. [2018-11-10 13:31:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:42,831 INFO L93 Difference]: Finished difference Result 2909 states and 4187 transitions. [2018-11-10 13:31:42,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:31:42,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-10 13:31:42,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:42,833 INFO L225 Difference]: With dead ends: 2909 [2018-11-10 13:31:42,833 INFO L226 Difference]: Without dead ends: 1293 [2018-11-10 13:31:42,835 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:42,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1293 states. [2018-11-10 13:31:42,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1293 to 1151. [2018-11-10 13:31:42,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-11-10 13:31:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1640 transitions. [2018-11-10 13:31:42,868 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1640 transitions. Word has length 178 [2018-11-10 13:31:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:42,868 INFO L481 AbstractCegarLoop]: Abstraction has 1151 states and 1640 transitions. [2018-11-10 13:31:42,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:31:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1640 transitions. [2018-11-10 13:31:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 13:31:42,870 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:42,870 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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] [2018-11-10 13:31:42,870 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:42,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:42,870 INFO L82 PathProgramCache]: Analyzing trace with hash -133536364, now seen corresponding path program 1 times [2018-11-10 13:31:42,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:42,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:42,871 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:43,188 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:31:43,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:43,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:43,188 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2018-11-10 13:31:43,189 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [37], [43], [45], [50], [55], [60], [65], [70], [75], [80], [85], [88], [90], [95], [100], [103], [105], [110], [113], [115], [120], [123], [125], [130], [133], [135], [140], [145], [150], [153], [155], [160], [165], [170], [175], [180], [185], [188], [279], [282], [290], [292], [295], [303], [308], [310], [312], [315], [330], [332], [337], [339], [344], [349], [390], [392], [394], [397], [408], [410], [420], [422], [427], [433], [455], [457], [515], [520], [597], [631], [633], [645], [648], [649], [650], [652] [2018-11-10 13:31:43,195 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:43,196 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:43,559 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:32:37,234 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:32:37,234 INFO L272 AbstractInterpreter]: Visited 85 different actions 602 times. Merged at 71 different actions 476 times. Widened at 13 different actions 37 times. Found 46 fixpoints after 20 different actions. Largest state had 153 variables. [2018-11-10 13:32:37,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:37,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:32:37,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:32:37,236 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:32:37,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:37,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:32:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:37,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:32:37,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:32:37,467 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:32:37,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:32:37,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:37,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:32:37,478 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:37,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:37,480 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:37,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:32:37,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,498 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,502 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,507 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:32, output treesize:10 [2018-11-10 13:32:37,539 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 107 treesize of output 78 [2018-11-10 13:32:37,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:32:37,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,550 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 77 treesize of output 53 [2018-11-10 13:32:37,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:32:37,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,562 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 42 treesize of output 47 [2018-11-10 13:32:37,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:32:37,571 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,615 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-11-10 13:32:37,637 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 53 treesize of output 49 [2018-11-10 13:32:37,639 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 49 treesize of output 41 [2018-11-10 13:32:37,640 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:37,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:37,650 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 25 treesize of output 22 [2018-11-10 13:32:37,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:32:37,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,653 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 37 treesize of output 21 [2018-11-10 13:32:37,660 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 21 treesize of output 9 [2018-11-10 13:32:37,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,662 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,665 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-11-10 13:32:37,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:32:37,683 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 8 treesize of output 4 [2018-11-10 13:32:37,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-11-10 13:32:37,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:32:37,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:32:37,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:32:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:32:37,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:32:37,784 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 125 treesize of output 119 [2018-11-10 13:32:37,787 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 119 treesize of output 107 [2018-11-10 13:32:37,787 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:37,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:32:37,805 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 107 treesize of output 79 [2018-11-10 13:32:37,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:32:37,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,813 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:37,816 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 0 case distinctions, treesize of input 78 treesize of output 59 [2018-11-10 13:32:37,836 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:32:37,843 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 26 treesize of output 42 [2018-11-10 13:32:37,843 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:32:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2018-11-10 13:32:37,860 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:32:37,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:32:37,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-10 13:32:37,861 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,863 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 13:32:37,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 13:32:37,866 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,871 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:37,877 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-11-10 13:32:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:32:37,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:32:37,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2018-11-10 13:32:37,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:32:37,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:32:37,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:32:37,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:32:37,955 INFO L87 Difference]: Start difference. First operand 1151 states and 1640 transitions. Second operand 13 states. [2018-11-10 13:32:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:32:39,503 INFO L93 Difference]: Finished difference Result 6328 states and 9060 transitions. [2018-11-10 13:32:39,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 13:32:39,503 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 203 [2018-11-10 13:32:39,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:32:39,511 INFO L225 Difference]: With dead ends: 6328 [2018-11-10 13:32:39,511 INFO L226 Difference]: Without dead ends: 5238 [2018-11-10 13:32:39,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-10 13:32:39,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2018-11-10 13:32:39,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 2221. [2018-11-10 13:32:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2018-11-10 13:32:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 3233 transitions. [2018-11-10 13:32:39,645 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 3233 transitions. Word has length 203 [2018-11-10 13:32:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:32:39,645 INFO L481 AbstractCegarLoop]: Abstraction has 2221 states and 3233 transitions. [2018-11-10 13:32:39,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:32:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 3233 transitions. [2018-11-10 13:32:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 13:32:39,647 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:39,647 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:32:39,648 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:39,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -312006685, now seen corresponding path program 1 times [2018-11-10 13:32:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:32:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:32:39,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:39,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:32:39,649 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:32:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:32:39,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:32:39,965 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:32:39,985 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:39,986 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:39,987 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:39,987 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:39,987 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:39,987 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:32:40,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:32:40 BoogieIcfgContainer [2018-11-10 13:32:40,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:32:40,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:32:40,056 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:32:40,056 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:32:40,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:51" (3/4) ... [2018-11-10 13:32:40,062 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 13:32:40,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:32:40,063 INFO L168 Benchmark]: Toolchain (without parser) took 110904.41 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 955.5 MB in the beginning and 634.5 MB in the end (delta: 321.0 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,064 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:32:40,064 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,065 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,065 INFO L168 Benchmark]: Boogie Preprocessor took 66.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,065 INFO L168 Benchmark]: RCFGBuilder took 1056.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 161.5 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,066 INFO L168 Benchmark]: TraceAbstraction took 108921.87 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 948.3 MB in the beginning and 634.5 MB in the end (delta: 313.7 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2018-11-10 13:32:40,066 INFO L168 Benchmark]: Witness Printer took 6.40 ms. Allocated memory is still 5.0 GB. Free memory is still 634.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:32:40,071 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 777.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 183.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1056.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 948.3 MB in the end (delta: 161.5 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108921.87 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 948.3 MB in the beginning and 634.5 MB in the end (delta: 313.7 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. * Witness Printer took 6.40 ms. Allocated memory is still 5.0 GB. Free memory is still 634.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1738]: 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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] 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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] 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 [L1590] CALL, EXPR s->session [L1590] RET, EXPR s->session [L1590] CALL, EXPR s->s3 [L1590] RET, EXPR s->s3 [L1590] CALL, EXPR (s->s3)->tmp.new_cipher [L1590] RET, EXPR (s->s3)->tmp.new_cipher [L1590] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1590] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1591] COND FALSE !(! tmp___9) [L1597] ret = __VERIFIER_nondet_int() [L1598] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={24588:0}] [L1603] COND FALSE !(ret <= 0) [L1608] CALL s->state = 8672 [L1608] RET s->state = 8672 [L1609] CALL s->init_num = 0 [L1609] RET s->init_num = 0 [L1610] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24588:0}] [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] 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 [L1619] ret = __VERIFIER_nondet_int() [L1620] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={24588:0}] [L1625] COND FALSE !(ret <= 0) [L1630] CALL s->state = 8448 [L1630] RET s->state = 8448 [L1631] CALL s->hit [L1631] RET s->hit [L1631] COND TRUE s->hit [L1632] CALL, EXPR s->s3 [L1632] RET, EXPR s->s3 [L1632] CALL (s->s3)->tmp.next_state = 8640 [L1632] RET (s->s3)->tmp.next_state = 8640 [L1636] CALL s->init_num = 0 [L1636] RET s->init_num = 0 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] 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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] 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 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={24588:0}] [L1738] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24588:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 162 locations, 1 error locations. UNSAFE Result, 108.8s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5281 SDtfs, 7019 SDslu, 10395 SDs, 0 SdLazy, 10000 SolverSat, 1844 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 961 GetRequests, 815 SyntacticMatches, 7 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2221occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 89.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 7318 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 4999 NumberOfCodeBlocks, 4999 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5133 ConstructedInterpolants, 84 QuantifiedInterpolants, 4661026 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4091 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 39 InterpolantComputations, 33 PerfectInterpolantSequences, 4414/5461 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 13:32:41,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:32:41,632 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:32:41,640 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:32:41,640 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:32:41,641 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:32:41,642 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:32:41,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:32:41,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:32:41,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:32:41,646 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:32:41,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:32:41,646 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:32:41,648 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:32:41,648 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:32:41,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:32:41,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:32:41,651 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:32:41,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:32:41,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:32:41,655 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:32:41,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:32:41,658 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:32:41,658 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:32:41,658 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:32:41,659 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:32:41,660 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:32:41,660 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:32:41,661 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:32:41,662 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:32:41,662 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:32:41,663 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:32:41,663 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:32:41,663 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:32:41,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:32:41,664 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:32:41,665 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 13:32:41,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:32:41,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:32:41,677 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:32:41,677 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:32:41,677 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:32:41,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:32:41,677 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:32:41,677 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:32:41,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:32:41,679 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:32:41,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:32:41,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:32:41,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 13:32:41,681 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 13:32:41,681 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_73d196db-a2fe-457e-bcac-f23409b13969/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 -> 8d12a4ed635b67a581b2f50c213476981b0de70d [2018-11-10 13:32:41,713 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:32:41,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:32:41,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:32:41,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:32:41,724 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:32:41,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:32:41,761 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5f794912a/bbbbe553bd2145d59fb903e6e69f5e87/FLAG22e15afee [2018-11-10 13:32:42,154 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:32:42,155 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/sv-benchmarks/c/ssh/s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:32:42,167 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5f794912a/bbbbe553bd2145d59fb903e6e69f5e87/FLAG22e15afee [2018-11-10 13:32:42,175 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/data/5f794912a/bbbbe553bd2145d59fb903e6e69f5e87 [2018-11-10 13:32:42,177 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:32:42,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:32:42,178 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:32:42,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:32:42,181 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:32:42,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:42,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98dadd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42, skipping insertion in model container [2018-11-10 13:32:42,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:42,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:32:42,228 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:32:42,656 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:32:42,665 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:32:42,861 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:32:42,874 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:32:42,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42 WrapperNode [2018-11-10 13:32:42,874 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:32:42,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:32:42,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:32:42,875 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:32:42,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:42,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:32:43,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:32:43,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:32:43,013 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:32:43,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,031 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... [2018-11-10 13:32:43,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:32:43,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:32:43,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:32:43,087 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:32:43,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:32:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:32:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:32:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 13:32:43,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 13:32:43,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:32:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:32:43,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:32:43,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:32:45,555 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 13:32:45,555 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 13:32:46,283 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:32:46,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:32:46 BoogieIcfgContainer [2018-11-10 13:32:46,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:32:46,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:32:46,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:32:46,286 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:32:46,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:32:42" (1/3) ... [2018-11-10 13:32:46,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a1f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:32:46, skipping insertion in model container [2018-11-10 13:32:46,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:32:42" (2/3) ... [2018-11-10 13:32:46,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35a1f8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:32:46, skipping insertion in model container [2018-11-10 13:32:46,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:32:46" (3/3) ... [2018-11-10 13:32:46,289 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12_false-unreach-call.i.cil.c [2018-11-10 13:32:46,294 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:32:46,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 13:32:46,309 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 13:32:46,329 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 13:32:46,329 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:32:46,329 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:32:46,329 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:32:46,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:32:46,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:32:46,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:32:46,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:32:46,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:32:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-11-10 13:32:46,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-10 13:32:46,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:46,350 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:32:46,351 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:46,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:46,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1976703281, now seen corresponding path program 1 times [2018-11-10 13:32:46,359 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:32:46,359 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:32:46,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:46,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:32:46,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:32:46,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:32:46,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:46,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:46,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:46,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:32:46,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:32:46,974 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:46,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:32:46,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:46,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:47,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:47,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:32:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:32:47,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:32:47,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:32:47,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:32:47,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:32:47,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:32:47,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:32:47,087 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 6 states. [2018-11-10 13:32:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:32:51,963 INFO L93 Difference]: Finished difference Result 340 states and 569 transitions. [2018-11-10 13:32:51,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:32:51,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-11-10 13:32:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:32:51,977 INFO L225 Difference]: With dead ends: 340 [2018-11-10 13:32:51,977 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 13:32:51,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:32:51,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 13:32:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2018-11-10 13:32:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 13:32:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 238 transitions. [2018-11-10 13:32:52,018 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 238 transitions. Word has length 48 [2018-11-10 13:32:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:32:52,019 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 238 transitions. [2018-11-10 13:32:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:32:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 238 transitions. [2018-11-10 13:32:52,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-10 13:32:52,021 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:52,021 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:32:52,021 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:52,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:52,021 INFO L82 PathProgramCache]: Analyzing trace with hash -42223919, now seen corresponding path program 1 times [2018-11-10 13:32:52,022 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:32:52,022 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:32:52,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:52,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:32:52,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:32:52,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:32:52,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:32:52,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:32:52,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:32:52,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:32:52,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:32:52,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:32:52,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:32:52,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:52,749 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:32:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:32:52,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:32:52,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:32:52,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:32:52,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:32:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:32:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:32:52,801 INFO L87 Difference]: Start difference. First operand 156 states and 238 transitions. Second operand 6 states. [2018-11-10 13:32:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:32:55,365 INFO L93 Difference]: Finished difference Result 303 states and 460 transitions. [2018-11-10 13:32:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:32:55,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-11-10 13:32:55,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:32:55,367 INFO L225 Difference]: With dead ends: 303 [2018-11-10 13:32:55,367 INFO L226 Difference]: Without dead ends: 173 [2018-11-10 13:32:55,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:32:55,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-10 13:32:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 156. [2018-11-10 13:32:55,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-10 13:32:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 237 transitions. [2018-11-10 13:32:55,379 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 237 transitions. Word has length 62 [2018-11-10 13:32:55,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:32:55,379 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 237 transitions. [2018-11-10 13:32:55,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:32:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 237 transitions. [2018-11-10 13:32:55,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:32:55,380 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:55,380 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:32:55,380 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:55,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:55,381 INFO L82 PathProgramCache]: Analyzing trace with hash 36231652, now seen corresponding path program 1 times [2018-11-10 13:32:55,381 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:32:55,381 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:32:55,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:55,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:55,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:32:55,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:32:55,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:32:55,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:32:55,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:32:55,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:32:55,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:55,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:32:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:32:55,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:32:55,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:32:55,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:32:55,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:32:55,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:32:55,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:32:55,743 INFO L87 Difference]: Start difference. First operand 156 states and 237 transitions. Second operand 4 states. [2018-11-10 13:32:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:32:58,178 INFO L93 Difference]: Finished difference Result 316 states and 482 transitions. [2018-11-10 13:32:58,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:32:58,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-10 13:32:58,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:32:58,180 INFO L225 Difference]: With dead ends: 316 [2018-11-10 13:32:58,180 INFO L226 Difference]: Without dead ends: 186 [2018-11-10 13:32:58,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:32:58,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-11-10 13:32:58,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 173. [2018-11-10 13:32:58,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-10 13:32:58,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2018-11-10 13:32:58,190 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 63 [2018-11-10 13:32:58,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:32:58,191 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2018-11-10 13:32:58,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:32:58,191 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2018-11-10 13:32:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:32:58,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:58,192 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:32:58,193 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:58,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1797814808, now seen corresponding path program 1 times [2018-11-10 13:32:58,193 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:32:58,193 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:32:58,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:58,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:32:58,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:32:58,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:32:58,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:32:58,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:32:58,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:32:58,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:32:58,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:32:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:32:58,528 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:32:58,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:32:58,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:32:58,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:32:58,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:32:58,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:32:58,536 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand 4 states. [2018-11-10 13:33:01,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:01,130 INFO L93 Difference]: Finished difference Result 432 states and 665 transitions. [2018-11-10 13:33:01,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:01,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-11-10 13:33:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:01,132 INFO L225 Difference]: With dead ends: 432 [2018-11-10 13:33:01,132 INFO L226 Difference]: Without dead ends: 285 [2018-11-10 13:33:01,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-11-10 13:33:01,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 214. [2018-11-10 13:33:01,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-10 13:33:01,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 338 transitions. [2018-11-10 13:33:01,145 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 338 transitions. Word has length 63 [2018-11-10 13:33:01,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:01,145 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 338 transitions. [2018-11-10 13:33:01,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:01,145 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 338 transitions. [2018-11-10 13:33:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-10 13:33:01,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:01,148 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:33:01,148 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:01,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:01,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1657088121, now seen corresponding path program 1 times [2018-11-10 13:33:01,148 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:01,149 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:01,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:01,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:01,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:01,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:01,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:01,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:01,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:01,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:01,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:01,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:33:01,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:33:01,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:01,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:33:01,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:01,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:01,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:01,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:01,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:01,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:01,741 INFO L87 Difference]: Start difference. First operand 214 states and 338 transitions. Second operand 6 states. [2018-11-10 13:33:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:04,233 INFO L93 Difference]: Finished difference Result 417 states and 659 transitions. [2018-11-10 13:33:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:04,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-11-10 13:33:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:04,234 INFO L225 Difference]: With dead ends: 417 [2018-11-10 13:33:04,235 INFO L226 Difference]: Without dead ends: 229 [2018-11-10 13:33:04,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-10 13:33:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 214. [2018-11-10 13:33:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-10 13:33:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 337 transitions. [2018-11-10 13:33:04,241 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 337 transitions. Word has length 63 [2018-11-10 13:33:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:04,242 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 337 transitions. [2018-11-10 13:33:04,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 337 transitions. [2018-11-10 13:33:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:33:04,243 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:04,243 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:33:04,243 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:04,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:04,243 INFO L82 PathProgramCache]: Analyzing trace with hash -724782080, now seen corresponding path program 1 times [2018-11-10 13:33:04,244 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:04,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:04,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:04,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:33:04,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:33:04,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 13:33:04,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:04,836 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:04,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:04,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:04,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:04,865 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:04,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:04,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:04,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:04,887 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:04,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:04,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:04,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:33:04,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:33:04,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:04,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 13:33:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:04,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:04,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:04,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:33:04,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:33:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:33:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:04,932 INFO L87 Difference]: Start difference. First operand 214 states and 337 transitions. Second operand 8 states. [2018-11-10 13:33:05,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:05,902 INFO L93 Difference]: Finished difference Result 411 states and 651 transitions. [2018-11-10 13:33:05,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:33:05,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-11-10 13:33:05,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:05,904 INFO L225 Difference]: With dead ends: 411 [2018-11-10 13:33:05,904 INFO L226 Difference]: Without dead ends: 223 [2018-11-10 13:33:05,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:33:05,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-10 13:33:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-10 13:33:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-10 13:33:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 348 transitions. [2018-11-10 13:33:05,915 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 348 transitions. Word has length 64 [2018-11-10 13:33:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:05,915 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 348 transitions. [2018-11-10 13:33:05,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:33:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 348 transitions. [2018-11-10 13:33:05,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:33:05,916 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:05,916 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:33:05,916 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:05,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1162121364, now seen corresponding path program 1 times [2018-11-10 13:33:05,917 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:05,917 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:05,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:06,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:06,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:06,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:06,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:06,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:06,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:06,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:06,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:06,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:06,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:06,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:06,525 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:06,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:06,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:06,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:06,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:06,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:06,528 INFO L87 Difference]: Start difference. First operand 223 states and 348 transitions. Second operand 6 states. [2018-11-10 13:33:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:09,119 INFO L93 Difference]: Finished difference Result 444 states and 691 transitions. [2018-11-10 13:33:09,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:09,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-10 13:33:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:09,120 INFO L225 Difference]: With dead ends: 444 [2018-11-10 13:33:09,120 INFO L226 Difference]: Without dead ends: 247 [2018-11-10 13:33:09,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-10 13:33:09,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 223. [2018-11-10 13:33:09,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-10 13:33:09,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 347 transitions. [2018-11-10 13:33:09,129 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 347 transitions. Word has length 64 [2018-11-10 13:33:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:09,129 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 347 transitions. [2018-11-10 13:33:09,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 347 transitions. [2018-11-10 13:33:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 13:33:09,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:09,130 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:09,130 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:09,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:09,130 INFO L82 PathProgramCache]: Analyzing trace with hash -110069495, now seen corresponding path program 1 times [2018-11-10 13:33:09,130 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:09,130 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:09,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:09,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:09,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:09,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:09,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:09,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:09,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:09,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:09,466 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:09,466 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:09,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:09,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:09,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:09,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:09,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:09,469 INFO L87 Difference]: Start difference. First operand 223 states and 347 transitions. Second operand 4 states. [2018-11-10 13:33:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:12,077 INFO L93 Difference]: Finished difference Result 494 states and 762 transitions. [2018-11-10 13:33:12,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:12,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 13:33:12,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:12,079 INFO L225 Difference]: With dead ends: 494 [2018-11-10 13:33:12,079 INFO L226 Difference]: Without dead ends: 297 [2018-11-10 13:33:12,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-10 13:33:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 224. [2018-11-10 13:33:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-10 13:33:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 348 transitions. [2018-11-10 13:33:12,087 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 348 transitions. Word has length 64 [2018-11-10 13:33:12,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:12,088 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 348 transitions. [2018-11-10 13:33:12,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:12,088 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 348 transitions. [2018-11-10 13:33:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 13:33:12,088 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:12,089 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-11-10 13:33:12,089 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:12,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:12,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1868992772, now seen corresponding path program 1 times [2018-11-10 13:33:12,089 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:12,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:12,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:12,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:12,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:12,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:12,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:12,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:12,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:12,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:12,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:12,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:12,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:12,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:12,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:12,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:12,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:12,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:12,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:12,749 INFO L87 Difference]: Start difference. First operand 224 states and 348 transitions. Second operand 6 states. [2018-11-10 13:33:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:15,507 INFO L93 Difference]: Finished difference Result 446 states and 692 transitions. [2018-11-10 13:33:15,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:15,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-10 13:33:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:15,509 INFO L225 Difference]: With dead ends: 446 [2018-11-10 13:33:15,509 INFO L226 Difference]: Without dead ends: 248 [2018-11-10 13:33:15,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:15,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-11-10 13:33:15,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2018-11-10 13:33:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-10 13:33:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 347 transitions. [2018-11-10 13:33:15,520 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 347 transitions. Word has length 65 [2018-11-10 13:33:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:15,520 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 347 transitions. [2018-11-10 13:33:15,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 347 transitions. [2018-11-10 13:33:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 13:33:15,521 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:15,521 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:15,521 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:15,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1194901862, now seen corresponding path program 1 times [2018-11-10 13:33:15,522 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:15,522 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:15,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:16,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:16,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:33:16,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:33:16,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:16,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:16,124 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:16,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:16,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:16,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:16,158 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:33:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:16,184 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:16,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:16,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:33:16,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:33:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:33:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:33:16,187 INFO L87 Difference]: Start difference. First operand 224 states and 347 transitions. Second operand 7 states. [2018-11-10 13:33:19,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:19,053 INFO L93 Difference]: Finished difference Result 475 states and 739 transitions. [2018-11-10 13:33:19,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:33:19,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2018-11-10 13:33:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:19,054 INFO L225 Difference]: With dead ends: 475 [2018-11-10 13:33:19,054 INFO L226 Difference]: Without dead ends: 277 [2018-11-10 13:33:19,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:33:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-10 13:33:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 247. [2018-11-10 13:33:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 386 transitions. [2018-11-10 13:33:19,064 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 386 transitions. Word has length 66 [2018-11-10 13:33:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:19,064 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 386 transitions. [2018-11-10 13:33:19,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:33:19,064 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 386 transitions. [2018-11-10 13:33:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 13:33:19,065 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:19,065 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:19,065 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash -79487783, now seen corresponding path program 1 times [2018-11-10 13:33:19,066 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:19,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:19,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:19,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:19,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:19,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:19,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:19,645 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:19,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:19,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:19,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:19,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:19,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:19,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:19,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:19,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:19,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:19,687 INFO L87 Difference]: Start difference. First operand 247 states and 386 transitions. Second operand 6 states. [2018-11-10 13:33:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:22,272 INFO L93 Difference]: Finished difference Result 492 states and 769 transitions. [2018-11-10 13:33:22,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:22,272 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-10 13:33:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:22,273 INFO L225 Difference]: With dead ends: 492 [2018-11-10 13:33:22,273 INFO L226 Difference]: Without dead ends: 271 [2018-11-10 13:33:22,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-11-10 13:33:22,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 247. [2018-11-10 13:33:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 385 transitions. [2018-11-10 13:33:22,280 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 385 transitions. Word has length 66 [2018-11-10 13:33:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:22,280 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 385 transitions. [2018-11-10 13:33:22,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 385 transitions. [2018-11-10 13:33:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 13:33:22,281 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:22,281 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:22,281 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:22,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:22,281 INFO L82 PathProgramCache]: Analyzing trace with hash 825354721, now seen corresponding path program 1 times [2018-11-10 13:33:22,282 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:22,282 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:22,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:22,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:22,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:22,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:22,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:22,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:22,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:22,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:22,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:22,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-11-10 13:33:22,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:22,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:22,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:22,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:22,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:22,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:22,999 INFO L87 Difference]: Start difference. First operand 247 states and 385 transitions. Second operand 6 states. [2018-11-10 13:33:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:25,571 INFO L93 Difference]: Finished difference Result 482 states and 755 transitions. [2018-11-10 13:33:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:25,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-10 13:33:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:25,572 INFO L225 Difference]: With dead ends: 482 [2018-11-10 13:33:25,572 INFO L226 Difference]: Without dead ends: 261 [2018-11-10 13:33:25,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-11-10 13:33:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 247. [2018-11-10 13:33:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 384 transitions. [2018-11-10 13:33:25,579 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 384 transitions. Word has length 67 [2018-11-10 13:33:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:25,579 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 384 transitions. [2018-11-10 13:33:25,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:25,579 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 384 transitions. [2018-11-10 13:33:25,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 13:33:25,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:25,580 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:25,580 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:25,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:25,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1664016090, now seen corresponding path program 1 times [2018-11-10 13:33:25,581 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:25,581 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:25,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:26,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:26,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:26,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:26,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:33:26,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:33:26,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:26,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:26,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:33:26,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:26,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:26,321 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:26,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:33:26,338 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:26,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:26,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:33:26,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:33:26,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:33:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:33:26,342 INFO L87 Difference]: Start difference. First operand 247 states and 384 transitions. Second operand 6 states. [2018-11-10 13:33:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:28,954 INFO L93 Difference]: Finished difference Result 472 states and 742 transitions. [2018-11-10 13:33:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:33:28,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 77 [2018-11-10 13:33:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:28,956 INFO L225 Difference]: With dead ends: 472 [2018-11-10 13:33:28,956 INFO L226 Difference]: Without dead ends: 251 [2018-11-10 13:33:28,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:33:28,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-10 13:33:28,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 247. [2018-11-10 13:33:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:28,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 383 transitions. [2018-11-10 13:33:28,970 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 383 transitions. Word has length 77 [2018-11-10 13:33:28,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:28,970 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 383 transitions. [2018-11-10 13:33:28,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:33:28,970 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 383 transitions. [2018-11-10 13:33:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-10 13:33:28,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:28,973 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:28,973 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:28,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:28,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1049253466, now seen corresponding path program 1 times [2018-11-10 13:33:28,973 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:28,973 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:28,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:29,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:29,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:29,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 10 treesize of output 9 [2018-11-10 13:33:29,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:29,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:29,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:29,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:29,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:29,508 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:29,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:29,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:29,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:29,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:29,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:29,512 INFO L87 Difference]: Start difference. First operand 247 states and 383 transitions. Second operand 4 states. [2018-11-10 13:33:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:32,096 INFO L93 Difference]: Finished difference Result 541 states and 836 transitions. [2018-11-10 13:33:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:32,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2018-11-10 13:33:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:32,097 INFO L225 Difference]: With dead ends: 541 [2018-11-10 13:33:32,097 INFO L226 Difference]: Without dead ends: 320 [2018-11-10 13:33:32,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:32,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-10 13:33:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 247. [2018-11-10 13:33:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 382 transitions. [2018-11-10 13:33:32,107 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 382 transitions. Word has length 77 [2018-11-10 13:33:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:32,107 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 382 transitions. [2018-11-10 13:33:32,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 382 transitions. [2018-11-10 13:33:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-10 13:33:32,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:32,108 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:33:32,108 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:32,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1133148688, now seen corresponding path program 1 times [2018-11-10 13:33:32,109 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:32,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:32,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:32,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:32,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:32,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:32,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:32,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:32,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:32,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:32,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:32,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:32,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:32,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:32,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:32,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:32,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:32,490 INFO L87 Difference]: Start difference. First operand 247 states and 382 transitions. Second operand 4 states. [2018-11-10 13:33:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:35,077 INFO L93 Difference]: Finished difference Result 539 states and 832 transitions. [2018-11-10 13:33:35,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:35,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-11-10 13:33:35,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:35,079 INFO L225 Difference]: With dead ends: 539 [2018-11-10 13:33:35,079 INFO L226 Difference]: Without dead ends: 318 [2018-11-10 13:33:35,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-10 13:33:35,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 247. [2018-11-10 13:33:35,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 381 transitions. [2018-11-10 13:33:35,091 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 381 transitions. Word has length 78 [2018-11-10 13:33:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:35,091 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 381 transitions. [2018-11-10 13:33:35,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 381 transitions. [2018-11-10 13:33:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 13:33:35,092 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:35,092 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:35,092 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:35,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 2099868125, now seen corresponding path program 1 times [2018-11-10 13:33:35,093 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:35,093 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:35,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:35,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:35,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:35,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:35,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:35,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:35,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:35,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:35,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:35,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:35,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:35,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:35,483 INFO L87 Difference]: Start difference. First operand 247 states and 381 transitions. Second operand 4 states. [2018-11-10 13:33:38,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:38,063 INFO L93 Difference]: Finished difference Result 539 states and 830 transitions. [2018-11-10 13:33:38,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:38,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-10 13:33:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:38,064 INFO L225 Difference]: With dead ends: 539 [2018-11-10 13:33:38,064 INFO L226 Difference]: Without dead ends: 318 [2018-11-10 13:33:38,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-10 13:33:38,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 247. [2018-11-10 13:33:38,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:38,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 380 transitions. [2018-11-10 13:33:38,071 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 380 transitions. Word has length 79 [2018-11-10 13:33:38,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:38,072 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 380 transitions. [2018-11-10 13:33:38,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 380 transitions. [2018-11-10 13:33:38,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:33:38,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:38,072 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:38,073 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:38,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:38,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1431353043, now seen corresponding path program 1 times [2018-11-10 13:33:38,073 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:38,073 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:38,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:38,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:38,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:38,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:38,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:38,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:38,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:38,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:38,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:38,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:38,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:38,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:38,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:38,486 INFO L87 Difference]: Start difference. First operand 247 states and 380 transitions. Second operand 4 states. [2018-11-10 13:33:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:41,067 INFO L93 Difference]: Finished difference Result 539 states and 828 transitions. [2018-11-10 13:33:41,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:41,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 13:33:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:41,068 INFO L225 Difference]: With dead ends: 539 [2018-11-10 13:33:41,068 INFO L226 Difference]: Without dead ends: 318 [2018-11-10 13:33:41,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:41,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-11-10 13:33:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 247. [2018-11-10 13:33:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-10 13:33:41,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 379 transitions. [2018-11-10 13:33:41,077 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 379 transitions. Word has length 80 [2018-11-10 13:33:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:41,077 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 379 transitions. [2018-11-10 13:33:41,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 379 transitions. [2018-11-10 13:33:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 13:33:41,078 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:41,078 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:41,078 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:41,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:41,078 INFO L82 PathProgramCache]: Analyzing trace with hash -26341540, now seen corresponding path program 1 times [2018-11-10 13:33:41,079 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:41,079 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:41,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:41,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:41,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:33:41,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:33:41,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:41,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:41,791 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,797 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,810 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:33:41,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:33:41,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:33:41,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:33:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:41,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:33:41,857 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:33:41,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:41,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:33:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:33:41,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:33:41,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:33:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:33:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:33:41,868 INFO L87 Difference]: Start difference. First operand 247 states and 379 transitions. Second operand 9 states. [2018-11-10 13:33:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:45,076 INFO L93 Difference]: Finished difference Result 632 states and 972 transitions. [2018-11-10 13:33:45,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:33:45,077 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 80 [2018-11-10 13:33:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:45,078 INFO L225 Difference]: With dead ends: 632 [2018-11-10 13:33:45,079 INFO L226 Difference]: Without dead ends: 411 [2018-11-10 13:33:45,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:33:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-11-10 13:33:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 264. [2018-11-10 13:33:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-10 13:33:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 405 transitions. [2018-11-10 13:33:45,092 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 405 transitions. Word has length 80 [2018-11-10 13:33:45,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:45,093 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 405 transitions. [2018-11-10 13:33:45,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:33:45,093 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 405 transitions. [2018-11-10 13:33:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 13:33:45,093 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:45,094 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:45,094 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:45,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:45,094 INFO L82 PathProgramCache]: Analyzing trace with hash -847982622, now seen corresponding path program 1 times [2018-11-10 13:33:45,094 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:45,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:45,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:45,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:45,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:45,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:45,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:45,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:45,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:45,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:45,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:45,590 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:45,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:45,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:45,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:45,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:45,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:45,593 INFO L87 Difference]: Start difference. First operand 264 states and 405 transitions. Second operand 4 states. [2018-11-10 13:33:48,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:48,148 INFO L93 Difference]: Finished difference Result 573 states and 878 transitions. [2018-11-10 13:33:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:48,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-10 13:33:48,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:48,150 INFO L225 Difference]: With dead ends: 573 [2018-11-10 13:33:48,150 INFO L226 Difference]: Without dead ends: 335 [2018-11-10 13:33:48,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-11-10 13:33:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 264. [2018-11-10 13:33:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-10 13:33:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 404 transitions. [2018-11-10 13:33:48,164 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 404 transitions. Word has length 81 [2018-11-10 13:33:48,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:48,164 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 404 transitions. [2018-11-10 13:33:48,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:48,164 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 404 transitions. [2018-11-10 13:33:48,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 13:33:48,165 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:48,165 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:48,165 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:48,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:48,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2145525426, now seen corresponding path program 1 times [2018-11-10 13:33:48,166 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:48,166 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:48,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:48,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:48,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:48,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:33:48,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:33:48,858 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:48,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:48,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,880 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:33:48,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:33:48,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:33:48,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:33:48,919 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:48,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:33:48,944 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:33:48,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:48,946 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:33:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:48,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:33:48,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:33:48,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:33:48,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:33:48,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:33:48,958 INFO L87 Difference]: Start difference. First operand 264 states and 404 transitions. Second operand 9 states. [2018-11-10 13:33:54,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:54,239 INFO L93 Difference]: Finished difference Result 647 states and 992 transitions. [2018-11-10 13:33:54,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:33:54,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-11-10 13:33:54,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:54,240 INFO L225 Difference]: With dead ends: 647 [2018-11-10 13:33:54,240 INFO L226 Difference]: Without dead ends: 409 [2018-11-10 13:33:54,241 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:33:54,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-10 13:33:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 265. [2018-11-10 13:33:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:33:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 404 transitions. [2018-11-10 13:33:54,250 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 404 transitions. Word has length 81 [2018-11-10 13:33:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:54,250 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 404 transitions. [2018-11-10 13:33:54,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:33:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 404 transitions. [2018-11-10 13:33:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 13:33:54,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:54,251 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:54,251 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:54,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1523148808, now seen corresponding path program 1 times [2018-11-10 13:33:54,252 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:54,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:54,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:54,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:33:54,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:33:54,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:33:54,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:54,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:54,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:54,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:33:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:54,684 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:54,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:54,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:33:54,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:33:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:33:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:33:54,687 INFO L87 Difference]: Start difference. First operand 265 states and 404 transitions. Second operand 4 states. [2018-11-10 13:33:57,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:33:57,248 INFO L93 Difference]: Finished difference Result 565 states and 863 transitions. [2018-11-10 13:33:57,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:33:57,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-10 13:33:57,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:33:57,249 INFO L225 Difference]: With dead ends: 565 [2018-11-10 13:33:57,249 INFO L226 Difference]: Without dead ends: 326 [2018-11-10 13:33:57,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:33:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-11-10 13:33:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 265. [2018-11-10 13:33:57,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:33:57,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 403 transitions. [2018-11-10 13:33:57,259 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 403 transitions. Word has length 82 [2018-11-10 13:33:57,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:33:57,259 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 403 transitions. [2018-11-10 13:33:57,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:33:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 403 transitions. [2018-11-10 13:33:57,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 13:33:57,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:33:57,259 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:33:57,259 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:33:57,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:33:57,260 INFO L82 PathProgramCache]: Analyzing trace with hash -754781601, now seen corresponding path program 1 times [2018-11-10 13:33:57,260 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:33:57,260 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:33:57,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:33:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:33:57,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:33:57,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:33:57,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:33:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:33:57,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:33:57,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:57,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:57,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:57,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:57,997 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:33:58,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:33:58,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:33:58,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:33:58,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:58,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:33:58,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:33:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:33:58,024 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:33:58,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:33:58,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:33:58,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:33:58,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:33:58,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:33:58,029 INFO L87 Difference]: Start difference. First operand 265 states and 403 transitions. Second operand 7 states. [2018-11-10 13:34:00,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:00,780 INFO L93 Difference]: Finished difference Result 532 states and 812 transitions. [2018-11-10 13:34:00,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:00,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-11-10 13:34:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:00,781 INFO L225 Difference]: With dead ends: 532 [2018-11-10 13:34:00,781 INFO L226 Difference]: Without dead ends: 293 [2018-11-10 13:34:00,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:00,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-10 13:34:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 265. [2018-11-10 13:34:00,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:34:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 402 transitions. [2018-11-10 13:34:00,797 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 402 transitions. Word has length 82 [2018-11-10 13:34:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:00,797 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 402 transitions. [2018-11-10 13:34:00,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 402 transitions. [2018-11-10 13:34:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 13:34:00,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:00,798 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:00,798 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:00,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1163442543, now seen corresponding path program 1 times [2018-11-10 13:34:00,799 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:00,799 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:00,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:01,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:01,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:34:01,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:34:01,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:01,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:01,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,551 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,564 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:34:01,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:01,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:01,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:01,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:34:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:01,595 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:01,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:01,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:01,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:01,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:01,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:01,599 INFO L87 Difference]: Start difference. First operand 265 states and 402 transitions. Second operand 7 states. [2018-11-10 13:34:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:04,420 INFO L93 Difference]: Finished difference Result 532 states and 810 transitions. [2018-11-10 13:34:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:04,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-11-10 13:34:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:04,421 INFO L225 Difference]: With dead ends: 532 [2018-11-10 13:34:04,421 INFO L226 Difference]: Without dead ends: 293 [2018-11-10 13:34:04,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:04,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-10 13:34:04,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 265. [2018-11-10 13:34:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:34:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 401 transitions. [2018-11-10 13:34:04,437 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 401 transitions. Word has length 83 [2018-11-10 13:34:04,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:04,437 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 401 transitions. [2018-11-10 13:34:04,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:04,437 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 401 transitions. [2018-11-10 13:34:04,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 13:34:04,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:04,438 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:04,438 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:04,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:04,439 INFO L82 PathProgramCache]: Analyzing trace with hash 317732836, now seen corresponding path program 1 times [2018-11-10 13:34:04,439 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:04,439 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:04,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:05,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:05,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:34:05,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:34:05,166 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:05,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:05,168 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,176 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,192 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:34:05,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:05,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:05,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:05,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:34:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:05,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:05,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:05,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:05,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:05,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:05,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:05,232 INFO L87 Difference]: Start difference. First operand 265 states and 401 transitions. Second operand 7 states. [2018-11-10 13:34:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:05,970 INFO L93 Difference]: Finished difference Result 532 states and 808 transitions. [2018-11-10 13:34:05,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:05,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-11-10 13:34:05,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:05,971 INFO L225 Difference]: With dead ends: 532 [2018-11-10 13:34:05,971 INFO L226 Difference]: Without dead ends: 293 [2018-11-10 13:34:05,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-11-10 13:34:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 265. [2018-11-10 13:34:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:34:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 400 transitions. [2018-11-10 13:34:05,986 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 400 transitions. Word has length 84 [2018-11-10 13:34:05,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:05,986 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 400 transitions. [2018-11-10 13:34:05,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:05,987 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 400 transitions. [2018-11-10 13:34:05,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 13:34:05,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:05,987 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:05,988 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:05,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash 254292022, now seen corresponding path program 1 times [2018-11-10 13:34:05,988 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:05,988 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:06,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:06,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:06,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:34:06,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:34:06,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:06,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:06,754 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,763 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:34:06,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:06,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:06,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:06,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:34:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:06,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:06,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:06,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:06,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:06,800 INFO L87 Difference]: Start difference. First operand 265 states and 400 transitions. Second operand 7 states. [2018-11-10 13:34:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:09,554 INFO L93 Difference]: Finished difference Result 522 states and 793 transitions. [2018-11-10 13:34:09,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:09,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-10 13:34:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:09,555 INFO L225 Difference]: With dead ends: 522 [2018-11-10 13:34:09,555 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 13:34:09,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:09,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 13:34:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 265. [2018-11-10 13:34:09,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-11-10 13:34:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 399 transitions. [2018-11-10 13:34:09,564 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 399 transitions. Word has length 85 [2018-11-10 13:34:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:09,564 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 399 transitions. [2018-11-10 13:34:09,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:09,564 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 399 transitions. [2018-11-10 13:34:09,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:34:09,564 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:09,565 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:09,565 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:09,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:09,565 INFO L82 PathProgramCache]: Analyzing trace with hash -899314976, now seen corresponding path program 1 times [2018-11-10 13:34:09,565 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:09,565 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:09,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:09,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 13:34:09,694 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:09,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:09,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:34:09,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:34:09,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:34:09,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:34:09,696 INFO L87 Difference]: Start difference. First operand 265 states and 399 transitions. Second operand 3 states. [2018-11-10 13:34:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:09,736 INFO L93 Difference]: Finished difference Result 715 states and 1098 transitions. [2018-11-10 13:34:09,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:34:09,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-11-10 13:34:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:09,737 INFO L225 Difference]: With dead ends: 715 [2018-11-10 13:34:09,737 INFO L226 Difference]: Without dead ends: 476 [2018-11-10 13:34:09,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:34:09,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-11-10 13:34:09,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2018-11-10 13:34:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:09,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 716 transitions. [2018-11-10 13:34:09,754 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 716 transitions. Word has length 86 [2018-11-10 13:34:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:09,754 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 716 transitions. [2018-11-10 13:34:09,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:34:09,754 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 716 transitions. [2018-11-10 13:34:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:34:09,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:09,755 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:09,755 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:09,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash -651168482, now seen corresponding path program 1 times [2018-11-10 13:34:09,756 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:09,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 28 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 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:09,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:10,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:10,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:10,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:10,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:10,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:10,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:10,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:10,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:10,170 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:10,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:10,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:10,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:10,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:10,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:10,173 INFO L87 Difference]: Start difference. First operand 474 states and 716 transitions. Second operand 4 states. [2018-11-10 13:34:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:12,757 INFO L93 Difference]: Finished difference Result 1043 states and 1562 transitions. [2018-11-10 13:34:12,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:12,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-10 13:34:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:12,759 INFO L225 Difference]: With dead ends: 1043 [2018-11-10 13:34:12,759 INFO L226 Difference]: Without dead ends: 595 [2018-11-10 13:34:12,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-11-10 13:34:12,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 474. [2018-11-10 13:34:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 714 transitions. [2018-11-10 13:34:12,786 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 714 transitions. Word has length 86 [2018-11-10 13:34:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:12,786 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 714 transitions. [2018-11-10 13:34:12,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:12,786 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 714 transitions. [2018-11-10 13:34:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 13:34:12,787 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:12,787 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:12,787 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:12,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:12,787 INFO L82 PathProgramCache]: Analyzing trace with hash -947378094, now seen corresponding path program 1 times [2018-11-10 13:34:12,788 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:12,788 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 29 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 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:12,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:13,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:13,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:13,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:13,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:13,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:13,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:13,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:13,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:13,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:13,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:13,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:13,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:13,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:13,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:13,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:13,212 INFO L87 Difference]: Start difference. First operand 474 states and 714 transitions. Second operand 4 states. [2018-11-10 13:34:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:15,794 INFO L93 Difference]: Finished difference Result 1043 states and 1558 transitions. [2018-11-10 13:34:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:15,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 86 [2018-11-10 13:34:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:15,797 INFO L225 Difference]: With dead ends: 1043 [2018-11-10 13:34:15,797 INFO L226 Difference]: Without dead ends: 595 [2018-11-10 13:34:15,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-11-10 13:34:15,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 474. [2018-11-10 13:34:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 712 transitions. [2018-11-10 13:34:15,836 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 712 transitions. Word has length 86 [2018-11-10 13:34:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:15,836 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 712 transitions. [2018-11-10 13:34:15,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 712 transitions. [2018-11-10 13:34:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 13:34:15,837 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:15,837 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:34:15,837 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:15,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:15,837 INFO L82 PathProgramCache]: Analyzing trace with hash 134031432, now seen corresponding path program 1 times [2018-11-10 13:34:15,837 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:15,837 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 30 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 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:15,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:16,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:16,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:16,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:16,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:16,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:16,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:16,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:16,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:16,272 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:16,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:16,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:16,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:16,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:16,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:16,276 INFO L87 Difference]: Start difference. First operand 474 states and 712 transitions. Second operand 4 states. [2018-11-10 13:34:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:18,849 INFO L93 Difference]: Finished difference Result 1035 states and 1543 transitions. [2018-11-10 13:34:18,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:18,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-10 13:34:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:18,850 INFO L225 Difference]: With dead ends: 1035 [2018-11-10 13:34:18,850 INFO L226 Difference]: Without dead ends: 587 [2018-11-10 13:34:18,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-10 13:34:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 474. [2018-11-10 13:34:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:18,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 710 transitions. [2018-11-10 13:34:18,874 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 710 transitions. Word has length 87 [2018-11-10 13:34:18,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:18,874 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 710 transitions. [2018-11-10 13:34:18,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:18,874 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 710 transitions. [2018-11-10 13:34:18,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 13:34:18,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:18,875 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:18,876 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:18,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1785295140, now seen corresponding path program 1 times [2018-11-10 13:34:18,876 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:18,876 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 31 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 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:18,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:19,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:19,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:19,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:19,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:19,289 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:19,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:19,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:19,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:19,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:19,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:19,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:19,308 INFO L87 Difference]: Start difference. First operand 474 states and 710 transitions. Second operand 4 states. [2018-11-10 13:34:21,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:21,873 INFO L93 Difference]: Finished difference Result 1025 states and 1526 transitions. [2018-11-10 13:34:21,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:21,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-11-10 13:34:21,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:21,874 INFO L225 Difference]: With dead ends: 1025 [2018-11-10 13:34:21,874 INFO L226 Difference]: Without dead ends: 577 [2018-11-10 13:34:21,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-11-10 13:34:21,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 474. [2018-11-10 13:34:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 708 transitions. [2018-11-10 13:34:21,892 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 708 transitions. Word has length 87 [2018-11-10 13:34:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:21,893 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 708 transitions. [2018-11-10 13:34:21,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:21,893 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 708 transitions. [2018-11-10 13:34:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:34:21,893 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:21,893 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-10 13:34:21,893 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:21,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1458622243, now seen corresponding path program 1 times [2018-11-10 13:34:21,894 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:21,894 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 32 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 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:21,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:22,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:22,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:22,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:22,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:22,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 19 treesize of output 15 [2018-11-10 13:34:22,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:22,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:22,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:22,317 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:22,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:22,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:22,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:22,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:22,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:22,321 INFO L87 Difference]: Start difference. First operand 474 states and 708 transitions. Second operand 4 states. [2018-11-10 13:34:24,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:24,889 INFO L93 Difference]: Finished difference Result 1025 states and 1522 transitions. [2018-11-10 13:34:24,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:24,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-10 13:34:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:24,891 INFO L225 Difference]: With dead ends: 1025 [2018-11-10 13:34:24,891 INFO L226 Difference]: Without dead ends: 577 [2018-11-10 13:34:24,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-11-10 13:34:24,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 474. [2018-11-10 13:34:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-11-10 13:34:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 706 transitions. [2018-11-10 13:34:24,909 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 706 transitions. Word has length 89 [2018-11-10 13:34:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:24,909 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 706 transitions. [2018-11-10 13:34:24,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 706 transitions. [2018-11-10 13:34:24,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:34:24,909 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:24,909 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:24,909 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:24,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:24,910 INFO L82 PathProgramCache]: Analyzing trace with hash 892654622, now seen corresponding path program 1 times [2018-11-10 13:34:24,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:24,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 33 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 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:24,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:25,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:25,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:25,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:25,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:34:25,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:34:25,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:25,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:25,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:34:25,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:34:25,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:34:25,642 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:25,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:34:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:34:25,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:25,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:25,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:25,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:25,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:25,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:25,659 INFO L87 Difference]: Start difference. First operand 474 states and 706 transitions. Second operand 7 states. [2018-11-10 13:34:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:28,687 INFO L93 Difference]: Finished difference Result 948 states and 1417 transitions. [2018-11-10 13:34:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:28,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-10 13:34:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:28,689 INFO L225 Difference]: With dead ends: 948 [2018-11-10 13:34:28,689 INFO L226 Difference]: Without dead ends: 707 [2018-11-10 13:34:28,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2018-11-10 13:34:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 556. [2018-11-10 13:34:28,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2018-11-10 13:34:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 850 transitions. [2018-11-10 13:34:28,708 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 850 transitions. Word has length 89 [2018-11-10 13:34:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:28,708 INFO L481 AbstractCegarLoop]: Abstraction has 556 states and 850 transitions. [2018-11-10 13:34:28,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:28,708 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 850 transitions. [2018-11-10 13:34:28,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 13:34:28,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:28,709 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, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:28,709 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:28,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:28,709 INFO L82 PathProgramCache]: Analyzing trace with hash -479152676, now seen corresponding path program 1 times [2018-11-10 13:34:28,709 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:28,709 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 34 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 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:28,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:29,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:29,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:29,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:29,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:34:29,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:34:29,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:29,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:29,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:29,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:34:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:34:29,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:29,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:29,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:29,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:29,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:29,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:29,478 INFO L87 Difference]: Start difference. First operand 556 states and 850 transitions. Second operand 7 states. [2018-11-10 13:34:34,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:34,323 INFO L93 Difference]: Finished difference Result 1201 states and 1836 transitions. [2018-11-10 13:34:34,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:34,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 89 [2018-11-10 13:34:34,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:34,326 INFO L225 Difference]: With dead ends: 1201 [2018-11-10 13:34:34,326 INFO L226 Difference]: Without dead ends: 671 [2018-11-10 13:34:34,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-10 13:34:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 606. [2018-11-10 13:34:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 13:34:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 932 transitions. [2018-11-10 13:34:34,349 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 932 transitions. Word has length 89 [2018-11-10 13:34:34,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:34,349 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 932 transitions. [2018-11-10 13:34:34,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:34,349 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 932 transitions. [2018-11-10 13:34:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:34:34,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:34,350 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:34:34,350 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:34,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:34,350 INFO L82 PathProgramCache]: Analyzing trace with hash -740434093, now seen corresponding path program 1 times [2018-11-10 13:34:34,350 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:34,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 35 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 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:34,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:34,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:34,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:34,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:34,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:34,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:34,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:34,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:34,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:34,805 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:34,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:34,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:34,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:34,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:34,809 INFO L87 Difference]: Start difference. First operand 606 states and 932 transitions. Second operand 4 states. [2018-11-10 13:34:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:37,346 INFO L93 Difference]: Finished difference Result 1273 states and 1944 transitions. [2018-11-10 13:34:37,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:37,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-11-10 13:34:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:37,348 INFO L225 Difference]: With dead ends: 1273 [2018-11-10 13:34:37,348 INFO L226 Difference]: Without dead ends: 693 [2018-11-10 13:34:37,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2018-11-10 13:34:37,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 606. [2018-11-10 13:34:37,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 13:34:37,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 930 transitions. [2018-11-10 13:34:37,370 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 930 transitions. Word has length 90 [2018-11-10 13:34:37,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:37,370 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 930 transitions. [2018-11-10 13:34:37,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:37,370 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 930 transitions. [2018-11-10 13:34:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-10 13:34:37,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:37,371 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:37,371 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:37,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1894735811, now seen corresponding path program 1 times [2018-11-10 13:34:37,372 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:37,372 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 36 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 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:37,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:38,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:38,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:38,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:38,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:34:38,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:34:38,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:38,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:38,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:34:38,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:34:38,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:34:38,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:38,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:34:38,154 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:34:38,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:38,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:38,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:38,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:38,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:38,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:38,158 INFO L87 Difference]: Start difference. First operand 606 states and 930 transitions. Second operand 7 states. [2018-11-10 13:34:41,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:41,168 INFO L93 Difference]: Finished difference Result 1056 states and 1598 transitions. [2018-11-10 13:34:41,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:34:41,169 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-11-10 13:34:41,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:41,170 INFO L225 Difference]: With dead ends: 1056 [2018-11-10 13:34:41,170 INFO L226 Difference]: Without dead ends: 749 [2018-11-10 13:34:41,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:34:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-11-10 13:34:41,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 586. [2018-11-10 13:34:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-11-10 13:34:41,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 892 transitions. [2018-11-10 13:34:41,191 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 892 transitions. Word has length 90 [2018-11-10 13:34:41,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:41,191 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 892 transitions. [2018-11-10 13:34:41,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:34:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 892 transitions. [2018-11-10 13:34:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 13:34:41,192 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:41,192 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:34:41,192 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:41,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:41,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1515251677, now seen corresponding path program 1 times [2018-11-10 13:34:41,192 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 37 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 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:41,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:41,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:41,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:41,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:41,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,614 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:41,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:41,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:41,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:41,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:41,636 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:41,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:41,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:41,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:41,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:41,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:41,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:41,639 INFO L87 Difference]: Start difference. First operand 586 states and 892 transitions. Second operand 4 states. [2018-11-10 13:34:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:44,159 INFO L93 Difference]: Finished difference Result 1255 states and 1904 transitions. [2018-11-10 13:34:44,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:44,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-10 13:34:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:44,162 INFO L225 Difference]: With dead ends: 1255 [2018-11-10 13:34:44,162 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 13:34:44,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:44,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 13:34:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 588. [2018-11-10 13:34:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 13:34:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 894 transitions. [2018-11-10 13:34:44,184 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 894 transitions. Word has length 91 [2018-11-10 13:34:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:44,184 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 894 transitions. [2018-11-10 13:34:44,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:44,184 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 894 transitions. [2018-11-10 13:34:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:34:44,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:44,185 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2018-11-10 13:34:44,186 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:44,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1377804675, now seen corresponding path program 1 times [2018-11-10 13:34:44,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:44,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 38 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 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:44,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:44,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:44,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:44,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:44,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:44,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:44,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:44,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:44,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:34:44,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:44,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:44,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:44,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:44,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:44,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:44,664 INFO L87 Difference]: Start difference. First operand 588 states and 894 transitions. Second operand 4 states. [2018-11-10 13:34:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:47,161 INFO L93 Difference]: Finished difference Result 1237 states and 1880 transitions. [2018-11-10 13:34:47,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:47,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 13:34:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:47,163 INFO L225 Difference]: With dead ends: 1237 [2018-11-10 13:34:47,163 INFO L226 Difference]: Without dead ends: 675 [2018-11-10 13:34:47,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:47,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-10 13:34:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 588. [2018-11-10 13:34:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 13:34:47,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 892 transitions. [2018-11-10 13:34:47,185 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 892 transitions. Word has length 92 [2018-11-10 13:34:47,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:47,185 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 892 transitions. [2018-11-10 13:34:47,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:47,185 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 892 transitions. [2018-11-10 13:34:47,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:34:47,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:47,185 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:47,186 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:47,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:47,186 INFO L82 PathProgramCache]: Analyzing trace with hash 756811771, now seen corresponding path program 1 times [2018-11-10 13:34:47,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:47,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 39 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 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:47,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:47,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:47,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:47,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:47,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:47,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:47,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:47,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:47,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:47,626 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:47,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:47,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:47,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:47,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:47,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:47,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:47,630 INFO L87 Difference]: Start difference. First operand 588 states and 892 transitions. Second operand 4 states. [2018-11-10 13:34:50,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:50,129 INFO L93 Difference]: Finished difference Result 1237 states and 1876 transitions. [2018-11-10 13:34:50,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:50,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 13:34:50,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:50,131 INFO L225 Difference]: With dead ends: 1237 [2018-11-10 13:34:50,131 INFO L226 Difference]: Without dead ends: 675 [2018-11-10 13:34:50,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-10 13:34:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 588. [2018-11-10 13:34:50,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2018-11-10 13:34:50,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 890 transitions. [2018-11-10 13:34:50,154 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 890 transitions. Word has length 92 [2018-11-10 13:34:50,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:50,154 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 890 transitions. [2018-11-10 13:34:50,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 890 transitions. [2018-11-10 13:34:50,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 13:34:50,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:50,155 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:34:50,155 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:50,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:50,156 INFO L82 PathProgramCache]: Analyzing trace with hash -263671437, now seen corresponding path program 1 times [2018-11-10 13:34:50,156 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:50,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 40 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 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:50,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:50,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:50,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:50,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:50,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:50,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:50,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:50,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:50,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:50,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:50,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:50,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:50,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:50,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:50,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:50,602 INFO L87 Difference]: Start difference. First operand 588 states and 890 transitions. Second operand 4 states. [2018-11-10 13:34:53,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:53,115 INFO L93 Difference]: Finished difference Result 1233 states and 1868 transitions. [2018-11-10 13:34:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:53,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 13:34:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:53,117 INFO L225 Difference]: With dead ends: 1233 [2018-11-10 13:34:53,117 INFO L226 Difference]: Without dead ends: 671 [2018-11-10 13:34:53,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:53,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-11-10 13:34:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 590. [2018-11-10 13:34:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-10 13:34:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 892 transitions. [2018-11-10 13:34:53,139 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 892 transitions. Word has length 92 [2018-11-10 13:34:53,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:53,139 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 892 transitions. [2018-11-10 13:34:53,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:53,139 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 892 transitions. [2018-11-10 13:34:53,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:34:53,140 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:53,140 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-10 13:34:53,140 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:53,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -484810139, now seen corresponding path program 1 times [2018-11-10 13:34:53,141 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:53,141 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 41 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 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:53,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:53,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:53,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:53,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:53,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:53,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:53,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:53,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:53,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:53,586 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:53,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:53,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:53,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:53,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:53,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:53,590 INFO L87 Difference]: Start difference. First operand 590 states and 892 transitions. Second operand 4 states. [2018-11-10 13:34:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:56,072 INFO L93 Difference]: Finished difference Result 1231 states and 1862 transitions. [2018-11-10 13:34:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:56,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:34:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:56,074 INFO L225 Difference]: With dead ends: 1231 [2018-11-10 13:34:56,074 INFO L226 Difference]: Without dead ends: 667 [2018-11-10 13:34:56,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:56,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2018-11-10 13:34:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 590. [2018-11-10 13:34:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-11-10 13:34:56,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 890 transitions. [2018-11-10 13:34:56,098 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 890 transitions. Word has length 93 [2018-11-10 13:34:56,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:56,098 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 890 transitions. [2018-11-10 13:34:56,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 890 transitions. [2018-11-10 13:34:56,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 13:34:56,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:56,098 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-10 13:34:56,099 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:56,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:56,099 INFO L82 PathProgramCache]: Analyzing trace with hash 2136378847, now seen corresponding path program 1 times [2018-11-10 13:34:56,099 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:56,099 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 42 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 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:56,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:56,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:56,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:34:56,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:34:56,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:34:56,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:34:56,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:34:56,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:56,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:34:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:34:56,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:56,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:56,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:34:56,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:34:56,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:34:56,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:34:56,554 INFO L87 Difference]: Start difference. First operand 590 states and 890 transitions. Second operand 4 states. [2018-11-10 13:34:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:34:59,006 INFO L93 Difference]: Finished difference Result 1225 states and 1850 transitions. [2018-11-10 13:34:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:34:59,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 13:34:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:34:59,008 INFO L225 Difference]: With dead ends: 1225 [2018-11-10 13:34:59,009 INFO L226 Difference]: Without dead ends: 661 [2018-11-10 13:34:59,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:34:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-10 13:34:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 592. [2018-11-10 13:34:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-10 13:34:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 892 transitions. [2018-11-10 13:34:59,033 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 892 transitions. Word has length 93 [2018-11-10 13:34:59,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:34:59,033 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 892 transitions. [2018-11-10 13:34:59,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:34:59,033 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 892 transitions. [2018-11-10 13:34:59,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 13:34:59,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:34:59,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:34:59,034 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:34:59,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:59,034 INFO L82 PathProgramCache]: Analyzing trace with hash -132693701, now seen corresponding path program 1 times [2018-11-10 13:34:59,035 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:34:59,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 43 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 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:34:59,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:59,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:34:59,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:34:59,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:34:59,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:34:59,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:34:59,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:34:59,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-11-10 13:34:59,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-11-10 13:34:59,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:34:59,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:34:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:34:59,964 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:34:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:34:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:34:59,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:34:59,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:34:59,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:34:59,968 INFO L87 Difference]: Start difference. First operand 592 states and 892 transitions. Second operand 7 states. [2018-11-10 13:35:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:02,685 INFO L93 Difference]: Finished difference Result 898 states and 1360 transitions. [2018-11-10 13:35:02,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:02,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2018-11-10 13:35:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:02,686 INFO L225 Difference]: With dead ends: 898 [2018-11-10 13:35:02,686 INFO L226 Difference]: Without dead ends: 600 [2018-11-10 13:35:02,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:02,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-11-10 13:35:02,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 592. [2018-11-10 13:35:02,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-10 13:35:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 891 transitions. [2018-11-10 13:35:02,709 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 891 transitions. Word has length 95 [2018-11-10 13:35:02,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:02,709 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 891 transitions. [2018-11-10 13:35:02,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:02,709 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 891 transitions. [2018-11-10 13:35:02,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-10 13:35:02,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:02,710 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2018-11-10 13:35:02,710 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:02,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:02,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1489858085, now seen corresponding path program 1 times [2018-11-10 13:35:02,710 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:02,711 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 44 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 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:02,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:02,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:03,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:03,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:03,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:03,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:03,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:03,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:03,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:03,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:03,163 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:03,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:03,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:03,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:03,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:03,167 INFO L87 Difference]: Start difference. First operand 592 states and 891 transitions. Second operand 4 states. [2018-11-10 13:35:05,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:05,654 INFO L93 Difference]: Finished difference Result 1227 states and 1848 transitions. [2018-11-10 13:35:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:05,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-11-10 13:35:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:05,657 INFO L225 Difference]: With dead ends: 1227 [2018-11-10 13:35:05,657 INFO L226 Difference]: Without dead ends: 661 [2018-11-10 13:35:05,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2018-11-10 13:35:05,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 594. [2018-11-10 13:35:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-11-10 13:35:05,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 893 transitions. [2018-11-10 13:35:05,681 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 893 transitions. Word has length 96 [2018-11-10 13:35:05,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:05,682 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 893 transitions. [2018-11-10 13:35:05,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 893 transitions. [2018-11-10 13:35:05,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 13:35:05,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:05,683 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2018-11-10 13:35:05,683 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:05,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:05,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2142264106, now seen corresponding path program 1 times [2018-11-10 13:35:05,683 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:05,684 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 45 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 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:06,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:06,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:06,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:06,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:06,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:06,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:06,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:06,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:06,128 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:06,128 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:06,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:06,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:06,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:06,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:06,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:06,132 INFO L87 Difference]: Start difference. First operand 594 states and 893 transitions. Second operand 4 states. [2018-11-10 13:35:08,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:08,588 INFO L93 Difference]: Finished difference Result 1217 states and 1832 transitions. [2018-11-10 13:35:08,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:08,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-10 13:35:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:08,589 INFO L225 Difference]: With dead ends: 1217 [2018-11-10 13:35:08,589 INFO L226 Difference]: Without dead ends: 649 [2018-11-10 13:35:08,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-10 13:35:08,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 596. [2018-11-10 13:35:08,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-11-10 13:35:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 895 transitions. [2018-11-10 13:35:08,613 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 895 transitions. Word has length 97 [2018-11-10 13:35:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:08,613 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 895 transitions. [2018-11-10 13:35:08,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 895 transitions. [2018-11-10 13:35:08,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 13:35:08,613 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:08,614 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2018-11-10 13:35:08,614 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:08,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:08,614 INFO L82 PathProgramCache]: Analyzing trace with hash -72043957, now seen corresponding path program 1 times [2018-11-10 13:35:08,614 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:08,614 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 46 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 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:08,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:09,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:09,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:09,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:09,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,049 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:09,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 19 treesize of output 15 [2018-11-10 13:35:09,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:09,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:09,067 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:09,078 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:09,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:09,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:09,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:09,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:09,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:09,081 INFO L87 Difference]: Start difference. First operand 596 states and 895 transitions. Second operand 4 states. [2018-11-10 13:35:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:11,535 INFO L93 Difference]: Finished difference Result 1219 states and 1832 transitions. [2018-11-10 13:35:11,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:11,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-11-10 13:35:11,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:11,537 INFO L225 Difference]: With dead ends: 1219 [2018-11-10 13:35:11,537 INFO L226 Difference]: Without dead ends: 649 [2018-11-10 13:35:11,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-11-10 13:35:11,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 598. [2018-11-10 13:35:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-10 13:35:11,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 897 transitions. [2018-11-10 13:35:11,566 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 897 transitions. Word has length 97 [2018-11-10 13:35:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:11,566 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 897 transitions. [2018-11-10 13:35:11,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 897 transitions. [2018-11-10 13:35:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 13:35:11,567 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:11,567 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2018-11-10 13:35:11,567 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:11,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash -768522692, now seen corresponding path program 1 times [2018-11-10 13:35:11,567 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:11,567 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 47 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 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:11,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:11,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:11,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:11,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:11,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:12,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:12,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:12,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:12,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:12,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:12,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:12,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:12,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:12,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:12,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:12,026 INFO L87 Difference]: Start difference. First operand 598 states and 897 transitions. Second operand 4 states. [2018-11-10 13:35:14,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:14,499 INFO L93 Difference]: Finished difference Result 1215 states and 1825 transitions. [2018-11-10 13:35:14,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:14,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-10 13:35:14,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:14,501 INFO L225 Difference]: With dead ends: 1215 [2018-11-10 13:35:14,501 INFO L226 Difference]: Without dead ends: 643 [2018-11-10 13:35:14,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-10 13:35:14,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 600. [2018-11-10 13:35:14,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 13:35:14,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 899 transitions. [2018-11-10 13:35:14,548 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 899 transitions. Word has length 98 [2018-11-10 13:35:14,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:14,549 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 899 transitions. [2018-11-10 13:35:14,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:14,549 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 899 transitions. [2018-11-10 13:35:14,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 13:35:14,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:14,549 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:14,549 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:14,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1242221901, now seen corresponding path program 1 times [2018-11-10 13:35:14,550 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:14,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 48 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 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:15,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:15,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:15,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 10 treesize of output 9 [2018-11-10 13:35:15,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:15,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:15,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:15,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:15,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:15,057 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:15,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:15,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:15,060 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:15,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:15,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:15,061 INFO L87 Difference]: Start difference. First operand 600 states and 899 transitions. Second operand 4 states. [2018-11-10 13:35:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:17,509 INFO L93 Difference]: Finished difference Result 1217 states and 1825 transitions. [2018-11-10 13:35:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:17,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 13:35:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:17,510 INFO L225 Difference]: With dead ends: 1217 [2018-11-10 13:35:17,510 INFO L226 Difference]: Without dead ends: 643 [2018-11-10 13:35:17,511 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2018-11-10 13:35:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 602. [2018-11-10 13:35:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 13:35:17,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions. [2018-11-10 13:35:17,535 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 99 [2018-11-10 13:35:17,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:17,535 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions. [2018-11-10 13:35:17,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:17,535 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions. [2018-11-10 13:35:17,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 13:35:17,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:17,536 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:17,536 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:17,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2128462276, now seen corresponding path program 1 times [2018-11-10 13:35:17,536 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:17,536 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 49 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 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:17,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:17,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:17,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:17,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:17,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:17,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:17,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:17,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:17,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:18,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:18,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:18,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:18,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:18,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:18,014 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:18,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:18,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:18,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:18,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:18,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:18,017 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand 4 states. [2018-11-10 13:35:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:20,475 INFO L93 Difference]: Finished difference Result 1213 states and 1818 transitions. [2018-11-10 13:35:20,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:20,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 13:35:20,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:20,477 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 13:35:20,477 INFO L226 Difference]: Without dead ends: 637 [2018-11-10 13:35:20,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:20,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-10 13:35:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 604. [2018-11-10 13:35:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-10 13:35:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 903 transitions. [2018-11-10 13:35:20,501 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 903 transitions. Word has length 100 [2018-11-10 13:35:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:20,501 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 903 transitions. [2018-11-10 13:35:20,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 903 transitions. [2018-11-10 13:35:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:35:20,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:20,502 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:20,502 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:20,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1017782158, now seen corresponding path program 1 times [2018-11-10 13:35:20,502 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:20,503 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 50 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 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:20,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:20,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:20,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:20,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:20,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:20,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:20,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:20,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:20,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:20,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:20,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:21,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:21,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:21,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:21,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:21,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:21,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:21,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:21,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:21,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:21,014 INFO L87 Difference]: Start difference. First operand 604 states and 903 transitions. Second operand 4 states. [2018-11-10 13:35:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:23,476 INFO L93 Difference]: Finished difference Result 1215 states and 1818 transitions. [2018-11-10 13:35:23,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:23,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-11-10 13:35:23,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:23,477 INFO L225 Difference]: With dead ends: 1215 [2018-11-10 13:35:23,477 INFO L226 Difference]: Without dead ends: 637 [2018-11-10 13:35:23,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:23,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-11-10 13:35:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 610. [2018-11-10 13:35:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 13:35:23,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 909 transitions. [2018-11-10 13:35:23,502 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 909 transitions. Word has length 105 [2018-11-10 13:35:23,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:23,502 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 909 transitions. [2018-11-10 13:35:23,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:23,502 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 909 transitions. [2018-11-10 13:35:23,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:35:23,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:23,502 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:23,502 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:23,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1262288867, now seen corresponding path program 1 times [2018-11-10 13:35:23,503 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:23,503 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 51 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 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:23,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:24,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:24,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:24,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:24,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:24,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:24,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:24,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:24,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:24,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:24,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:24,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:24,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:24,473 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:24,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:24,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:24,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:24,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:24,478 INFO L87 Difference]: Start difference. First operand 610 states and 909 transitions. Second operand 7 states. [2018-11-10 13:35:25,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:25,346 INFO L93 Difference]: Finished difference Result 1335 states and 1974 transitions. [2018-11-10 13:35:25,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:25,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-10 13:35:25,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:25,348 INFO L225 Difference]: With dead ends: 1335 [2018-11-10 13:35:25,348 INFO L226 Difference]: Without dead ends: 751 [2018-11-10 13:35:25,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:25,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2018-11-10 13:35:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 610. [2018-11-10 13:35:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 13:35:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 907 transitions. [2018-11-10 13:35:25,372 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 907 transitions. Word has length 105 [2018-11-10 13:35:25,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:25,372 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 907 transitions. [2018-11-10 13:35:25,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:25,372 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 907 transitions. [2018-11-10 13:35:25,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-10 13:35:25,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:25,373 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:25,373 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:25,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:25,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1302963617, now seen corresponding path program 1 times [2018-11-10 13:35:25,374 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:25,374 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 52 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 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:25,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:26,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:26,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:26,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:26,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:26,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:26,330 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:26,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:26,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:26,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:26,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:26,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:26,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:26,377 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:26,377 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:26,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:26,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:26,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:26,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:26,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:26,381 INFO L87 Difference]: Start difference. First operand 610 states and 907 transitions. Second operand 7 states. [2018-11-10 13:35:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:29,202 INFO L93 Difference]: Finished difference Result 1259 states and 1866 transitions. [2018-11-10 13:35:29,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:29,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-10 13:35:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:29,205 INFO L225 Difference]: With dead ends: 1259 [2018-11-10 13:35:29,205 INFO L226 Difference]: Without dead ends: 675 [2018-11-10 13:35:29,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-10 13:35:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 610. [2018-11-10 13:35:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 13:35:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 905 transitions. [2018-11-10 13:35:29,235 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 905 transitions. Word has length 105 [2018-11-10 13:35:29,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:29,235 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 905 transitions. [2018-11-10 13:35:29,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 905 transitions. [2018-11-10 13:35:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:35:29,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:29,236 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:29,236 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:29,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:29,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1804616545, now seen corresponding path program 1 times [2018-11-10 13:35:29,237 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:29,237 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 53 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 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:29,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:29,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:29,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:29,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:29,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:29,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:29,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:29,728 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:29,741 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:29,741 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:29,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:29,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:29,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:29,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:29,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:29,745 INFO L87 Difference]: Start difference. First operand 610 states and 905 transitions. Second operand 4 states. [2018-11-10 13:35:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:32,179 INFO L93 Difference]: Finished difference Result 1213 states and 1805 transitions. [2018-11-10 13:35:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:32,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2018-11-10 13:35:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:32,180 INFO L225 Difference]: With dead ends: 1213 [2018-11-10 13:35:32,180 INFO L226 Difference]: Without dead ends: 629 [2018-11-10 13:35:32,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:32,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-10 13:35:32,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 612. [2018-11-10 13:35:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 13:35:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 907 transitions. [2018-11-10 13:35:32,206 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 907 transitions. Word has length 106 [2018-11-10 13:35:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:32,206 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 907 transitions. [2018-11-10 13:35:32,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 907 transitions. [2018-11-10 13:35:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:35:32,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:32,206 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:32,206 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1236199821, now seen corresponding path program 1 times [2018-11-10 13:35:32,207 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 54 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 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:32,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:33,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:33,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:33,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:33,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:33,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:33,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:33,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:33,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:33,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:33,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:33,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:33,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:33,179 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:33,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:33,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:33,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:33,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:33,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:33,183 INFO L87 Difference]: Start difference. First operand 612 states and 907 transitions. Second operand 7 states. [2018-11-10 13:35:34,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:34,072 INFO L93 Difference]: Finished difference Result 1339 states and 1970 transitions. [2018-11-10 13:35:34,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:34,072 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-10 13:35:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:34,074 INFO L225 Difference]: With dead ends: 1339 [2018-11-10 13:35:34,074 INFO L226 Difference]: Without dead ends: 753 [2018-11-10 13:35:34,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-10 13:35:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 612. [2018-11-10 13:35:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 13:35:34,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 905 transitions. [2018-11-10 13:35:34,100 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 905 transitions. Word has length 106 [2018-11-10 13:35:34,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:34,100 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 905 transitions. [2018-11-10 13:35:34,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:34,100 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 905 transitions. [2018-11-10 13:35:34,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-10 13:35:34,101 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:34,101 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:34,101 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:34,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:34,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1797850225, now seen corresponding path program 1 times [2018-11-10 13:35:34,101 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:34,101 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 55 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 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:34,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:35,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:35,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:35,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:35,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:35,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:35,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:35,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:35,043 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:35,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:35,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 15 treesize of output 3 [2018-11-10 13:35:35,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:35,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:35,075 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:35,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:35,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:35,080 INFO L87 Difference]: Start difference. First operand 612 states and 905 transitions. Second operand 7 states. [2018-11-10 13:35:37,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:37,892 INFO L93 Difference]: Finished difference Result 1263 states and 1862 transitions. [2018-11-10 13:35:37,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:37,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-11-10 13:35:37,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:37,894 INFO L225 Difference]: With dead ends: 1263 [2018-11-10 13:35:37,894 INFO L226 Difference]: Without dead ends: 677 [2018-11-10 13:35:37,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:37,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-11-10 13:35:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 612. [2018-11-10 13:35:37,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 13:35:37,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 903 transitions. [2018-11-10 13:35:37,924 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 903 transitions. Word has length 106 [2018-11-10 13:35:37,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:37,924 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 903 transitions. [2018-11-10 13:35:37,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 903 transitions. [2018-11-10 13:35:37,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:35:37,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:37,924 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:37,925 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:37,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:37,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1333830944, now seen corresponding path program 1 times [2018-11-10 13:35:37,925 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:37,925 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 56 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 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:38,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:38,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:38,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:38,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:38,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:38,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:38,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:38,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:38,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:38,471 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:38,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:38,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:38,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:38,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:38,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:38,475 INFO L87 Difference]: Start difference. First operand 612 states and 903 transitions. Second operand 4 states. [2018-11-10 13:35:40,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:40,944 INFO L93 Difference]: Finished difference Result 1215 states and 1797 transitions. [2018-11-10 13:35:40,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:40,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-11-10 13:35:40,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:40,946 INFO L225 Difference]: With dead ends: 1215 [2018-11-10 13:35:40,946 INFO L226 Difference]: Without dead ends: 629 [2018-11-10 13:35:40,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:40,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-11-10 13:35:40,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 614. [2018-11-10 13:35:40,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 13:35:40,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 905 transitions. [2018-11-10 13:35:40,984 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 905 transitions. Word has length 107 [2018-11-10 13:35:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:40,984 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 905 transitions. [2018-11-10 13:35:40,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 905 transitions. [2018-11-10 13:35:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:35:40,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:40,985 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:40,985 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:40,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1692202088, now seen corresponding path program 1 times [2018-11-10 13:35:40,986 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:40,986 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 57 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 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:41,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:42,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:42,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:42,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:42,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:42,045 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:42,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:42,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35: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 19 treesize of output 15 [2018-11-10 13:35:42,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:42,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:42,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35: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-11-10 13:35:42,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:42,091 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:42,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:42,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:42,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:42,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:42,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:42,096 INFO L87 Difference]: Start difference. First operand 614 states and 905 transitions. Second operand 7 states. [2018-11-10 13:35:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:45,360 INFO L93 Difference]: Finished difference Result 1343 states and 1966 transitions. [2018-11-10 13:35:45,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:45,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 13:35:45,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:45,362 INFO L225 Difference]: With dead ends: 1343 [2018-11-10 13:35:45,362 INFO L226 Difference]: Without dead ends: 755 [2018-11-10 13:35:45,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:45,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2018-11-10 13:35:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 614. [2018-11-10 13:35:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 13:35:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 903 transitions. [2018-11-10 13:35:45,396 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 903 transitions. Word has length 107 [2018-11-10 13:35:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:45,396 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 903 transitions. [2018-11-10 13:35:45,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 903 transitions. [2018-11-10 13:35:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 13:35:45,397 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:45,397 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:45,397 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:45,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2125931174, now seen corresponding path program 1 times [2018-11-10 13:35:45,398 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:45,398 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 58 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 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:45,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:46,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:46,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:46,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:46,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:46,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:46,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:46,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:46,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:46,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:46,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:46,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:46,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:46,748 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:46,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:46,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:46,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:46,753 INFO L87 Difference]: Start difference. First operand 614 states and 903 transitions. Second operand 7 states. [2018-11-10 13:35:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:47,888 INFO L93 Difference]: Finished difference Result 1267 states and 1858 transitions. [2018-11-10 13:35:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:47,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 13:35:47,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:47,890 INFO L225 Difference]: With dead ends: 1267 [2018-11-10 13:35:47,890 INFO L226 Difference]: Without dead ends: 679 [2018-11-10 13:35:47,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:47,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-11-10 13:35:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 614. [2018-11-10 13:35:47,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 13:35:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 901 transitions. [2018-11-10 13:35:47,925 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 901 transitions. Word has length 107 [2018-11-10 13:35:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:47,925 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 901 transitions. [2018-11-10 13:35:47,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 901 transitions. [2018-11-10 13:35:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:35:47,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:47,926 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 13:35:47,926 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:47,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:47,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1609228975, now seen corresponding path program 1 times [2018-11-10 13:35:47,927 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:47,927 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 59 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 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:47,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:48,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:48,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:48,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:48,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:35:48,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:48,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:48,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:48,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:35:48,631 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:48,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:48,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:48,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:35:48,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:35:48,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:35:48,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:35:48,635 INFO L87 Difference]: Start difference. First operand 614 states and 901 transitions. Second operand 4 states. [2018-11-10 13:35:51,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:51,237 INFO L93 Difference]: Finished difference Result 979 states and 1428 transitions. [2018-11-10 13:35:51,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:35:51,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-11-10 13:35:51,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:51,239 INFO L225 Difference]: With dead ends: 979 [2018-11-10 13:35:51,239 INFO L226 Difference]: Without dead ends: 345 [2018-11-10 13:35:51,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:35:51,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-10 13:35:51,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 338. [2018-11-10 13:35:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 13:35:51,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 501 transitions. [2018-11-10 13:35:51,260 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 501 transitions. Word has length 108 [2018-11-10 13:35:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:51,260 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 501 transitions. [2018-11-10 13:35:51,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:35:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 501 transitions. [2018-11-10 13:35:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:35:51,261 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:51,261 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:51,261 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:51,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:51,261 INFO L82 PathProgramCache]: Analyzing trace with hash -86834126, now seen corresponding path program 1 times [2018-11-10 13:35:51,261 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:51,262 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 60 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 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:51,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:52,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:52,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:52,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:52,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:52,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:52,507 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:52,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:52,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:52,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:52,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:52,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:52,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:52,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:52,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:52,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:52,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:52,556 INFO L87 Difference]: Start difference. First operand 338 states and 501 transitions. Second operand 7 states. [2018-11-10 13:35:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:53,650 INFO L93 Difference]: Finished difference Result 686 states and 1024 transitions. [2018-11-10 13:35:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:53,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 13:35:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:53,651 INFO L225 Difference]: With dead ends: 686 [2018-11-10 13:35:53,652 INFO L226 Difference]: Without dead ends: 399 [2018-11-10 13:35:53,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-10 13:35:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 338. [2018-11-10 13:35:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 13:35:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 500 transitions. [2018-11-10 13:35:53,673 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 500 transitions. Word has length 108 [2018-11-10 13:35:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:53,673 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 500 transitions. [2018-11-10 13:35:53,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 500 transitions. [2018-11-10 13:35:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 13:35:53,674 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:53,674 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:35:53,674 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:53,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:53,674 INFO L82 PathProgramCache]: Analyzing trace with hash 473865652, now seen corresponding path program 1 times [2018-11-10 13:35:53,675 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:53,675 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 61 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 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:53,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:54,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:54,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:54,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:54,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,759 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:54,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:54,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:54,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:54,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:54,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:35:54,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:35:54,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:54,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:35:54,825 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:54,825 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:54,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:54,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:54,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:54,831 INFO L87 Difference]: Start difference. First operand 338 states and 500 transitions. Second operand 7 states. [2018-11-10 13:35:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:35:57,648 INFO L93 Difference]: Finished difference Result 648 states and 967 transitions. [2018-11-10 13:35:57,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:35:57,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 13:35:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:35:57,650 INFO L225 Difference]: With dead ends: 648 [2018-11-10 13:35:57,650 INFO L226 Difference]: Without dead ends: 361 [2018-11-10 13:35:57,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:35:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-10 13:35:57,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 338. [2018-11-10 13:35:57,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 13:35:57,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 499 transitions. [2018-11-10 13:35:57,669 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 499 transitions. Word has length 108 [2018-11-10 13:35:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:35:57,669 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 499 transitions. [2018-11-10 13:35:57,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:35:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 499 transitions. [2018-11-10 13:35:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:35:57,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:35:57,670 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] [2018-11-10 13:35:57,670 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:35:57,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:35:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash -465574004, now seen corresponding path program 1 times [2018-11-10 13:35:57,671 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:35:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 62 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 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:35:57,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:35:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:35:58,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:35:58,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:35:58,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:35:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:35:58,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:35:58,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:35:58,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:35:58,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:35:58,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:35:58,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:58,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:35:58,739 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:35:58,740 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:35:58,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:35:58,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:35:58,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:35:58,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:35:58,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:35:58,745 INFO L87 Difference]: Start difference. First operand 338 states and 499 transitions. Second operand 7 states. [2018-11-10 13:36:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:01,665 INFO L93 Difference]: Finished difference Result 686 states and 1020 transitions. [2018-11-10 13:36:01,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:01,666 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-11-10 13:36:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:01,666 INFO L225 Difference]: With dead ends: 686 [2018-11-10 13:36:01,666 INFO L226 Difference]: Without dead ends: 399 [2018-11-10 13:36:01,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-11-10 13:36:01,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 338. [2018-11-10 13:36:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-11-10 13:36:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 498 transitions. [2018-11-10 13:36:01,688 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 498 transitions. Word has length 112 [2018-11-10 13:36:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:01,688 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 498 transitions. [2018-11-10 13:36:01,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 498 transitions. [2018-11-10 13:36:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 13:36:01,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:01,689 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] [2018-11-10 13:36:01,689 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:01,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:01,690 INFO L82 PathProgramCache]: Analyzing trace with hash -882970610, now seen corresponding path program 1 times [2018-11-10 13:36:01,690 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:01,690 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 63 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 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:01,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:02,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:02,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:36:02,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:36:02,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:02,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:02,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:02,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:02,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:02,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:02,959 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:36:03,001 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:36:03,001 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:03,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:03,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:03,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:03,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:03,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:03,006 INFO L87 Difference]: Start difference. First operand 338 states and 498 transitions. Second operand 7 states. [2018-11-10 13:36:06,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:06,009 INFO L93 Difference]: Finished difference Result 687 states and 1025 transitions. [2018-11-10 13:36:06,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:06,010 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-11-10 13:36:06,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:06,010 INFO L225 Difference]: With dead ends: 687 [2018-11-10 13:36:06,011 INFO L226 Difference]: Without dead ends: 400 [2018-11-10 13:36:06,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-11-10 13:36:06,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 365. [2018-11-10 13:36:06,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-11-10 13:36:06,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 543 transitions. [2018-11-10 13:36:06,033 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 543 transitions. Word has length 112 [2018-11-10 13:36:06,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:06,033 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 543 transitions. [2018-11-10 13:36:06,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:06,033 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 543 transitions. [2018-11-10 13:36:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-10 13:36:06,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:06,034 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] [2018-11-10 13:36:06,034 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:06,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1813680285, now seen corresponding path program 1 times [2018-11-10 13:36:06,035 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:06,035 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 64 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 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:06,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:06,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:06,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:06,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:06,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:06,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:36:06,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:36:06,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:06,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:36:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:36:06,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:06,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:06,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:36:06,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:36:06,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:36:06,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:36:06,850 INFO L87 Difference]: Start difference. First operand 365 states and 543 transitions. Second operand 4 states. [2018-11-10 13:36:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:09,657 INFO L93 Difference]: Finished difference Result 755 states and 1138 transitions. [2018-11-10 13:36:09,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:36:09,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-11-10 13:36:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:09,658 INFO L225 Difference]: With dead ends: 755 [2018-11-10 13:36:09,658 INFO L226 Difference]: Without dead ends: 441 [2018-11-10 13:36:09,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:36:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-11-10 13:36:09,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 396. [2018-11-10 13:36:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:09,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 596 transitions. [2018-11-10 13:36:09,698 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 596 transitions. Word has length 115 [2018-11-10 13:36:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:09,698 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 596 transitions. [2018-11-10 13:36:09,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:36:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 596 transitions. [2018-11-10 13:36:09,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 13:36:09,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:09,700 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:09,700 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:09,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:09,700 INFO L82 PathProgramCache]: Analyzing trace with hash -393110301, now seen corresponding path program 1 times [2018-11-10 13:36:09,701 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 65 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 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:09,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:10,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:11,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:11,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:11,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:11,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:11,046 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:11,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:11,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:11,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:11,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-11-10 13:36:11,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:11,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:11,097 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:11,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:11,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:11,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:11,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:11,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:11,102 INFO L87 Difference]: Start difference. First operand 396 states and 596 transitions. Second operand 7 states. [2018-11-10 13:36:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:13,972 INFO L93 Difference]: Finished difference Result 802 states and 1214 transitions. [2018-11-10 13:36:13,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:13,973 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2018-11-10 13:36:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:13,974 INFO L225 Difference]: With dead ends: 802 [2018-11-10 13:36:13,974 INFO L226 Difference]: Without dead ends: 457 [2018-11-10 13:36:13,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-10 13:36:13,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 396. [2018-11-10 13:36:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 595 transitions. [2018-11-10 13:36:13,993 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 595 transitions. Word has length 117 [2018-11-10 13:36:13,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:13,993 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 595 transitions. [2018-11-10 13:36:13,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 595 transitions. [2018-11-10 13:36:13,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:36:13,994 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:13,994 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:13,994 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:13,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:13,994 INFO L82 PathProgramCache]: Analyzing trace with hash -407483849, now seen corresponding path program 1 times [2018-11-10 13:36:13,994 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:13,995 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 66 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 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:14,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:15,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:15,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:15,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:15,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:15,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:15,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:15,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:15,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:15,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:36:15,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:36:15,275 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:15,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:36:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:36:15,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:15,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:15,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:15,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:15,309 INFO L87 Difference]: Start difference. First operand 396 states and 595 transitions. Second operand 7 states. [2018-11-10 13:36:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:18,443 INFO L93 Difference]: Finished difference Result 792 states and 1200 transitions. [2018-11-10 13:36:18,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:18,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-11-10 13:36:18,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:18,444 INFO L225 Difference]: With dead ends: 792 [2018-11-10 13:36:18,445 INFO L226 Difference]: Without dead ends: 447 [2018-11-10 13:36:18,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-10 13:36:18,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-11-10 13:36:18,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:18,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 594 transitions. [2018-11-10 13:36:18,469 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 594 transitions. Word has length 118 [2018-11-10 13:36:18,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:18,469 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 594 transitions. [2018-11-10 13:36:18,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:18,469 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 594 transitions. [2018-11-10 13:36:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:36:18,469 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:18,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:18,470 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:18,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:18,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1727132597, now seen corresponding path program 1 times [2018-11-10 13:36:18,470 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:18,470 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 67 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 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:18,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:19,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:19,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:19,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:19,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:19,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:19,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:19,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:19,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:19,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:19,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:19,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:19,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:19,927 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:19,927 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:19,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:19,932 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:19,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:19,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:19,933 INFO L87 Difference]: Start difference. First operand 396 states and 594 transitions. Second operand 7 states. [2018-11-10 13:36:21,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:21,011 INFO L93 Difference]: Finished difference Result 792 states and 1198 transitions. [2018-11-10 13:36:21,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:21,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-11-10 13:36:21,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:21,013 INFO L225 Difference]: With dead ends: 792 [2018-11-10 13:36:21,013 INFO L226 Difference]: Without dead ends: 447 [2018-11-10 13:36:21,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:21,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-10 13:36:21,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 396. [2018-11-10 13:36:21,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:21,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 593 transitions. [2018-11-10 13:36:21,037 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 593 transitions. Word has length 118 [2018-11-10 13:36:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:21,037 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 593 transitions. [2018-11-10 13:36:21,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 593 transitions. [2018-11-10 13:36:21,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:36:21,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:21,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:21,038 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:21,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:21,038 INFO L82 PathProgramCache]: Analyzing trace with hash 706649389, now seen corresponding path program 1 times [2018-11-10 13:36:21,039 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:21,039 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 68 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 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:21,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:22,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:22,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:22,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:22,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:22,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:22,402 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:22,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:22,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:22,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:22,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:22,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:22,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:22,446 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:22,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:22,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:22,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:22,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:22,452 INFO L87 Difference]: Start difference. First operand 396 states and 593 transitions. Second operand 7 states. [2018-11-10 13:36:25,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:25,589 INFO L93 Difference]: Finished difference Result 790 states and 1194 transitions. [2018-11-10 13:36:25,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:25,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-11-10 13:36:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:25,591 INFO L225 Difference]: With dead ends: 790 [2018-11-10 13:36:25,591 INFO L226 Difference]: Without dead ends: 445 [2018-11-10 13:36:25,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:25,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-11-10 13:36:25,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 396. [2018-11-10 13:36:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 592 transitions. [2018-11-10 13:36:25,615 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 592 transitions. Word has length 118 [2018-11-10 13:36:25,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:25,615 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 592 transitions. [2018-11-10 13:36:25,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:25,615 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 592 transitions. [2018-11-10 13:36:25,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-10 13:36:25,616 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:25,616 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:25,616 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:25,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:25,616 INFO L82 PathProgramCache]: Analyzing trace with hash -900110023, now seen corresponding path program 1 times [2018-11-10 13:36:25,617 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:25,617 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 69 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 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:25,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:27,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:27,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:27,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:27,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:27,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:27,147 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:27,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:27,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:27,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:36:27,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:36:27,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:27,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:36:27,192 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 13:36:27,192 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:27,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:27,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:27,198 INFO L87 Difference]: Start difference. First operand 396 states and 592 transitions. Second operand 7 states. [2018-11-10 13:36:30,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:30,042 INFO L93 Difference]: Finished difference Result 754 states and 1139 transitions. [2018-11-10 13:36:30,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:30,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-11-10 13:36:30,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:30,044 INFO L225 Difference]: With dead ends: 754 [2018-11-10 13:36:30,044 INFO L226 Difference]: Without dead ends: 409 [2018-11-10 13:36:30,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:30,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-10 13:36:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 396. [2018-11-10 13:36:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 591 transitions. [2018-11-10 13:36:30,066 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 591 transitions. Word has length 118 [2018-11-10 13:36:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:30,066 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 591 transitions. [2018-11-10 13:36:30,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 591 transitions. [2018-11-10 13:36:30,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:36:30,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:30,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:30,077 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:30,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:30,077 INFO L82 PathProgramCache]: Analyzing trace with hash -469635605, now seen corresponding path program 1 times [2018-11-10 13:36:30,077 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:30,077 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 70 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 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:30,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:31,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:31,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:31,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:31,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:31,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:31,278 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:31,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:31,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:31,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:31,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:31,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:31,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:31,312 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:31,312 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:31,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:31,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:31,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:31,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:31,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:31,317 INFO L87 Difference]: Start difference. First operand 396 states and 591 transitions. Second operand 7 states. [2018-11-10 13:36:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:34,297 INFO L93 Difference]: Finished difference Result 788 states and 1187 transitions. [2018-11-10 13:36:34,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:34,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 13:36:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:34,298 INFO L225 Difference]: With dead ends: 788 [2018-11-10 13:36:34,298 INFO L226 Difference]: Without dead ends: 443 [2018-11-10 13:36:34,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:34,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-10 13:36:34,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 396. [2018-11-10 13:36:34,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 590 transitions. [2018-11-10 13:36:34,323 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 590 transitions. Word has length 119 [2018-11-10 13:36:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:34,323 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 590 transitions. [2018-11-10 13:36:34,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2018-11-10 13:36:34,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 13:36:34,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:34,324 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:34,324 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:34,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2143413915, now seen corresponding path program 1 times [2018-11-10 13:36:34,325 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:34,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 71 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 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:34,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:35,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:35,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:35,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:35,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:35,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:35,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:35,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:35,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,700 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:35,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:35,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:35,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:35,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:35,725 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:35,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:35,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:35,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:35,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:35,730 INFO L87 Difference]: Start difference. First operand 396 states and 590 transitions. Second operand 7 states. [2018-11-10 13:36:38,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:38,849 INFO L93 Difference]: Finished difference Result 785 states and 1181 transitions. [2018-11-10 13:36:38,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:38,849 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 13:36:38,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:38,850 INFO L225 Difference]: With dead ends: 785 [2018-11-10 13:36:38,850 INFO L226 Difference]: Without dead ends: 440 [2018-11-10 13:36:38,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:38,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-10 13:36:38,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 396. [2018-11-10 13:36:38,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-10 13:36:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 589 transitions. [2018-11-10 13:36:38,879 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 589 transitions. Word has length 119 [2018-11-10 13:36:38,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:38,879 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 589 transitions. [2018-11-10 13:36:38,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:38,879 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 589 transitions. [2018-11-10 13:36:38,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:36:38,880 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:38,880 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] [2018-11-10 13:36:38,881 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:38,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:38,881 INFO L82 PathProgramCache]: Analyzing trace with hash -434963160, now seen corresponding path program 1 times [2018-11-10 13:36:38,881 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:38,882 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 72 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 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:38,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:39,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:39,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:39,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:36:39,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:36:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:36:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:36:39,067 INFO L87 Difference]: Start difference. First operand 396 states and 589 transitions. Second operand 3 states. [2018-11-10 13:36:39,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:39,155 INFO L93 Difference]: Finished difference Result 1081 states and 1635 transitions. [2018-11-10 13:36:39,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:36:39,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-11-10 13:36:39,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:39,157 INFO L225 Difference]: With dead ends: 1081 [2018-11-10 13:36:39,158 INFO L226 Difference]: Without dead ends: 736 [2018-11-10 13:36:39,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:36:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-11-10 13:36:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 734. [2018-11-10 13:36:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 13:36:39,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1096 transitions. [2018-11-10 13:36:39,207 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1096 transitions. Word has length 121 [2018-11-10 13:36:39,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:39,208 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1096 transitions. [2018-11-10 13:36:39,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:36:39,208 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1096 transitions. [2018-11-10 13:36:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 13:36:39,209 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:39,209 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] [2018-11-10 13:36:39,209 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:39,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:39,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1806770458, now seen corresponding path program 1 times [2018-11-10 13:36:39,210 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:39,211 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 73 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 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:39,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:40,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:40,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:40,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:40,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:40,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:40,747 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:40,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:40,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:40,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:40,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:40,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:40,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:40,794 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:40,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:40,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:40,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:40,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:40,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:40,799 INFO L87 Difference]: Start difference. First operand 734 states and 1096 transitions. Second operand 7 states. [2018-11-10 13:36:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:41,923 INFO L93 Difference]: Finished difference Result 1504 states and 2247 transitions. [2018-11-10 13:36:41,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:41,924 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 13:36:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:41,925 INFO L225 Difference]: With dead ends: 1504 [2018-11-10 13:36:41,925 INFO L226 Difference]: Without dead ends: 821 [2018-11-10 13:36:41,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:41,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2018-11-10 13:36:41,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 734. [2018-11-10 13:36:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 13:36:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1094 transitions. [2018-11-10 13:36:41,971 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1094 transitions. Word has length 121 [2018-11-10 13:36:41,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:41,971 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1094 transitions. [2018-11-10 13:36:41,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:41,971 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1094 transitions. [2018-11-10 13:36:41,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:36:41,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:41,972 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:41,972 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:41,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:41,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1493886576, now seen corresponding path program 1 times [2018-11-10 13:36:41,973 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:41,973 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 74 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 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:41,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:43,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:43,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:43,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:43,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:43,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:43,466 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:43,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:43,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:43,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:43,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:43,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:43,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:43,512 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:43,512 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:43,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:43,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:43,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:43,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:43,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:43,517 INFO L87 Difference]: Start difference. First operand 734 states and 1094 transitions. Second operand 7 states. [2018-11-10 13:36:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:44,629 INFO L93 Difference]: Finished difference Result 1488 states and 2217 transitions. [2018-11-10 13:36:44,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:44,630 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-11-10 13:36:44,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:44,631 INFO L225 Difference]: With dead ends: 1488 [2018-11-10 13:36:44,632 INFO L226 Difference]: Without dead ends: 805 [2018-11-10 13:36:44,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2018-11-10 13:36:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 734. [2018-11-10 13:36:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2018-11-10 13:36:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1092 transitions. [2018-11-10 13:36:44,715 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1092 transitions. Word has length 122 [2018-11-10 13:36:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:44,716 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 1092 transitions. [2018-11-10 13:36:44,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1092 transitions. [2018-11-10 13:36:44,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-11-10 13:36:44,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:44,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:44,717 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:44,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:44,718 INFO L82 PathProgramCache]: Analyzing trace with hash -396881771, now seen corresponding path program 1 times [2018-11-10 13:36:44,718 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:44,718 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 75 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 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:45,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:45,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:45,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:45,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:45,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 19 treesize of output 15 [2018-11-10 13:36:45,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:36:45,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:45,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:36:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:36:45,491 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:45,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:45,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:36:45,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:36:45,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:36:45,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:36:45,496 INFO L87 Difference]: Start difference. First operand 734 states and 1092 transitions. Second operand 4 states. [2018-11-10 13:36:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:48,004 INFO L93 Difference]: Finished difference Result 1509 states and 2252 transitions. [2018-11-10 13:36:48,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:36:48,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-11-10 13:36:48,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:48,006 INFO L225 Difference]: With dead ends: 1509 [2018-11-10 13:36:48,006 INFO L226 Difference]: Without dead ends: 826 [2018-11-10 13:36:48,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:36:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2018-11-10 13:36:48,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 766. [2018-11-10 13:36:48,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-11-10 13:36:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1144 transitions. [2018-11-10 13:36:48,047 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1144 transitions. Word has length 122 [2018-11-10 13:36:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:48,047 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1144 transitions. [2018-11-10 13:36:48,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:36:48,047 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1144 transitions. [2018-11-10 13:36:48,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 13:36:48,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:48,048 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:48,048 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:48,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -549516591, now seen corresponding path program 1 times [2018-11-10 13:36:48,048 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 76 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 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:48,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:49,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:49,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:49,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:49,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:49,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:49,176 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:49,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:36:49,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:49,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 17 treesize of output 13 [2018-11-10 13:36:49,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:49,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:49,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:49,213 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:49,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:49,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:49,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:49,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:49,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:49,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:49,218 INFO L87 Difference]: Start difference. First operand 766 states and 1144 transitions. Second operand 7 states. [2018-11-10 13:36:52,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:52,324 INFO L93 Difference]: Finished difference Result 1552 states and 2317 transitions. [2018-11-10 13:36:52,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:52,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-11-10 13:36:52,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:52,325 INFO L225 Difference]: With dead ends: 1552 [2018-11-10 13:36:52,326 INFO L226 Difference]: Without dead ends: 837 [2018-11-10 13:36:52,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-11-10 13:36:52,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 766. [2018-11-10 13:36:52,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-11-10 13:36:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1142 transitions. [2018-11-10 13:36:52,388 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1142 transitions. Word has length 123 [2018-11-10 13:36:52,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:52,388 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1142 transitions. [2018-11-10 13:36:52,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:52,389 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1142 transitions. [2018-11-10 13:36:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:36:52,390 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:52,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:52,390 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:52,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:52,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1609694838, now seen corresponding path program 1 times [2018-11-10 13:36:52,391 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:52,391 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 77 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 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:52,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:53,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:53,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:53,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:53,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:36:53,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:36:53,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:36:53,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-11-10 13:36:53,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:36:53,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:36:53,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:36:53,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:53,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:36:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:36:53,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:53,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:53,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:36:53,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:36:53,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:36:53,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:36:53,793 INFO L87 Difference]: Start difference. First operand 766 states and 1142 transitions. Second operand 7 states. [2018-11-10 13:36:56,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:56,887 INFO L93 Difference]: Finished difference Result 1546 states and 2306 transitions. [2018-11-10 13:36:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:36:56,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-10 13:36:56,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:56,889 INFO L225 Difference]: With dead ends: 1546 [2018-11-10 13:36:56,889 INFO L226 Difference]: Without dead ends: 831 [2018-11-10 13:36:56,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:36:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-11-10 13:36:56,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 766. [2018-11-10 13:36:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 766 states. [2018-11-10 13:36:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1140 transitions. [2018-11-10 13:36:56,937 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1140 transitions. Word has length 124 [2018-11-10 13:36:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:56,938 INFO L481 AbstractCegarLoop]: Abstraction has 766 states and 1140 transitions. [2018-11-10 13:36:56,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:36:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1140 transitions. [2018-11-10 13:36:56,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 13:36:56,938 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:36:56,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:36:56,939 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:36:56,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:36:56,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1900954461, now seen corresponding path program 1 times [2018-11-10 13:36:56,939 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:36:56,939 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 78 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 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:36:56,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:36:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:36:57,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:36:57,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:36:57,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:36:57,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:36:57,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:36:57,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:36:57,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:36:57,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:36:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:36:57,691 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:36:57,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:36:57,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:36:57,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:36:57,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:36:57,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:36:57,696 INFO L87 Difference]: Start difference. First operand 766 states and 1140 transitions. Second operand 4 states. [2018-11-10 13:37:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:00,537 INFO L93 Difference]: Finished difference Result 1666 states and 2494 transitions. [2018-11-10 13:37:00,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:37:00,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-10 13:37:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:00,548 INFO L225 Difference]: With dead ends: 1666 [2018-11-10 13:37:00,548 INFO L226 Difference]: Without dead ends: 951 [2018-11-10 13:37:00,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:37:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2018-11-10 13:37:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 838. [2018-11-10 13:37:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1266 transitions. [2018-11-10 13:37:00,599 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1266 transitions. Word has length 124 [2018-11-10 13:37:00,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:00,599 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1266 transitions. [2018-11-10 13:37:00,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:37:00,599 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1266 transitions. [2018-11-10 13:37:00,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 13:37:00,600 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:00,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:00,600 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:00,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash -531922503, now seen corresponding path program 1 times [2018-11-10 13:37:00,601 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:00,601 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 79 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 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:00,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:01,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:01,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:37:01,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:37:01,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:37:01,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:37:01,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:01,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:01,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:37:01,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:01,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:01,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:01,995 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:02,013 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:37:02,013 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:02,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:02,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:02,019 INFO L87 Difference]: Start difference. First operand 838 states and 1266 transitions. Second operand 7 states. [2018-11-10 13:37:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:05,085 INFO L93 Difference]: Finished difference Result 1690 states and 2554 transitions. [2018-11-10 13:37:05,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:05,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-10 13:37:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:05,087 INFO L225 Difference]: With dead ends: 1690 [2018-11-10 13:37:05,087 INFO L226 Difference]: Without dead ends: 903 [2018-11-10 13:37:05,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2018-11-10 13:37:05,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 838. [2018-11-10 13:37:05,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:05,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1264 transitions. [2018-11-10 13:37:05,137 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1264 transitions. Word has length 125 [2018-11-10 13:37:05,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:05,138 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1264 transitions. [2018-11-10 13:37:05,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:05,138 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1264 transitions. [2018-11-10 13:37:05,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 13:37:05,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:05,139 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:05,139 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:05,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:05,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1622060162, now seen corresponding path program 1 times [2018-11-10 13:37:05,139 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:05,139 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 80 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 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:05,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:06,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:06,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:37:06,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:37:06,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:37:06,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:37:06,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:06,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:06,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:37:06,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:06,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:06,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:06,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:37:06,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:06,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:06,541 INFO L87 Difference]: Start difference. First operand 838 states and 1264 transitions. Second operand 7 states. [2018-11-10 13:37:09,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:09,605 INFO L93 Difference]: Finished difference Result 1684 states and 2543 transitions. [2018-11-10 13:37:09,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:09,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-11-10 13:37:09,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:09,607 INFO L225 Difference]: With dead ends: 1684 [2018-11-10 13:37:09,607 INFO L226 Difference]: Without dead ends: 897 [2018-11-10 13:37:09,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:09,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-11-10 13:37:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 838. [2018-11-10 13:37:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1262 transitions. [2018-11-10 13:37:09,667 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1262 transitions. Word has length 126 [2018-11-10 13:37:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:09,667 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1262 transitions. [2018-11-10 13:37:09,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1262 transitions. [2018-11-10 13:37:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 13:37:09,668 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:09,668 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-10 13:37:09,668 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:09,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -686736429, now seen corresponding path program 1 times [2018-11-10 13:37:09,668 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 81 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 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:09,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:10,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:10,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:10,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:10,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:10,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:10,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:10,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:10,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:10,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:10,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:11,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:37:11,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:37:11,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:11,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:11,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:11,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:37:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:11,026 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:11,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:11,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:11,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:11,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:11,031 INFO L87 Difference]: Start difference. First operand 838 states and 1262 transitions. Second operand 7 states. [2018-11-10 13:37:13,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:13,929 INFO L93 Difference]: Finished difference Result 1694 states and 2549 transitions. [2018-11-10 13:37:13,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:13,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2018-11-10 13:37:13,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:13,930 INFO L225 Difference]: With dead ends: 1694 [2018-11-10 13:37:13,930 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 13:37:13,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 13:37:14,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 838. [2018-11-10 13:37:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1260 transitions. [2018-11-10 13:37:14,007 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1260 transitions. Word has length 128 [2018-11-10 13:37:14,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:14,007 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1260 transitions. [2018-11-10 13:37:14,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:14,008 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1260 transitions. [2018-11-10 13:37:14,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-10 13:37:14,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:14,009 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-10 13:37:14,009 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:14,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:14,009 INFO L82 PathProgramCache]: Analyzing trace with hash 945957789, now seen corresponding path program 1 times [2018-11-10 13:37:14,010 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:14,010 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 82 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 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:14,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:15,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:15,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:15,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:15,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:15,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:15,612 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,619 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,634 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:15,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:37:15,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:37:15,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:15,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:37:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:15,676 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:15,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:15,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:15,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:15,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:15,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:15,682 INFO L87 Difference]: Start difference. First operand 838 states and 1260 transitions. Second operand 7 states. [2018-11-10 13:37:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:16,817 INFO L93 Difference]: Finished difference Result 1694 states and 2545 transitions. [2018-11-10 13:37:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:16,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-11-10 13:37:16,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:16,819 INFO L225 Difference]: With dead ends: 1694 [2018-11-10 13:37:16,819 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 13:37:16,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:16,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 13:37:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 838. [2018-11-10 13:37:16,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:16,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1258 transitions. [2018-11-10 13:37:16,870 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1258 transitions. Word has length 129 [2018-11-10 13:37:16,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:16,870 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1258 transitions. [2018-11-10 13:37:16,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:16,870 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1258 transitions. [2018-11-10 13:37:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 13:37:16,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:16,871 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-10 13:37:16,871 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:16,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:16,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1284633688, now seen corresponding path program 1 times [2018-11-10 13:37:16,872 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:16,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 83 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 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:16,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:18,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:18,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:18,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:18,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:18,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:18,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:18,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:37:18,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:37:18,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:18,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:37:18,531 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:18,531 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:18,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:18,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:18,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:18,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:18,537 INFO L87 Difference]: Start difference. First operand 838 states and 1258 transitions. Second operand 7 states. [2018-11-10 13:37:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:19,709 INFO L93 Difference]: Finished difference Result 1694 states and 2541 transitions. [2018-11-10 13:37:19,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:19,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-11-10 13:37:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:19,711 INFO L225 Difference]: With dead ends: 1694 [2018-11-10 13:37:19,711 INFO L226 Difference]: Without dead ends: 907 [2018-11-10 13:37:19,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-10 13:37:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 838. [2018-11-10 13:37:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2018-11-10 13:37:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1256 transitions. [2018-11-10 13:37:19,762 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1256 transitions. Word has length 130 [2018-11-10 13:37:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:19,762 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1256 transitions. [2018-11-10 13:37:19,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:19,762 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1256 transitions. [2018-11-10 13:37:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 13:37:19,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:19,763 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:19,764 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:19,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash 405705236, now seen corresponding path program 1 times [2018-11-10 13:37:19,764 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:19,764 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 84 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 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:19,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:21,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:21,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:21,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:21,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:21,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:21,288 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,296 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,312 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:21,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:21,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:21,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,332 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:21,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:21,381 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:37:21,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:21,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 13:37:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:21,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:37:21,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:37:21,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:37:21,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:37:21,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:37:21,403 INFO L87 Difference]: Start difference. First operand 838 states and 1256 transitions. Second operand 9 states. [2018-11-10 13:37:25,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:25,343 INFO L93 Difference]: Finished difference Result 2121 states and 3185 transitions. [2018-11-10 13:37:25,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:37:25,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 131 [2018-11-10 13:37:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:25,346 INFO L225 Difference]: With dead ends: 2121 [2018-11-10 13:37:25,346 INFO L226 Difference]: Without dead ends: 1334 [2018-11-10 13:37:25,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 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-11-10 13:37:25,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2018-11-10 13:37:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 920. [2018-11-10 13:37:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2018-11-10 13:37:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1400 transitions. [2018-11-10 13:37:25,400 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1400 transitions. Word has length 131 [2018-11-10 13:37:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:25,400 INFO L481 AbstractCegarLoop]: Abstraction has 920 states and 1400 transitions. [2018-11-10 13:37:25,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:37:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1400 transitions. [2018-11-10 13:37:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 13:37:25,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:25,401 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, 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] [2018-11-10 13:37:25,401 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:25,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash -315793267, now seen corresponding path program 1 times [2018-11-10 13:37:25,402 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 85 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 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:25,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:26,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:26,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:26,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:26,587 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:26,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-11-10 13:37:26,589 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,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-11-10 13:37:26,606 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:26,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:26,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:26,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:26,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:26,665 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:37:26,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:26,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 13:37:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:26,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:37:26,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:37:26,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:37:26,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:37:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:37:26,692 INFO L87 Difference]: Start difference. First operand 920 states and 1400 transitions. Second operand 9 states. [2018-11-10 13:37:30,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:30,175 INFO L93 Difference]: Finished difference Result 2239 states and 3404 transitions. [2018-11-10 13:37:30,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:37:30,176 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2018-11-10 13:37:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:30,177 INFO L225 Difference]: With dead ends: 2239 [2018-11-10 13:37:30,177 INFO L226 Difference]: Without dead ends: 1370 [2018-11-10 13:37:30,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:37:30,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-11-10 13:37:30,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 962. [2018-11-10 13:37:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-11-10 13:37:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1486 transitions. [2018-11-10 13:37:30,233 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1486 transitions. Word has length 132 [2018-11-10 13:37:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:30,234 INFO L481 AbstractCegarLoop]: Abstraction has 962 states and 1486 transitions. [2018-11-10 13:37:30,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:37:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1486 transitions. [2018-11-10 13:37:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 13:37:30,235 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:30,235 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, 1, 1] [2018-11-10 13:37:30,235 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:30,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:30,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1538428454, now seen corresponding path program 1 times [2018-11-10 13:37:30,236 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:30,236 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 86 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 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:30,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:31,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:31,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:37:31,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:37:31,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:37:31,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:37:31,422 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:31,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:31,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:31,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:37:31,469 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 13:37:31,469 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:31,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:31,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:37:31,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:37:31,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:37:31,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:37:31,474 INFO L87 Difference]: Start difference. First operand 962 states and 1486 transitions. Second operand 7 states. [2018-11-10 13:37:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:34,195 INFO L93 Difference]: Finished difference Result 1924 states and 2974 transitions. [2018-11-10 13:37:34,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:37:34,196 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-10 13:37:34,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:34,196 INFO L225 Difference]: With dead ends: 1924 [2018-11-10 13:37:34,196 INFO L226 Difference]: Without dead ends: 1013 [2018-11-10 13:37:34,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:37:34,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2018-11-10 13:37:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 968. [2018-11-10 13:37:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-10 13:37:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1492 transitions. [2018-11-10 13:37:34,252 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1492 transitions. Word has length 133 [2018-11-10 13:37:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:34,252 INFO L481 AbstractCegarLoop]: Abstraction has 968 states and 1492 transitions. [2018-11-10 13:37:34,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:37:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1492 transitions. [2018-11-10 13:37:34,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 13:37:34,254 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:34,254 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:34,254 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:34,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1588891748, now seen corresponding path program 1 times [2018-11-10 13:37:34,254 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 87 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 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:34,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:34,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:37:34,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:37:34,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:37:34,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:37:34,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:37:34,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:34,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:37:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:34,988 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:37:34,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:37:34,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:37:34,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:37:34,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:37:34,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:37:34,992 INFO L87 Difference]: Start difference. First operand 968 states and 1492 transitions. Second operand 4 states. [2018-11-10 13:37:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:37,612 INFO L93 Difference]: Finished difference Result 1992 states and 3062 transitions. [2018-11-10 13:37:37,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:37:37,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-10 13:37:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:37,614 INFO L225 Difference]: With dead ends: 1992 [2018-11-10 13:37:37,614 INFO L226 Difference]: Without dead ends: 1075 [2018-11-10 13:37:37,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:37:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2018-11-10 13:37:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 968. [2018-11-10 13:37:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-11-10 13:37:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1490 transitions. [2018-11-10 13:37:37,663 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1490 transitions. Word has length 154 [2018-11-10 13:37:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:37,663 INFO L481 AbstractCegarLoop]: Abstraction has 968 states and 1490 transitions. [2018-11-10 13:37:37,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:37:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1490 transitions. [2018-11-10 13:37:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-10 13:37:37,665 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:37,665 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:37,665 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:37,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:37,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1660975909, now seen corresponding path program 1 times [2018-11-10 13:37:37,666 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:37,666 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 88 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 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:38,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:39,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:39,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:39,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:39,149 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:39,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:39,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,170 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:39,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:39,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:39,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:39,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:39,224 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:37:39,224 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:39,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 13:37:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:39,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:37:39,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:37:39,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:37:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:37:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:37:39,244 INFO L87 Difference]: Start difference. First operand 968 states and 1490 transitions. Second operand 9 states. [2018-11-10 13:37:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:44,799 INFO L93 Difference]: Finished difference Result 2439 states and 3762 transitions. [2018-11-10 13:37:44,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:37:44,800 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 161 [2018-11-10 13:37:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:44,801 INFO L225 Difference]: With dead ends: 2439 [2018-11-10 13:37:44,801 INFO L226 Difference]: Without dead ends: 1522 [2018-11-10 13:37:44,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:37:44,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1522 states. [2018-11-10 13:37:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1522 to 1100. [2018-11-10 13:37:44,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-11-10 13:37:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1718 transitions. [2018-11-10 13:37:44,859 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1718 transitions. Word has length 161 [2018-11-10 13:37:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:44,859 INFO L481 AbstractCegarLoop]: Abstraction has 1100 states and 1718 transitions. [2018-11-10 13:37:44,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:37:44,859 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1718 transitions. [2018-11-10 13:37:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-11-10 13:37:44,861 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:44,861 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:44,861 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:44,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:44,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1160772783, now seen corresponding path program 1 times [2018-11-10 13:37:44,862 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:44,862 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 89 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 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:44,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:46,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:46,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 18 treesize of output 15 [2018-11-10 13:37:46,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:46,375 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:46,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:46,378 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,395 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:46,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:46,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:46,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:46,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:46,451 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:37:46,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:46,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 13:37:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:46,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:37:46,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:37:46,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:37:46,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:37:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:37:46,471 INFO L87 Difference]: Start difference. First operand 1100 states and 1718 transitions. Second operand 9 states. [2018-11-10 13:37:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:51,888 INFO L93 Difference]: Finished difference Result 2629 states and 4078 transitions. [2018-11-10 13:37:51,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:37:51,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2018-11-10 13:37:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:51,890 INFO L225 Difference]: With dead ends: 2629 [2018-11-10 13:37:51,890 INFO L226 Difference]: Without dead ends: 1580 [2018-11-10 13:37:51,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:37:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2018-11-10 13:37:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1176. [2018-11-10 13:37:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-10 13:37:51,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1848 transitions. [2018-11-10 13:37:51,945 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1848 transitions. Word has length 167 [2018-11-10 13:37:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:51,946 INFO L481 AbstractCegarLoop]: Abstraction has 1176 states and 1848 transitions. [2018-11-10 13:37:51,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:37:51,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1848 transitions. [2018-11-10 13:37:51,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-10 13:37:51,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:51,947 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:51,947 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:51,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:51,947 INFO L82 PathProgramCache]: Analyzing trace with hash -688113848, now seen corresponding path program 1 times [2018-11-10 13:37:51,947 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:51,947 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 90 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 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:51,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:37:53,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:37:53,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:37:53,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:37:53,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:37:53,461 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:37:53,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:37:53,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:37:53,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:37:53,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:37:53,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:37:53,527 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:53,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:37:53,547 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:37:53,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:37:53,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:37:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:37:53,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:37:53,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:37:53,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:37:53,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:37:53,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:37:53,569 INFO L87 Difference]: Start difference. First operand 1176 states and 1848 transitions. Second operand 9 states. [2018-11-10 13:37:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:37:58,990 INFO L93 Difference]: Finished difference Result 2693 states and 4187 transitions. [2018-11-10 13:37:58,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:37:58,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 168 [2018-11-10 13:37:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:37:58,992 INFO L225 Difference]: With dead ends: 2693 [2018-11-10 13:37:58,992 INFO L226 Difference]: Without dead ends: 1568 [2018-11-10 13:37:58,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:37:58,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-11-10 13:37:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1176. [2018-11-10 13:37:59,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-10 13:37:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1844 transitions. [2018-11-10 13:37:59,051 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1844 transitions. Word has length 168 [2018-11-10 13:37:59,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:37:59,052 INFO L481 AbstractCegarLoop]: Abstraction has 1176 states and 1844 transitions. [2018-11-10 13:37:59,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:37:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1844 transitions. [2018-11-10 13:37:59,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 13:37:59,053 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:37:59,053 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:37:59,054 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:37:59,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:37:59,054 INFO L82 PathProgramCache]: Analyzing trace with hash 60836814, now seen corresponding path program 1 times [2018-11-10 13:37:59,054 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:37:59,055 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 91 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 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:37:59,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:00,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:00,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:00,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:38:00,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:38:00,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:00,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:38:00,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:00,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:00,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:00,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:00,988 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:38:01,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:01,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:01,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:01,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:01,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:01,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:38:01,023 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:01,023 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:01,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:01,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:38:01,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:38:01,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:38:01,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:38:01,029 INFO L87 Difference]: Start difference. First operand 1176 states and 1844 transitions. Second operand 7 states. [2018-11-10 13:38:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:01,849 INFO L93 Difference]: Finished difference Result 2350 states and 3689 transitions. [2018-11-10 13:38:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:38:01,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 171 [2018-11-10 13:38:01,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:01,851 INFO L225 Difference]: With dead ends: 2350 [2018-11-10 13:38:01,851 INFO L226 Difference]: Without dead ends: 1225 [2018-11-10 13:38:01,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:38:01,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2018-11-10 13:38:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1176. [2018-11-10 13:38:01,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-10 13:38:01,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1842 transitions. [2018-11-10 13:38:01,905 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1842 transitions. Word has length 171 [2018-11-10 13:38:01,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:01,905 INFO L481 AbstractCegarLoop]: Abstraction has 1176 states and 1842 transitions. [2018-11-10 13:38:01,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:38:01,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1842 transitions. [2018-11-10 13:38:01,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-10 13:38:01,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:01,907 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:01,907 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:01,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:01,907 INFO L82 PathProgramCache]: Analyzing trace with hash 567870699, now seen corresponding path program 1 times [2018-11-10 13:38:01,908 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:01,908 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 92 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 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:01,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:03,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:03,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:38:03,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:38:03,748 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:03,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:38:03,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,756 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,768 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:38:03,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:03,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:03,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:03,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:38:03,803 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:03,803 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:03,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:03,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:38:03,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:38:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:38:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:38:03,809 INFO L87 Difference]: Start difference. First operand 1176 states and 1842 transitions. Second operand 7 states. [2018-11-10 13:38:06,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:06,672 INFO L93 Difference]: Finished difference Result 2330 states and 3659 transitions. [2018-11-10 13:38:06,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:38:06,673 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2018-11-10 13:38:06,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:06,673 INFO L225 Difference]: With dead ends: 2330 [2018-11-10 13:38:06,674 INFO L226 Difference]: Without dead ends: 1205 [2018-11-10 13:38:06,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:38:06,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2018-11-10 13:38:06,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1176. [2018-11-10 13:38:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-10 13:38:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1840 transitions. [2018-11-10 13:38:06,735 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1840 transitions. Word has length 174 [2018-11-10 13:38:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:06,735 INFO L481 AbstractCegarLoop]: Abstraction has 1176 states and 1840 transitions. [2018-11-10 13:38:06,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:38:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1840 transitions. [2018-11-10 13:38:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-10 13:38:06,736 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:06,736 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:06,736 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:06,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1287671012, now seen corresponding path program 1 times [2018-11-10 13:38:06,737 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:06,737 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 93 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 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:06,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:08,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:09,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:09,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 13:38:09,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 13:38:09,445 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,457 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 13:38:09,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:38:09,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:38:09,604 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:38:09,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:38:09,617 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,634 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,643 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:09,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:09,690 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,695 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,721 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 13:38:09,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:09,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-10 13:38:09,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:38:09,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,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 29 treesize of output 25 [2018-11-10 13:38:09,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:38:09,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 13:38:09,866 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,889 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 13:38:09,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 13:38:09,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-10 13:38:09,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 13:38:09,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:09,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:09,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:09,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 13:38:09,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:10,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 13:38:10,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 13:38:10,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-10 13:38:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-11-10 13:38:10,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-11-10 13:38:10,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:38:10,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:10,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:10,099 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:38:10,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 13:38:10,104 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:38:10,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:38:10,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,122 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 13:38:10,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:38:10,145 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:10,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:38:10,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,161 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:38:10,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:38:10,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:38:10,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:38:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:38:10,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:10,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 13:38:10,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2018-11-10 13:38:10,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 13:38:10,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-11-10 13:38:10,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-10 13:38:10,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:38:10,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:38:10,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 13:38:10,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,594 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 13:38:10,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 13:38:10,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-10 13:38:10,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:10,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 13:38:10,955 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:38:10,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:38:10,960 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:38:10,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:11,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:11,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:38:11,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:11,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:11,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,346 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:38:11,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:38:11,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:38:11,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,391 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:38:11,399 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,411 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,420 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,428 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,445 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 13:38:11,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-10 13:38:11,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-10 13:38:11,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 13:38:11,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:38:11,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 13:38:11,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 13:38:11,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:11,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:11,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 13:38:11,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 13:38:11,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 13:38:11,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 13:38:11,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:38:11,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 13:38:11,746 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:38:11,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:38:11,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 13:38:11,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:38:11,775 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:38:11,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:38:11,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:38:11,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:38:11,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:38:11,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:11,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:38:11,856 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:38:11,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:38:11,942 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 52 treesize of output 44 [2018-11-10 13:38:11,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 11 treesize of output 10 [2018-11-10 13:38:11,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:12,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 13:38:12,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 13:38:12,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:12,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:12,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:12,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:12,028 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 13:38:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 13:38:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:38:12,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 13:38:12,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 13:38:12,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 13:38:12,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 13:38:12,361 INFO L87 Difference]: Start difference. First operand 1176 states and 1840 transitions. Second operand 24 states. [2018-11-10 13:38:20,687 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 13:38:22,304 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 13:38:26,224 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 13:38:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:27,234 INFO L93 Difference]: Finished difference Result 2663 states and 4116 transitions. [2018-11-10 13:38:27,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:38:27,236 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-11-10 13:38:27,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:27,237 INFO L225 Difference]: With dead ends: 2663 [2018-11-10 13:38:27,237 INFO L226 Difference]: Without dead ends: 1538 [2018-11-10 13:38:27,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 703 GetRequests, 673 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 13:38:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2018-11-10 13:38:27,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1108. [2018-11-10 13:38:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1722 transitions. [2018-11-10 13:38:27,304 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1722 transitions. Word has length 175 [2018-11-10 13:38:27,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:27,305 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1722 transitions. [2018-11-10 13:38:27,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 13:38:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1722 transitions. [2018-11-10 13:38:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 13:38:27,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:27,307 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:27,307 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:27,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -596415769, now seen corresponding path program 1 times [2018-11-10 13:38:27,308 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:27,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 95 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 95 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:27,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:28,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:28,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:28,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:28,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:28,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:28,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:28,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:28,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:28,241 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:28,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:28,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:28,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:28,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:28,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:28,247 INFO L87 Difference]: Start difference. First operand 1108 states and 1722 transitions. Second operand 4 states. [2018-11-10 13:38:30,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:30,719 INFO L93 Difference]: Finished difference Result 2205 states and 3434 transitions. [2018-11-10 13:38:30,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:30,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-11-10 13:38:30,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:30,720 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:38:30,720 INFO L226 Difference]: Without dead ends: 1148 [2018-11-10 13:38:30,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-10 13:38:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1108. [2018-11-10 13:38:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1720 transitions. [2018-11-10 13:38:30,784 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1720 transitions. Word has length 181 [2018-11-10 13:38:30,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:30,784 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1720 transitions. [2018-11-10 13:38:30,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1720 transitions. [2018-11-10 13:38:30,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 13:38:30,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:30,785 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:30,785 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:30,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:30,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1121384915, now seen corresponding path program 1 times [2018-11-10 13:38:30,786 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:30,786 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 96 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 96 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:31,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:31,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:31,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:31,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:31,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:31,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:31,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:31,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:31,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:31,738 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:31,738 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:31,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:31,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:31,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:31,742 INFO L87 Difference]: Start difference. First operand 1108 states and 1720 transitions. Second operand 4 states. [2018-11-10 13:38:34,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:34,224 INFO L93 Difference]: Finished difference Result 2205 states and 3430 transitions. [2018-11-10 13:38:34,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:34,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2018-11-10 13:38:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:34,226 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:38:34,226 INFO L226 Difference]: Without dead ends: 1148 [2018-11-10 13:38:34,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-10 13:38:34,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1108. [2018-11-10 13:38:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1718 transitions. [2018-11-10 13:38:34,290 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1718 transitions. Word has length 181 [2018-11-10 13:38:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:34,290 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1718 transitions. [2018-11-10 13:38:34,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1718 transitions. [2018-11-10 13:38:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:38:34,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:34,291 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:34,291 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:34,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:34,291 INFO L82 PathProgramCache]: Analyzing trace with hash 489649335, now seen corresponding path program 1 times [2018-11-10 13:38:34,292 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:34,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 97 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 97 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:35,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:35,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:35,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:35,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:35,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:35,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:35,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:35,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:35,225 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:35,225 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:35,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:35,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:35,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:35,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:35,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:35,230 INFO L87 Difference]: Start difference. First operand 1108 states and 1718 transitions. Second operand 4 states. [2018-11-10 13:38:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:37,695 INFO L93 Difference]: Finished difference Result 2205 states and 3426 transitions. [2018-11-10 13:38:37,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:37,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 13:38:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:37,697 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:38:37,697 INFO L226 Difference]: Without dead ends: 1148 [2018-11-10 13:38:37,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:37,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-10 13:38:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1108. [2018-11-10 13:38:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1716 transitions. [2018-11-10 13:38:37,762 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1716 transitions. Word has length 182 [2018-11-10 13:38:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:37,762 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1716 transitions. [2018-11-10 13:38:37,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1716 transitions. [2018-11-10 13:38:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-11-10 13:38:37,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:37,763 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, 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, 1, 1, 1] [2018-11-10 13:38:37,763 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:37,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:37,763 INFO L82 PathProgramCache]: Analyzing trace with hash 160239081, now seen corresponding path program 1 times [2018-11-10 13:38:37,764 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 98 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 98 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:37,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:38,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:38,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:38,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:38,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:38,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:38,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:38,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:38,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:38:38,671 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:38,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:38,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:38,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:38,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:38,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:38,676 INFO L87 Difference]: Start difference. First operand 1108 states and 1716 transitions. Second operand 4 states. [2018-11-10 13:38:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:41,358 INFO L93 Difference]: Finished difference Result 2272 states and 3510 transitions. [2018-11-10 13:38:41,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:41,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-11-10 13:38:41,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:41,360 INFO L225 Difference]: With dead ends: 2272 [2018-11-10 13:38:41,360 INFO L226 Difference]: Without dead ends: 1215 [2018-11-10 13:38:41,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2018-11-10 13:38:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1108. [2018-11-10 13:38:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1714 transitions. [2018-11-10 13:38:41,436 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1714 transitions. Word has length 182 [2018-11-10 13:38:41,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:41,436 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1714 transitions. [2018-11-10 13:38:41,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1714 transitions. [2018-11-10 13:38:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:38:41,438 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:41,438 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:41,438 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:41,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1516593682, now seen corresponding path program 1 times [2018-11-10 13:38:41,439 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:41,439 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 99 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 99 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:41,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:42,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:42,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:42,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:42,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:42,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:42,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:42,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:42,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:42,392 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:42,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:42,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:42,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:42,396 INFO L87 Difference]: Start difference. First operand 1108 states and 1714 transitions. Second operand 4 states. [2018-11-10 13:38:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:44,906 INFO L93 Difference]: Finished difference Result 2205 states and 3418 transitions. [2018-11-10 13:38:44,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:44,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 13:38:44,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:44,908 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:38:44,908 INFO L226 Difference]: Without dead ends: 1148 [2018-11-10 13:38:44,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2018-11-10 13:38:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1108. [2018-11-10 13:38:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1712 transitions. [2018-11-10 13:38:44,978 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1712 transitions. Word has length 183 [2018-11-10 13:38:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:44,978 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1712 transitions. [2018-11-10 13:38:44,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:44,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1712 transitions. [2018-11-10 13:38:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:38:44,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:44,979 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:44,980 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:44,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:44,980 INFO L82 PathProgramCache]: Analyzing trace with hash 845994783, now seen corresponding path program 1 times [2018-11-10 13:38:44,980 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:44,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 100 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 100 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:44,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:45,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:45,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:45,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:45,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:45,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:45,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:45,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:45,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:45,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:45,898 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:45,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:45,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:45,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:45,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:45,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:45,903 INFO L87 Difference]: Start difference. First operand 1108 states and 1712 transitions. Second operand 4 states. [2018-11-10 13:38:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:48,534 INFO L93 Difference]: Finished difference Result 2252 states and 3478 transitions. [2018-11-10 13:38:48,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:48,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 13:38:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:48,536 INFO L225 Difference]: With dead ends: 2252 [2018-11-10 13:38:48,536 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 13:38:48,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:48,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 13:38:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1108. [2018-11-10 13:38:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1710 transitions. [2018-11-10 13:38:48,605 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1710 transitions. Word has length 183 [2018-11-10 13:38:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:48,605 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1710 transitions. [2018-11-10 13:38:48,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1710 transitions. [2018-11-10 13:38:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:38:48,607 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:48,607 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:48,607 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:48,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1731171829, now seen corresponding path program 1 times [2018-11-10 13:38:48,608 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:48,608 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 101 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 101 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:48,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:49,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:49,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:49,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:49,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:49,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:49,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:49,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:49,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:49,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:49,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:49,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:49,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:49,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:49,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:49,539 INFO L87 Difference]: Start difference. First operand 1108 states and 1710 transitions. Second operand 4 states. [2018-11-10 13:38:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:52,245 INFO L93 Difference]: Finished difference Result 2252 states and 3474 transitions. [2018-11-10 13:38:52,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:52,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 13:38:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:52,247 INFO L225 Difference]: With dead ends: 2252 [2018-11-10 13:38:52,247 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 13:38:52,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:52,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 13:38:52,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1108. [2018-11-10 13:38:52,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:52,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1708 transitions. [2018-11-10 13:38:52,312 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1708 transitions. Word has length 183 [2018-11-10 13:38:52,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:52,312 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1708 transitions. [2018-11-10 13:38:52,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:52,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1708 transitions. [2018-11-10 13:38:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 13:38:52,314 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:52,314 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, 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, 1, 1, 1] [2018-11-10 13:38:52,314 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:52,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:52,314 INFO L82 PathProgramCache]: Analyzing trace with hash -156623979, now seen corresponding path program 1 times [2018-11-10 13:38:52,315 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 102 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 102 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:52,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:53,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:53,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:53,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:53,207 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:53,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:53,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:38:53,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:53,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:53,242 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:38:53,242 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:53,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:53,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:53,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:53,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:53,247 INFO L87 Difference]: Start difference. First operand 1108 states and 1708 transitions. Second operand 4 states. [2018-11-10 13:38:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:55,881 INFO L93 Difference]: Finished difference Result 2248 states and 3466 transitions. [2018-11-10 13:38:55,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:55,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 13:38:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:55,882 INFO L225 Difference]: With dead ends: 2248 [2018-11-10 13:38:55,882 INFO L226 Difference]: Without dead ends: 1191 [2018-11-10 13:38:55,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-11-10 13:38:55,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1108. [2018-11-10 13:38:55,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2018-11-10 13:38:55,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1706 transitions. [2018-11-10 13:38:55,948 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1706 transitions. Word has length 183 [2018-11-10 13:38:55,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:55,948 INFO L481 AbstractCegarLoop]: Abstraction has 1108 states and 1706 transitions. [2018-11-10 13:38:55,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1706 transitions. [2018-11-10 13:38:55,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 13:38:55,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:55,949 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:55,949 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:55,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1112073010, now seen corresponding path program 1 times [2018-11-10 13:38:55,950 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 103 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 103 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:55,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:38:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:38:56,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:38:56,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:38:56,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:38:56,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:38:56,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:38:56,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-11-10 13:38:56,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:38:56,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:38:56,879 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:38:56,879 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:38:56,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:38:56,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:38:56,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:38:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:38:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:38:56,884 INFO L87 Difference]: Start difference. First operand 1108 states and 1706 transitions. Second operand 4 states. [2018-11-10 13:38:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:38:59,332 INFO L93 Difference]: Finished difference Result 2185 states and 3376 transitions. [2018-11-10 13:38:59,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:38:59,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 13:38:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:38:59,333 INFO L225 Difference]: With dead ends: 2185 [2018-11-10 13:38:59,333 INFO L226 Difference]: Without dead ends: 1128 [2018-11-10 13:38:59,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:38:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-11-10 13:38:59,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1076. [2018-11-10 13:38:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:38:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1662 transitions. [2018-11-10 13:38:59,399 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1662 transitions. Word has length 184 [2018-11-10 13:38:59,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:38:59,400 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1662 transitions. [2018-11-10 13:38:59,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:38:59,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1662 transitions. [2018-11-10 13:38:59,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 13:38:59,401 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:38:59,401 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:38:59,401 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:38:59,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:38:59,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2040263809, now seen corresponding path program 1 times [2018-11-10 13:38:59,402 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:38:59,402 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 104 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 104 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:38:59,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:00,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:00,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:39:00,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:39:00,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:00,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:00,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:00,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,323 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:00,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:39:00,337 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:39:00,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:00,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:39:00,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:39:00,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:39:00,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:39:00,342 INFO L87 Difference]: Start difference. First operand 1076 states and 1662 transitions. Second operand 4 states. [2018-11-10 13:39:02,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:02,966 INFO L93 Difference]: Finished difference Result 2184 states and 3374 transitions. [2018-11-10 13:39:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:39:02,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 13:39:02,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:02,967 INFO L225 Difference]: With dead ends: 2184 [2018-11-10 13:39:02,967 INFO L226 Difference]: Without dead ends: 1159 [2018-11-10 13:39:02,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:39:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-11-10 13:39:03,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1076. [2018-11-10 13:39:03,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:03,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1660 transitions. [2018-11-10 13:39:03,038 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1660 transitions. Word has length 184 [2018-11-10 13:39:03,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:03,039 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1660 transitions. [2018-11-10 13:39:03,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:39:03,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1660 transitions. [2018-11-10 13:39:03,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 13:39:03,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:03,040 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:03,040 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:03,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1660477478, now seen corresponding path program 1 times [2018-11-10 13:39:03,040 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:03,040 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 105 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 105 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:03,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:03,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:03,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:03,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:39:03,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:39:03,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,956 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:03,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:03,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:03,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:03,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:39:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:39:03,990 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:03,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:03,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:39:03,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:39:03,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:39:03,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:39:03,995 INFO L87 Difference]: Start difference. First operand 1076 states and 1660 transitions. Second operand 4 states. [2018-11-10 13:39:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:06,637 INFO L93 Difference]: Finished difference Result 2184 states and 3370 transitions. [2018-11-10 13:39:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:39:06,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 13:39:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:06,638 INFO L225 Difference]: With dead ends: 2184 [2018-11-10 13:39:06,639 INFO L226 Difference]: Without dead ends: 1159 [2018-11-10 13:39:06,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:39:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-11-10 13:39:06,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1076. [2018-11-10 13:39:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1658 transitions. [2018-11-10 13:39:06,709 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1658 transitions. Word has length 185 [2018-11-10 13:39:06,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:06,709 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1658 transitions. [2018-11-10 13:39:06,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:39:06,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1658 transitions. [2018-11-10 13:39:06,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 13:39:06,710 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:06,710 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:06,710 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:06,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:06,711 INFO L82 PathProgramCache]: Analyzing trace with hash 817031162, now seen corresponding path program 1 times [2018-11-10 13:39:06,711 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:06,711 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 106 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 106 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:06,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:07,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:07,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:39:07,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:39:07,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:07,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:07,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:07,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:07,640 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:39:07,659 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:39:07,659 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:07,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:07,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:39:07,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:39:07,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:39:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:39:07,664 INFO L87 Difference]: Start difference. First operand 1076 states and 1658 transitions. Second operand 4 states. [2018-11-10 13:39:10,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:10,249 INFO L93 Difference]: Finished difference Result 2164 states and 3340 transitions. [2018-11-10 13:39:10,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:39:10,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 13:39:10,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:10,251 INFO L225 Difference]: With dead ends: 2164 [2018-11-10 13:39:10,251 INFO L226 Difference]: Without dead ends: 1139 [2018-11-10 13:39:10,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:39:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2018-11-10 13:39:10,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1076. [2018-11-10 13:39:10,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:10,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1656 transitions. [2018-11-10 13:39:10,317 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1656 transitions. Word has length 186 [2018-11-10 13:39:10,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:10,317 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1656 transitions. [2018-11-10 13:39:10,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:39:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1656 transitions. [2018-11-10 13:39:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 13:39:10,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:10,318 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:10,318 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:10,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:10,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1266036436, now seen corresponding path program 1 times [2018-11-10 13:39:10,319 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:10,319 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 107 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 107 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:10,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:11,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:11,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:39:11,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:39:11,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:11,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:11,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:11,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:11,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:39:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:11,279 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:11,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:11,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:39:11,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:39:11,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:39:11,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:39:11,284 INFO L87 Difference]: Start difference. First operand 1076 states and 1656 transitions. Second operand 4 states. [2018-11-10 13:39:13,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:13,884 INFO L93 Difference]: Finished difference Result 2164 states and 3336 transitions. [2018-11-10 13:39:13,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:39:13,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 13:39:13,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:13,885 INFO L225 Difference]: With dead ends: 2164 [2018-11-10 13:39:13,886 INFO L226 Difference]: Without dead ends: 1139 [2018-11-10 13:39:13,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:39:13,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2018-11-10 13:39:13,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1076. [2018-11-10 13:39:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1654 transitions. [2018-11-10 13:39:13,956 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1654 transitions. Word has length 186 [2018-11-10 13:39:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:13,956 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1654 transitions. [2018-11-10 13:39:13,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:39:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1654 transitions. [2018-11-10 13:39:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 13:39:13,957 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:13,957 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:13,957 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:13,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:13,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1056272440, now seen corresponding path program 1 times [2018-11-10 13:39:13,958 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:13,958 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 108 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 108 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:13,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:14,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:14,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:39:14,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:39:14,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 13:39:14,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:14,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:14,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:14,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 13:39:14,917 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:14,917 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:14,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:14,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:39:14,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:39:14,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:39:14,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:39:14,922 INFO L87 Difference]: Start difference. First operand 1076 states and 1654 transitions. Second operand 4 states. [2018-11-10 13:39:17,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:17,473 INFO L93 Difference]: Finished difference Result 2148 states and 3306 transitions. [2018-11-10 13:39:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 13:39:17,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 13:39:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:17,474 INFO L225 Difference]: With dead ends: 2148 [2018-11-10 13:39:17,474 INFO L226 Difference]: Without dead ends: 1123 [2018-11-10 13:39:17,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:39:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1123 states. [2018-11-10 13:39:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1123 to 1076. [2018-11-10 13:39:17,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1652 transitions. [2018-11-10 13:39:17,546 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1652 transitions. Word has length 187 [2018-11-10 13:39:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:17,546 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1652 transitions. [2018-11-10 13:39:17,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:39:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1652 transitions. [2018-11-10 13:39:17,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 13:39:17,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:17,547 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:17,547 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:17,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:17,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1362806304, now seen corresponding path program 1 times [2018-11-10 13:39:17,548 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:17,549 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 109 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 109 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:17,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:19,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:19,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:39:19,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:39:19,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:19,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:19,458 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,468 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,476 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:39:19,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:39:19,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:39:19,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,491 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:39:19,514 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 230 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:19,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:19,534 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:39:19,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:19,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:39:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:19,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:39:19,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:39:19,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:39:19,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:39:19,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:39:19,555 INFO L87 Difference]: Start difference. First operand 1076 states and 1652 transitions. Second operand 9 states. [2018-11-10 13:39:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:22,971 INFO L93 Difference]: Finished difference Result 2493 states and 3793 transitions. [2018-11-10 13:39:22,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:39:22,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2018-11-10 13:39:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:22,973 INFO L225 Difference]: With dead ends: 2493 [2018-11-10 13:39:22,973 INFO L226 Difference]: Without dead ends: 1468 [2018-11-10 13:39:22,973 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:39:22,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2018-11-10 13:39:23,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1076. [2018-11-10 13:39:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2018-11-10 13:39:23,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1644 transitions. [2018-11-10 13:39:23,042 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1644 transitions. Word has length 189 [2018-11-10 13:39:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:23,042 INFO L481 AbstractCegarLoop]: Abstraction has 1076 states and 1644 transitions. [2018-11-10 13:39:23,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:39:23,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1644 transitions. [2018-11-10 13:39:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 13:39:23,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:23,043 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:23,044 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:23,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:23,044 INFO L82 PathProgramCache]: Analyzing trace with hash 876228104, now seen corresponding path program 1 times [2018-11-10 13:39:23,044 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:23,044 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 110 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 110 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:23,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:25,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:25,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:39:25,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:39:25,042 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:25,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:25,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:39:25,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:39:25,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:39:25,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:25,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:39:25,100 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 13:39:25,100 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:25,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:25,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:39:25,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:39:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:39:25,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:39:25,106 INFO L87 Difference]: Start difference. First operand 1076 states and 1644 transitions. Second operand 7 states. [2018-11-10 13:39:26,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:26,078 INFO L93 Difference]: Finished difference Result 2292 states and 3508 transitions. [2018-11-10 13:39:26,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:39:26,079 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2018-11-10 13:39:26,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:26,080 INFO L225 Difference]: With dead ends: 2292 [2018-11-10 13:39:26,080 INFO L226 Difference]: Without dead ends: 1267 [2018-11-10 13:39:26,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:39:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2018-11-10 13:39:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 1100. [2018-11-10 13:39:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-11-10 13:39:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1678 transitions. [2018-11-10 13:39:26,161 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1678 transitions. Word has length 190 [2018-11-10 13:39:26,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:26,161 INFO L481 AbstractCegarLoop]: Abstraction has 1100 states and 1678 transitions. [2018-11-10 13:39:26,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:39:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1678 transitions. [2018-11-10 13:39:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 13:39:26,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:26,162 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:26,163 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:26,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:26,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1700938508, now seen corresponding path program 1 times [2018-11-10 13:39:26,164 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:26,164 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 111 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 111 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:26,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:28,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:28,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:39:28,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:39:28,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 13:39:28,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:28,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:28,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:28,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:28,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:28,200 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:28,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:28,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:28,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:39:28,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:39:28,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:28,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 13:39:28,250 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-10 13:39:28,250 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:28,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:39:28,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:39:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:39:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:39:28,258 INFO L87 Difference]: Start difference. First operand 1100 states and 1678 transitions. Second operand 8 states. [2018-11-10 13:39:33,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:33,243 INFO L93 Difference]: Finished difference Result 2169 states and 3319 transitions. [2018-11-10 13:39:33,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:39:33,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 190 [2018-11-10 13:39:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:33,244 INFO L225 Difference]: With dead ends: 2169 [2018-11-10 13:39:33,244 INFO L226 Difference]: Without dead ends: 1120 [2018-11-10 13:39:33,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:39:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-11-10 13:39:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1118. [2018-11-10 13:39:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-11-10 13:39:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1700 transitions. [2018-11-10 13:39:33,318 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1700 transitions. Word has length 190 [2018-11-10 13:39:33,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:33,318 INFO L481 AbstractCegarLoop]: Abstraction has 1118 states and 1700 transitions. [2018-11-10 13:39:33,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:39:33,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1700 transitions. [2018-11-10 13:39:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-11-10 13:39:33,319 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:33,319 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:33,319 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:33,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:33,320 INFO L82 PathProgramCache]: Analyzing trace with hash -126390658, now seen corresponding path program 1 times [2018-11-10 13:39:33,320 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:33,320 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 112 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 112 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:33,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:35,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:35,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:39:35,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:39:35,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:35,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:35,238 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:39:35,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:39:35,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:39:35,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:39:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 233 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:35,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:35,314 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:39:35,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:35,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:39:35,330 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:39:35,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:39:35,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:39:35,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:39:35,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:39:35,336 INFO L87 Difference]: Start difference. First operand 1118 states and 1700 transitions. Second operand 9 states. [2018-11-10 13:39:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:38,682 INFO L93 Difference]: Finished difference Result 2565 states and 3867 transitions. [2018-11-10 13:39:38,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:39:38,683 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 190 [2018-11-10 13:39:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:38,684 INFO L225 Difference]: With dead ends: 2565 [2018-11-10 13:39:38,685 INFO L226 Difference]: Without dead ends: 1498 [2018-11-10 13:39:38,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:39:38,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2018-11-10 13:39:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1118. [2018-11-10 13:39:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-11-10 13:39:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1692 transitions. [2018-11-10 13:39:38,765 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1692 transitions. Word has length 190 [2018-11-10 13:39:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:38,766 INFO L481 AbstractCegarLoop]: Abstraction has 1118 states and 1692 transitions. [2018-11-10 13:39:38,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:39:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1692 transitions. [2018-11-10 13:39:38,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-11-10 13:39:38,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:38,767 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:38,767 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:38,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:38,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1103030858, now seen corresponding path program 1 times [2018-11-10 13:39:38,768 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:38,768 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 113 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 113 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:38,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:40,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:40,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:39:40,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:39:40,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 13:39:40,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:40,832 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:40,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:40,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:40,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:40,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:40,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,876 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:40,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:39:40,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:39:40,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:40,902 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 13:39:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-11-10 13:39:40,936 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:40,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:40,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:39:40,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:39:40,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:39:40,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:39:40,944 INFO L87 Difference]: Start difference. First operand 1118 states and 1692 transitions. Second operand 8 states. [2018-11-10 13:39:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:41,893 INFO L93 Difference]: Finished difference Result 2205 states and 3347 transitions. [2018-11-10 13:39:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:39:41,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2018-11-10 13:39:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:41,894 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:39:41,894 INFO L226 Difference]: Without dead ends: 1138 [2018-11-10 13:39:41,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:39:41,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-11-10 13:39:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1118. [2018-11-10 13:39:41,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-11-10 13:39:41,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1692 transitions. [2018-11-10 13:39:41,970 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1692 transitions. Word has length 191 [2018-11-10 13:39:41,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:41,970 INFO L481 AbstractCegarLoop]: Abstraction has 1118 states and 1692 transitions. [2018-11-10 13:39:41,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:39:41,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1692 transitions. [2018-11-10 13:39:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-11-10 13:39:41,971 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:41,971 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:41,971 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:41,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:41,971 INFO L82 PathProgramCache]: Analyzing trace with hash 649927887, now seen corresponding path program 1 times [2018-11-10 13:39:41,972 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:41,972 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 114 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 114 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:41,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:44,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:44,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:39:44,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:39:44,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 13:39:44,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:44,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:44,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:44,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:44,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:44,126 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:44,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:44,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:44,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:39:44,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 13:39:44,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:44,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-11-10 13:39:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-11-10 13:39:44,176 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:44,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:44,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:39:44,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:39:44,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:39:44,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:39:44,182 INFO L87 Difference]: Start difference. First operand 1118 states and 1692 transitions. Second operand 8 states. [2018-11-10 13:39:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:45,103 INFO L93 Difference]: Finished difference Result 2205 states and 3347 transitions. [2018-11-10 13:39:45,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:39:45,103 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2018-11-10 13:39:45,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:45,104 INFO L225 Difference]: With dead ends: 2205 [2018-11-10 13:39:45,104 INFO L226 Difference]: Without dead ends: 1138 [2018-11-10 13:39:45,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:39:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2018-11-10 13:39:45,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1118. [2018-11-10 13:39:45,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2018-11-10 13:39:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1692 transitions. [2018-11-10 13:39:45,180 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1692 transitions. Word has length 192 [2018-11-10 13:39:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:45,180 INFO L481 AbstractCegarLoop]: Abstraction has 1118 states and 1692 transitions. [2018-11-10 13:39:45,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:39:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1692 transitions. [2018-11-10 13:39:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 13:39:45,181 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:45,181 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:45,181 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:45,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:45,181 INFO L82 PathProgramCache]: Analyzing trace with hash -445235087, now seen corresponding path program 1 times [2018-11-10 13:39:45,182 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:45,182 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 115 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 115 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:45,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:47,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:47,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 13:39:47,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 13:39:47,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,225 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 13:39:47,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:47,252 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:47,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:47,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:47,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:39:47,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:47,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:47,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:39:47,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 13:39:47,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:39:47,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:47,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 13:39:47,328 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-11-10 13:39:47,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:39:47,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:39:47,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 13:39:47,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 13:39:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 13:39:47,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 13:39:47,334 INFO L87 Difference]: Start difference. First operand 1118 states and 1692 transitions. Second operand 8 states. [2018-11-10 13:39:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:39:52,277 INFO L93 Difference]: Finished difference Result 2187 states and 3323 transitions. [2018-11-10 13:39:52,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:39:52,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2018-11-10 13:39:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:39:52,278 INFO L225 Difference]: With dead ends: 2187 [2018-11-10 13:39:52,278 INFO L226 Difference]: Without dead ends: 1120 [2018-11-10 13:39:52,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 13:39:52,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1120 states. [2018-11-10 13:39:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1120 to 1100. [2018-11-10 13:39:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2018-11-10 13:39:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 1668 transitions. [2018-11-10 13:39:52,352 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 1668 transitions. Word has length 193 [2018-11-10 13:39:52,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:39:52,352 INFO L481 AbstractCegarLoop]: Abstraction has 1100 states and 1668 transitions. [2018-11-10 13:39:52,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 13:39:52,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 1668 transitions. [2018-11-10 13:39:52,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 13:39:52,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:39:52,353 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, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:39:52,353 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:39:52,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:39:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1766664611, now seen corresponding path program 1 times [2018-11-10 13:39:52,353 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:39:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 116 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 116 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:39:52,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:39:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:39:54,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:39:54,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:39:54,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:39:54,416 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:39:54,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:39:54,428 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,434 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:39:54,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:39:54,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:39:54,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:39:54,490 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 224 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:54,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:39:54,521 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:39:54,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:39:54,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 13:39:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:39:54,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:39:54,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:39:54,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:39:54,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:39:54,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:39:54,548 INFO L87 Difference]: Start difference. First operand 1100 states and 1668 transitions. Second operand 9 states. [2018-11-10 13:40:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:00,064 INFO L93 Difference]: Finished difference Result 2575 states and 3887 transitions. [2018-11-10 13:40:00,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:40:00,064 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2018-11-10 13:40:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:00,065 INFO L225 Difference]: With dead ends: 2575 [2018-11-10 13:40:00,065 INFO L226 Difference]: Without dead ends: 1526 [2018-11-10 13:40:00,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 381 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-11-10 13:40:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2018-11-10 13:40:00,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1158. [2018-11-10 13:40:00,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:00,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1758 transitions. [2018-11-10 13:40:00,148 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1758 transitions. Word has length 193 [2018-11-10 13:40:00,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:00,148 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1758 transitions. [2018-11-10 13:40:00,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:40:00,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1758 transitions. [2018-11-10 13:40:00,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 13:40:00,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:00,149 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:00,149 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:00,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:00,149 INFO L82 PathProgramCache]: Analyzing trace with hash 580724385, now seen corresponding path program 1 times [2018-11-10 13:40:00,150 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:00,150 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 117 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 117 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:00,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:02,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:02,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:40:02,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:40:02,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:02,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:40:02,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,114 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,126 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:40:02,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:02,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:02,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:02,166 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 227 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:40:02,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:02,187 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:40:02,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:02,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:40:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 13:40:02,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:40:02,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:40:02,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:40:02,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:40:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:40:02,208 INFO L87 Difference]: Start difference. First operand 1158 states and 1758 transitions. Second operand 9 states. [2018-11-10 13:40:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:07,756 INFO L93 Difference]: Finished difference Result 2593 states and 3905 transitions. [2018-11-10 13:40:07,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:40:07,757 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-11-10 13:40:07,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:07,758 INFO L225 Difference]: With dead ends: 2593 [2018-11-10 13:40:07,758 INFO L226 Difference]: Without dead ends: 1486 [2018-11-10 13:40:07,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:40:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-11-10 13:40:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1158. [2018-11-10 13:40:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1748 transitions. [2018-11-10 13:40:07,846 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1748 transitions. Word has length 194 [2018-11-10 13:40:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:07,846 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1748 transitions. [2018-11-10 13:40:07,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:40:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1748 transitions. [2018-11-10 13:40:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 13:40:07,847 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:07,847 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, 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] [2018-11-10 13:40:07,847 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:07,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:07,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1977686293, now seen corresponding path program 1 times [2018-11-10 13:40:07,848 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 118 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 118 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:07,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:09,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:09,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:40:09,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:40:09,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:40:09,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-11-10 13:40:09,588 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40: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-11-10 13:40:09,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:40:09,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:09,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:09,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:09,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:09,642 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 13:40:09,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:40:09,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:40:09,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:40:09,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:40:09,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:40:09,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:40:09,648 INFO L87 Difference]: Start difference. First operand 1158 states and 1748 transitions. Second operand 7 states. [2018-11-10 13:40:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:12,512 INFO L93 Difference]: Finished difference Result 2310 states and 3490 transitions. [2018-11-10 13:40:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:40:12,512 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2018-11-10 13:40:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:12,513 INFO L225 Difference]: With dead ends: 2310 [2018-11-10 13:40:12,513 INFO L226 Difference]: Without dead ends: 1203 [2018-11-10 13:40:12,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:40:12,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-11-10 13:40:12,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1158. [2018-11-10 13:40:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:12,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1746 transitions. [2018-11-10 13:40:12,592 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1746 transitions. Word has length 194 [2018-11-10 13:40:12,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:12,592 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1746 transitions. [2018-11-10 13:40:12,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:40:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1746 transitions. [2018-11-10 13:40:12,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 13:40:12,593 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:12,593 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, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:12,593 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:12,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:12,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2057836794, now seen corresponding path program 1 times [2018-11-10 13:40:12,593 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:12,594 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 119 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 119 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:12,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:14,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:14,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:40:14,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:40:14,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 13:40:14,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 13:40:14,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:14,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:40:14,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 13:40:14,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:14,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:14,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:14,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:14,452 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 13:40:14,452 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:40:14,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:40:14,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:40:14,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:40:14,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:40:14,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:40:14,458 INFO L87 Difference]: Start difference. First operand 1158 states and 1746 transitions. Second operand 7 states. [2018-11-10 13:40:17,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:17,284 INFO L93 Difference]: Finished difference Result 2298 states and 3470 transitions. [2018-11-10 13:40:17,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:40:17,285 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-11-10 13:40:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:17,286 INFO L225 Difference]: With dead ends: 2298 [2018-11-10 13:40:17,286 INFO L226 Difference]: Without dead ends: 1191 [2018-11-10 13:40:17,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:40:17,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2018-11-10 13:40:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1158. [2018-11-10 13:40:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1744 transitions. [2018-11-10 13:40:17,364 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1744 transitions. Word has length 195 [2018-11-10 13:40:17,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:17,364 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1744 transitions. [2018-11-10 13:40:17,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:40:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1744 transitions. [2018-11-10 13:40:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-10 13:40:17,365 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:17,365 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:17,366 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:17,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2034425783, now seen corresponding path program 1 times [2018-11-10 13:40:17,366 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:17,366 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 120 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 120 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:17,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:19,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:19,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:40:19,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:40:19,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:19,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:40:19,772 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,778 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,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-11-10 13:40:19,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:40:19,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 13:40:19,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 13:40:19,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:19,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 13:40:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 13:40:19,831 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 13:40:19,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:40:19,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 13:40:19,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 13:40:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 13:40:19,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 13:40:19,837 INFO L87 Difference]: Start difference. First operand 1158 states and 1744 transitions. Second operand 7 states. [2018-11-10 13:40:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:22,885 INFO L93 Difference]: Finished difference Result 2394 states and 3598 transitions. [2018-11-10 13:40:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 13:40:22,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2018-11-10 13:40:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:22,886 INFO L225 Difference]: With dead ends: 2394 [2018-11-10 13:40:22,886 INFO L226 Difference]: Without dead ends: 1287 [2018-11-10 13:40:22,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:40:22,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2018-11-10 13:40:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1158. [2018-11-10 13:40:22,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1742 transitions. [2018-11-10 13:40:22,966 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1742 transitions. Word has length 200 [2018-11-10 13:40:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:22,966 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1742 transitions. [2018-11-10 13:40:22,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 13:40:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1742 transitions. [2018-11-10 13:40:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-10 13:40:22,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:22,967 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, 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] [2018-11-10 13:40:22,967 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:22,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1037686882, now seen corresponding path program 1 times [2018-11-10 13:40:22,967 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:22,967 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 121 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 121 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:22,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:24,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:24,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:40:24,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:40:24,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:24,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:40:24,974 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:24,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:24,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:24,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:24,992 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:40:25,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:25,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:25,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:25,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:25,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:25,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 13:40:25,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:25,053 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:40:25,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:25,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:25,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:40:25,077 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 13:40:25,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:40:25,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:40:25,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:40:25,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:40:25,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:40:25,083 INFO L87 Difference]: Start difference. First operand 1158 states and 1742 transitions. Second operand 9 states. [2018-11-10 13:40:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:28,562 INFO L93 Difference]: Finished difference Result 2593 states and 3871 transitions. [2018-11-10 13:40:28,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:40:28,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 201 [2018-11-10 13:40:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:28,564 INFO L225 Difference]: With dead ends: 2593 [2018-11-10 13:40:28,564 INFO L226 Difference]: Without dead ends: 1486 [2018-11-10 13:40:28,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:40:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2018-11-10 13:40:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1158. [2018-11-10 13:40:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:28,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1736 transitions. [2018-11-10 13:40:28,657 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1736 transitions. Word has length 201 [2018-11-10 13:40:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:28,657 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1736 transitions. [2018-11-10 13:40:28,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:40:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1736 transitions. [2018-11-10 13:40:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 13:40:28,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:28,658 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, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:40:28,658 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:28,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1591357093, now seen corresponding path program 1 times [2018-11-10 13:40:28,659 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:28,659 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 122 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 122 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:28,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:30,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:30,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 13:40:30,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 13:40:30,573 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:30,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 13:40:30,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,582 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,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-11-10 13:40:30,594 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 13:40:30,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:30,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:30,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 13:40:30,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:30,658 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:40:30,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:30,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 13:40:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 13:40:30,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:40:30,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 13:40:30,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:40:30,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:40:30,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 13:40:30,681 INFO L87 Difference]: Start difference. First operand 1158 states and 1736 transitions. Second operand 9 states. [2018-11-10 13:40:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:40:34,167 INFO L93 Difference]: Finished difference Result 2587 states and 3850 transitions. [2018-11-10 13:40:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:40:34,167 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 202 [2018-11-10 13:40:34,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:40:34,168 INFO L225 Difference]: With dead ends: 2587 [2018-11-10 13:40:34,169 INFO L226 Difference]: Without dead ends: 1480 [2018-11-10 13:40:34,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 13:40:34,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2018-11-10 13:40:34,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1158. [2018-11-10 13:40:34,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1158 states. [2018-11-10 13:40:34,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 1730 transitions. [2018-11-10 13:40:34,252 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 1730 transitions. Word has length 202 [2018-11-10 13:40:34,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:40:34,252 INFO L481 AbstractCegarLoop]: Abstraction has 1158 states and 1730 transitions. [2018-11-10 13:40:34,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:40:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 1730 transitions. [2018-11-10 13:40:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 13:40:34,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:40:34,253 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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] [2018-11-10 13:40:34,253 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:40:34,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:40:34,253 INFO L82 PathProgramCache]: Analyzing trace with hash -133536364, now seen corresponding path program 1 times [2018-11-10 13:40:34,254 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:40:34,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 123 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 123 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:40:34,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:38,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:38,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:40:38,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:40:39,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:40:39,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:40:39,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:40:39,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:40:39,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:40:39,119 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,142 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,151 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,170 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 13:40:39,227 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 107 treesize of output 78 [2018-11-10 13:40:39,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:40:39,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,259 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,283 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 77 treesize of output 53 [2018-11-10 13:40:39,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:40:39,286 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,313 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 42 treesize of output 47 [2018-11-10 13:40:39,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:40:39,369 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:40:39,398 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:39,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:39,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:39,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:39,492 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 13:40:39,644 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-11-10 13:40:39,651 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 28 [2018-11-10 13:40:39,653 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 28 treesize of output 27 [2018-11-10 13:40:39,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,707 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 49 treesize of output 33 [2018-11-10 13:40:39,710 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 33 treesize of output 9 [2018-11-10 13:40:39,710 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,725 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 13:40:39,743 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 8 treesize of output 6 [2018-11-10 13:40:39,745 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 6 treesize of output 4 [2018-11-10 13:40:39,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 13:40:39,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:39,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:39,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:40:39,851 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:39,914 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 126 treesize of output 98 [2018-11-10 13:40:39,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:40:39,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:39,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:39,950 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 0 case distinctions, treesize of input 97 treesize of output 72 [2018-11-10 13:40:40,008 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:40,197 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 34 treesize of output 54 [2018-11-10 13:40:40,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:40:40,231 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 39 treesize of output 23 [2018-11-10 13:40:40,234 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:40,234 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:40,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 13:40:40,235 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,239 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,242 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 37 treesize of output 29 [2018-11-10 13:40:40,245 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 14 treesize of output 1 [2018-11-10 13:40:40,245 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,280 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 13:40:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:40:40,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:40:40,403 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:40:40,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:40:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:40:40,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:40:40,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:40:40,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:40:40,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:40:40,796 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:40:40,809 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:40:40,827 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,856 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,873 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:40,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:40:40,946 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 20 treesize of output 23 [2018-11-10 13:40:40,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:40:40,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:40,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:40:40,986 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,001 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,012 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,023 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,051 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 13:40:41,163 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 107 treesize of output 78 [2018-11-10 13:40:41,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:40:41,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:41,217 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 77 treesize of output 53 [2018-11-10 13:40:41,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:40:41,220 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:41,244 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 42 treesize of output 47 [2018-11-10 13:40:41,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:40:41,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,383 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 13:40:41,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-10 13:40:41,470 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 28 treesize of output 27 [2018-11-10 13:40:41,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,486 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 50 [2018-11-10 13:40:41,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:41,489 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 50 treesize of output 38 [2018-11-10 13:40:41,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,495 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 13:40:41,509 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:41,509 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 35 treesize of output 30 [2018-11-10 13:40:41,510 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:40:41,516 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 13:40:41,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 13:40:41,526 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 17 treesize of output 9 [2018-11-10 13:40:41,526 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,528 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,535 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 13:40:41,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:40:41,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:40:41,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:40:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:40:41,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:40:41,648 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 128 treesize of output 100 [2018-11-10 13:40:41,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:40:41,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,676 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:40:41,684 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 0 case distinctions, treesize of input 99 treesize of output 74 [2018-11-10 13:40:41,752 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:41,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 13:40:41,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:40:41,843 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 37 treesize of output 29 [2018-11-10 13:40:41,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-10 13:40:41,846 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,853 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 39 treesize of output 23 [2018-11-10 13:40:41,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:41,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:40:41,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 13:40:41,857 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,860 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,871 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:40:41,891 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 13:40:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:40:41,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:40:41,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 13:40:41,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:40:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:40:41,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:40:41,994 INFO L87 Difference]: Start difference. First operand 1158 states and 1730 transitions. Second operand 19 states. [2018-11-10 13:41:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:41:05,416 INFO L93 Difference]: Finished difference Result 7082 states and 10510 transitions. [2018-11-10 13:41:05,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 13:41:05,417 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 203 [2018-11-10 13:41:05,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:41:05,420 INFO L225 Difference]: With dead ends: 7082 [2018-11-10 13:41:05,420 INFO L226 Difference]: Without dead ends: 5975 [2018-11-10 13:41:05,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 793 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 13:41:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5975 states. [2018-11-10 13:41:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5975 to 1312. [2018-11-10 13:41:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1312 states. [2018-11-10 13:41:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1994 transitions. [2018-11-10 13:41:05,536 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1994 transitions. Word has length 203 [2018-11-10 13:41:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:41:05,536 INFO L481 AbstractCegarLoop]: Abstraction has 1312 states and 1994 transitions. [2018-11-10 13:41:05,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:41:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1994 transitions. [2018-11-10 13:41:05,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 13:41:05,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:41:05,538 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 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] [2018-11-10 13:41:05,538 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:41:05,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:41:05,538 INFO L82 PathProgramCache]: Analyzing trace with hash 147586317, now seen corresponding path program 1 times [2018-11-10 13:41:05,538 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:41:05,538 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 125 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 125 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:41:05,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:41:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:10,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:10,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:41:10,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 13:41:10,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:41:10,309 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:41:10,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:41:10,357 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:41:10,363 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,364 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:41:10,373 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,386 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,395 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,424 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 13:41:10,459 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 107 treesize of output 78 [2018-11-10 13:41:10,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:41:10,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,514 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 77 treesize of output 53 [2018-11-10 13:41:10,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:41:10,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:10,546 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 42 treesize of output 47 [2018-11-10 13:41:10,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:41:10,601 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:41:10,624 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:10,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:10,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:10,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:10,708 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 13:41:10,794 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 28 [2018-11-10 13:41:10,797 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 28 treesize of output 27 [2018-11-10 13:41:10,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,816 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 49 treesize of output 33 [2018-11-10 13:41:10,818 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 33 treesize of output 9 [2018-11-10 13:41:10,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,833 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 13:41:10,851 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 8 treesize of output 6 [2018-11-10 13:41:10,852 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 6 treesize of output 4 [2018-11-10 13:41:10,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 13:41:10,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:41:10,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:41:10,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:10,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:41:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:41:10,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:41:11,027 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 128 treesize of output 100 [2018-11-10 13:41:11,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:41:11,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:11,064 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 0 case distinctions, treesize of input 99 treesize of output 74 [2018-11-10 13:41:11,133 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:11,290 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 32 treesize of output 54 [2018-11-10 13:41:11,291 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:41:11,328 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 39 treesize of output 23 [2018-11-10 13:41:11,331 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:11,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:11,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 13:41:11,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,337 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,340 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 37 treesize of output 29 [2018-11-10 13:41:11,344 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 14 treesize of output 1 [2018-11-10 13:41:11,344 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,349 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,381 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 13:41:11,507 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:41:11,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:41:11,513 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 13:41:11,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:41:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:41:11,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:41:11,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 13:41:11,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:41:11,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 13:41:11,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:11,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:41:11,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:11,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:11,947 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:11,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:41:11,966 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:11,989 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 13:41:12,093 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 20 treesize of output 23 [2018-11-10 13:41:12,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 13:41:12,109 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,113 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 13:41:12,122 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,137 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,157 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,188 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 13:41:12,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 13:41:12,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 13:41:12,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,321 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,333 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 77 treesize of output 53 [2018-11-10 13:41:12,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 13:41:12,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,362 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 42 treesize of output 47 [2018-11-10 13:41:12,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 13:41:12,419 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 13:41:12,438 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:12,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:12,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:12,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 13:41:12,509 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 13:41:12,608 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 28 [2018-11-10 13:41:12,610 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 28 treesize of output 27 [2018-11-10 13:41:12,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,627 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 49 treesize of output 33 [2018-11-10 13:41:12,629 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 33 treesize of output 9 [2018-11-10 13:41:12,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,640 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 7 treesize of output 5 [2018-11-10 13:41:12,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,650 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 8 treesize of output 6 [2018-11-10 13:41:12,651 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 6 treesize of output 4 [2018-11-10 13:41:12,651 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,657 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 13:41:12,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 13:41:12,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 13:41:12,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 13:41:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:41:12,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:41:12,806 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 126 treesize of output 98 [2018-11-10 13:41:12,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 13:41:12,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:12,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 13:41:12,842 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 0 case distinctions, treesize of input 97 treesize of output 72 [2018-11-10 13:41:12,914 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:13,253 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 32 treesize of output 54 [2018-11-10 13:41:13,254 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 13:41:13,288 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 39 treesize of output 23 [2018-11-10 13:41:13,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:13,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:41:13,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 13:41:13,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,297 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,300 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 37 treesize of output 29 [2018-11-10 13:41:13,303 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 14 treesize of output 1 [2018-11-10 13:41:13,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,307 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,321 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:41:13,343 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 13:41:13,413 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 13:41:13,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 13:41:13,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 13:41:13,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 13:41:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 13:41:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 13:41:13,434 INFO L87 Difference]: Start difference. First operand 1312 states and 1994 transitions. Second operand 19 states. [2018-11-10 13:41:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:41:43,381 INFO L93 Difference]: Finished difference Result 6698 states and 10065 transitions. [2018-11-10 13:41:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 13:41:43,381 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2018-11-10 13:41:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:41:43,384 INFO L225 Difference]: With dead ends: 6698 [2018-11-10 13:41:43,385 INFO L226 Difference]: Without dead ends: 5437 [2018-11-10 13:41:43,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 825 GetRequests, 795 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-11-10 13:41:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2018-11-10 13:41:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 1306. [2018-11-10 13:41:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2018-11-10 13:41:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1984 transitions. [2018-11-10 13:41:43,499 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1984 transitions. Word has length 204 [2018-11-10 13:41:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:41:43,500 INFO L481 AbstractCegarLoop]: Abstraction has 1306 states and 1984 transitions. [2018-11-10 13:41:43,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 13:41:43,500 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1984 transitions. [2018-11-10 13:41:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 13:41:43,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:41:43,501 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:41:43,501 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:41:43,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:41:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash -312006685, now seen corresponding path program 1 times [2018-11-10 13:41:43,501 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 13:41:43,501 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/cvc4nyu Starting monitored process 127 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 127 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 13:41:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:41:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:41:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 13:41:52,588 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 13:41:52,610 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,611 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,611 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,611 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,612 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,612 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:41:52 BoogieIcfgContainer [2018-11-10 13:41:52,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:41:52,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:41:52,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:41:52,690 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:41:52,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:32:46" (3/4) ... [2018-11-10 13:41:52,693 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,698 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 13:41:52,777 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_73d196db-a2fe-457e-bcac-f23409b13969/bin-2019/utaipan/witness.graphml [2018-11-10 13:41:52,778 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:41:52,778 INFO L168 Benchmark]: Toolchain (without parser) took 550600.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 937.9 MB in the beginning and 962.3 MB in the end (delta: -24.3 MB). Peak memory consumption was 75.8 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,779 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:41:52,779 INFO L168 Benchmark]: CACSL2BoogieTranslator took 696.32 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 770.4 MB in the end (delta: 167.5 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,779 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 770.4 MB in the beginning and 1.1 GB in the end (delta: -338.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,779 INFO L168 Benchmark]: Boogie Preprocessor took 74.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,780 INFO L168 Benchmark]: RCFGBuilder took 3196.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.0 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,780 INFO L168 Benchmark]: TraceAbstraction took 546405.67 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Free memory was 927.0 MB in the beginning and 981.6 MB in the end (delta: -54.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:41:52,780 INFO L168 Benchmark]: Witness Printer took 87.72 ms. Allocated memory is still 1.1 GB. Free memory was 981.6 MB in the beginning and 962.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2018-11-10 13:41:52,781 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 973.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 696.32 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 770.4 MB in the end (delta: 167.5 MB). Peak memory consumption was 167.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 770.4 MB in the beginning and 1.1 GB in the end (delta: -338.1 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3196.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.0 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 546405.67 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -22.5 MB). Free memory was 927.0 MB in the beginning and 981.6 MB in the end (delta: -54.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 87.72 ms. Allocated memory is still 1.1 GB. Free memory was 981.6 MB in the beginning and 962.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 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: 1738]: 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={867785215: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={867785215: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={867785215: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={867785215: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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={867785215:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={867785215: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={867785215: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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={867785215:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={867785215: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 [L1590] CALL, EXPR s->session [L1590] RET, EXPR s->session [L1590] CALL, EXPR s->s3 [L1590] RET, EXPR s->s3 [L1590] CALL, EXPR (s->s3)->tmp.new_cipher [L1590] RET, EXPR (s->s3)->tmp.new_cipher [L1590] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1590] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1591] COND FALSE !(! tmp___9) [L1597] ret = __VERIFIER_nondet_int() [L1598] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={867785215:0}] [L1603] COND FALSE !(ret <= 0) [L1608] CALL s->state = 8672 [L1608] RET s->state = 8672 [L1609] CALL s->init_num = 0 [L1609] RET s->init_num = 0 [L1610] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={867785215:0}] [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={867785215:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={867785215: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 [L1619] ret = __VERIFIER_nondet_int() [L1620] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={867785215:0}] [L1625] COND FALSE !(ret <= 0) [L1630] CALL s->state = 8448 [L1630] RET s->state = 8448 [L1631] CALL s->hit [L1631] RET s->hit [L1631] COND TRUE s->hit [L1632] CALL, EXPR s->s3 [L1632] RET, EXPR s->s3 [L1632] CALL (s->s3)->tmp.next_state = 8640 [L1632] RET (s->s3)->tmp.next_state = 8640 [L1636] CALL s->init_num = 0 [L1636] RET s->init_num = 0 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={867785215:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={867785215: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={867785215: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 [L1697] CALL, EXPR s->s3 [L1697] RET, EXPR s->s3 [L1697] CALL, EXPR (s->s3)->tmp.reuse_message [L1697] RET, EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={867785215:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={867785215: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 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={867785215:0}] [L1738] __VERIFIER_error() VAL [init=1, SSLv3_server_data={867785215:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 162 locations, 1 error locations. UNSAFE Result, 546.3s OverallTime, 123 OverallIterations, 8 TraceHistogramMax, 388.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 22175 SDtfs, 45871 SDslu, 56281 SDs, 0 SdLazy, 51419 SolverSat, 4486 SolverUnsat, 135 SolverUnknown, 0 SolverNotchecked, 360.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19169 GetRequests, 18339 SyntacticMatches, 5 SemanticMatches, 825 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1312occurred in iteration=121, 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: 4.8s AutomataMinimizationTime, 122 MinimizatonAttempts, 19958 StatesRemovedByMinimization, 121 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.5s SsaConstructionTime, 93.5s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 15901 NumberOfCodeBlocks, 15901 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 18805 ConstructedInterpolants, 168 QuantifiedInterpolants, 14464124 SizeOfPredicates, 2150 NumberOfNonLiveVariables, 97803 ConjunctsInSsa, 2350 ConjunctsInUnsatCore, 144 InterpolantComputations, 119 PerfectInterpolantSequences, 19316/21365 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...