./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_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_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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 d06f77684af1a50a152dd1d7247c10847b7d2ace ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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 d06f77684af1a50a152dd1d7247c10847b7d2ace ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 19:59:42,166 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 19:59:42,167 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 19:59:42,178 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 19:59:42,178 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 19:59:42,179 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 19:59:42,180 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 19:59:42,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 19:59:42,184 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 19:59:42,185 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 19:59:42,186 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 19:59:42,186 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 19:59:42,187 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 19:59:42,188 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 19:59:42,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 19:59:42,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 19:59:42,191 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 19:59:42,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 19:59:42,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 19:59:42,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 19:59:42,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 19:59:42,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 19:59:42,199 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 19:59:42,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 19:59:42,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 19:59:42,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 19:59:42,201 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 19:59:42,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 19:59:42,203 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 19:59:42,204 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 19:59:42,204 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 19:59:42,205 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 19:59:42,205 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 19:59:42,205 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 19:59:42,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 19:59:42,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 19:59:42,208 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 19:59:42,220 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 19:59:42,220 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 19:59:42,221 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 19:59:42,221 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 19:59:42,221 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 19:59:42,221 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 19:59:42,222 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 19:59:42,222 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 19:59:42,222 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 19:59:42,222 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 19:59:42,222 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 19:59:42,223 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 19:59:42,223 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 19:59:42,223 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 19:59:42,223 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 19:59:42,223 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 19:59:42,223 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 19:59:42,224 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 19:59:42,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 19:59:42,225 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 19:59:42,225 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 19:59:42,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:59:42,225 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 19:59:42,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 19:59:42,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 19:59:42,226 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 19:59:42,226 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 19:59:42,229 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 19:59:42,229 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 19:59:42,229 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_132ad91e-74b1-40db-a1cb-70b18c6d2484/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-10-26 19:59:42,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 19:59:42,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 19:59:42,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 19:59:42,273 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 19:59:42,273 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 19:59:42,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 19:59:42,321 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/223921172/1dad77009b504b2b8034f03aa9f87b2a/FLAG650dc03b2 [2018-10-26 19:59:42,849 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 19:59:42,850 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 19:59:42,875 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/223921172/1dad77009b504b2b8034f03aa9f87b2a/FLAG650dc03b2 [2018-10-26 19:59:42,891 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/223921172/1dad77009b504b2b8034f03aa9f87b2a [2018-10-26 19:59:42,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 19:59:42,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 19:59:42,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 19:59:42,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 19:59:42,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 19:59:42,900 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:59:42" (1/1) ... [2018-10-26 19:59:42,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7986d6d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:42, skipping insertion in model container [2018-10-26 19:59:42,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 07:59:42" (1/1) ... [2018-10-26 19:59:42,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 19:59:42,998 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 19:59:43,775 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:59:43,790 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 19:59:44,134 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 19:59:44,162 INFO L193 MainTranslator]: Completed translation [2018-10-26 19:59:44,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44 WrapperNode [2018-10-26 19:59:44,163 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 19:59:44,164 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 19:59:44,164 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 19:59:44,164 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 19:59:44,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 19:59:44,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 19:59:44,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 19:59:44,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 19:59:44,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,529 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... [2018-10-26 19:59:44,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 19:59:44,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 19:59:44,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 19:59:44,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 19:59:44,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 19:59:44,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 19:59:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 19:59:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 19:59:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 19:59:44,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 19:59:44,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 19:59:44,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 19:59:44,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 19:59:45,512 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 19:59:45,513 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 19:59:47,419 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 19:59:47,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:59:47 BoogieIcfgContainer [2018-10-26 19:59:47,419 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 19:59:47,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 19:59:47,420 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 19:59:47,424 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 19:59:47,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 07:59:42" (1/3) ... [2018-10-26 19:59:47,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56247baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:59:47, skipping insertion in model container [2018-10-26 19:59:47,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 07:59:44" (2/3) ... [2018-10-26 19:59:47,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56247baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 07:59:47, skipping insertion in model container [2018-10-26 19:59:47,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:59:47" (3/3) ... [2018-10-26 19:59:47,431 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 19:59:47,441 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 19:59:47,454 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 19:59:47,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 19:59:47,517 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 19:59:47,517 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 19:59:47,517 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 19:59:47,517 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 19:59:47,517 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 19:59:47,518 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 19:59:47,518 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 19:59:47,518 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 19:59:47,549 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-10-26 19:59:47,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 19:59:47,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:47,562 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, 1] [2018-10-26 19:59:47,565 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:47,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:47,577 INFO L82 PathProgramCache]: Analyzing trace with hash 283188315, now seen corresponding path program 1 times [2018-10-26 19:59:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:47,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:47,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:47,642 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:48,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:48,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:48,105 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:48,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:48,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:48,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:48,129 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 4 states. [2018-10-26 19:59:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:48,885 INFO L93 Difference]: Finished difference Result 346 states and 581 transitions. [2018-10-26 19:59:48,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:48,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-26 19:59:48,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:48,904 INFO L225 Difference]: With dead ends: 346 [2018-10-26 19:59:48,906 INFO L226 Difference]: Without dead ends: 176 [2018-10-26 19:59:48,911 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-10-26 19:59:48,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-26 19:59:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-10-26 19:59:48,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-26 19:59:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2018-10-26 19:59:48,968 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 49 [2018-10-26 19:59:48,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:48,969 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2018-10-26 19:59:48,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:48,969 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2018-10-26 19:59:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 19:59:48,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:48,972 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, 1] [2018-10-26 19:59:48,972 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:48,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:48,973 INFO L82 PathProgramCache]: Analyzing trace with hash 564877000, now seen corresponding path program 1 times [2018-10-26 19:59:48,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:48,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:48,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:48,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:48,977 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:49,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:49,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:49,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:49,364 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:49,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:49,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:49,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:49,367 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand 4 states. [2018-10-26 19:59:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:50,295 INFO L93 Difference]: Finished difference Result 366 states and 567 transitions. [2018-10-26 19:59:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:50,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-10-26 19:59:50,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:50,298 INFO L225 Difference]: With dead ends: 366 [2018-10-26 19:59:50,298 INFO L226 Difference]: Without dead ends: 233 [2018-10-26 19:59:50,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-26 19:59:50,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 192. [2018-10-26 19:59:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-26 19:59:50,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 303 transitions. [2018-10-26 19:59:50,316 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 303 transitions. Word has length 63 [2018-10-26 19:59:50,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:50,316 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 303 transitions. [2018-10-26 19:59:50,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:50,317 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 303 transitions. [2018-10-26 19:59:50,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 19:59:50,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:50,320 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-10-26 19:59:50,320 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:50,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:50,321 INFO L82 PathProgramCache]: Analyzing trace with hash -715240359, now seen corresponding path program 1 times [2018-10-26 19:59:50,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:50,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:50,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:50,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:50,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:50,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:50,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:50,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:50,524 INFO L87 Difference]: Start difference. First operand 192 states and 303 transitions. Second operand 4 states. [2018-10-26 19:59:51,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:51,247 INFO L93 Difference]: Finished difference Result 487 states and 771 transitions. [2018-10-26 19:59:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:51,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-10-26 19:59:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:51,257 INFO L225 Difference]: With dead ends: 487 [2018-10-26 19:59:51,257 INFO L226 Difference]: Without dead ends: 321 [2018-10-26 19:59:51,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:51,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-26 19:59:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 233. [2018-10-26 19:59:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-26 19:59:51,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 377 transitions. [2018-10-26 19:59:51,280 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 377 transitions. Word has length 64 [2018-10-26 19:59:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:51,281 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 377 transitions. [2018-10-26 19:59:51,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:51,281 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 377 transitions. [2018-10-26 19:59:51,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 19:59:51,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:51,285 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, 1] [2018-10-26 19:59:51,285 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:51,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:51,285 INFO L82 PathProgramCache]: Analyzing trace with hash -937887394, now seen corresponding path program 1 times [2018-10-26 19:59:51,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:51,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:51,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:51,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:51,439 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:51,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:51,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:51,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:51,440 INFO L87 Difference]: Start difference. First operand 233 states and 377 transitions. Second operand 4 states. [2018-10-26 19:59:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:52,130 INFO L93 Difference]: Finished difference Result 568 states and 918 transitions. [2018-10-26 19:59:52,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:52,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-26 19:59:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:52,133 INFO L225 Difference]: With dead ends: 568 [2018-10-26 19:59:52,133 INFO L226 Difference]: Without dead ends: 361 [2018-10-26 19:59:52,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-26 19:59:52,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 274. [2018-10-26 19:59:52,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 19:59:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 452 transitions. [2018-10-26 19:59:52,150 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 452 transitions. Word has length 65 [2018-10-26 19:59:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:52,151 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 452 transitions. [2018-10-26 19:59:52,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:52,151 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 452 transitions. [2018-10-26 19:59:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 19:59:52,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:52,166 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, 1] [2018-10-26 19:59:52,166 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:52,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:52,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1234247792, now seen corresponding path program 1 times [2018-10-26 19:59:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:52,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:52,168 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 19:59:52,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:52,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:52,463 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:52,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:52,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:52,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:52,464 INFO L87 Difference]: Start difference. First operand 274 states and 452 transitions. Second operand 4 states. [2018-10-26 19:59:53,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:53,006 INFO L93 Difference]: Finished difference Result 539 states and 888 transitions. [2018-10-26 19:59:53,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:53,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 19:59:53,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:53,007 INFO L225 Difference]: With dead ends: 539 [2018-10-26 19:59:53,008 INFO L226 Difference]: Without dead ends: 291 [2018-10-26 19:59:53,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:53,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-26 19:59:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 274. [2018-10-26 19:59:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-26 19:59:53,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 451 transitions. [2018-10-26 19:59:53,028 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 451 transitions. Word has length 93 [2018-10-26 19:59:53,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:53,030 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 451 transitions. [2018-10-26 19:59:53,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:53,030 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 451 transitions. [2018-10-26 19:59:53,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 19:59:53,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:53,035 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, 1] [2018-10-26 19:59:53,035 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:53,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:53,035 INFO L82 PathProgramCache]: Analyzing trace with hash 102793569, now seen corresponding path program 1 times [2018-10-26 19:59:53,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:53,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:53,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:53,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:53,037 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:53,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:53,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:53,285 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:53,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:53,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:53,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:53,286 INFO L87 Difference]: Start difference. First operand 274 states and 451 transitions. Second operand 4 states. [2018-10-26 19:59:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:54,529 INFO L93 Difference]: Finished difference Result 687 states and 1135 transitions. [2018-10-26 19:59:54,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:54,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 19:59:54,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:54,532 INFO L225 Difference]: With dead ends: 687 [2018-10-26 19:59:54,532 INFO L226 Difference]: Without dead ends: 439 [2018-10-26 19:59:54,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-26 19:59:54,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 340. [2018-10-26 19:59:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-26 19:59:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 569 transitions. [2018-10-26 19:59:54,547 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 569 transitions. Word has length 94 [2018-10-26 19:59:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:54,547 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 569 transitions. [2018-10-26 19:59:54,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 569 transitions. [2018-10-26 19:59:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 19:59:54,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:54,549 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, 1] [2018-10-26 19:59:54,549 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:54,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1987076052, now seen corresponding path program 1 times [2018-10-26 19:59:54,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:54,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:54,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:54,553 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 19:59:54,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:54,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:54,687 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:54,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:54,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:54,688 INFO L87 Difference]: Start difference. First operand 340 states and 569 transitions. Second operand 4 states. [2018-10-26 19:59:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:55,636 INFO L93 Difference]: Finished difference Result 669 states and 1121 transitions. [2018-10-26 19:59:55,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:55,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 19:59:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:55,639 INFO L225 Difference]: With dead ends: 669 [2018-10-26 19:59:55,639 INFO L226 Difference]: Without dead ends: 355 [2018-10-26 19:59:55,640 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-10-26 19:59:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-26 19:59:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 340. [2018-10-26 19:59:55,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-26 19:59:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 568 transitions. [2018-10-26 19:59:55,655 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 568 transitions. Word has length 94 [2018-10-26 19:59:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:55,657 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 568 transitions. [2018-10-26 19:59:55,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 568 transitions. [2018-10-26 19:59:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:59:55,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:55,660 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, 1] [2018-10-26 19:59:55,661 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:55,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:55,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1115795125, now seen corresponding path program 1 times [2018-10-26 19:59:55,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:55,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:55,662 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-26 19:59:55,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:55,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 19:59:55,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:55,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 19:59:55,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 19:59:55,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:55,823 INFO L87 Difference]: Start difference. First operand 340 states and 568 transitions. Second operand 3 states. [2018-10-26 19:59:56,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:56,214 INFO L93 Difference]: Finished difference Result 964 states and 1629 transitions. [2018-10-26 19:59:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 19:59:56,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-10-26 19:59:56,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:56,217 INFO L225 Difference]: With dead ends: 964 [2018-10-26 19:59:56,218 INFO L226 Difference]: Without dead ends: 650 [2018-10-26 19:59:56,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 19:59:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-26 19:59:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2018-10-26 19:59:56,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-10-26 19:59:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1080 transitions. [2018-10-26 19:59:56,243 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1080 transitions. Word has length 100 [2018-10-26 19:59:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:56,243 INFO L481 AbstractCegarLoop]: Abstraction has 648 states and 1080 transitions. [2018-10-26 19:59:56,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 19:59:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1080 transitions. [2018-10-26 19:59:56,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 19:59:56,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:56,247 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, 1] [2018-10-26 19:59:56,247 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:56,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:56,247 INFO L82 PathProgramCache]: Analyzing trace with hash -692148403, now seen corresponding path program 1 times [2018-10-26 19:59:56,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:56,249 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:56,482 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:56,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:56,483 INFO L87 Difference]: Start difference. First operand 648 states and 1080 transitions. Second operand 4 states. [2018-10-26 19:59:57,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:57,811 INFO L93 Difference]: Finished difference Result 1521 states and 2501 transitions. [2018-10-26 19:59:57,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:57,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 19:59:57,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:57,814 INFO L225 Difference]: With dead ends: 1521 [2018-10-26 19:59:57,814 INFO L226 Difference]: Without dead ends: 899 [2018-10-26 19:59:57,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:57,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-10-26 19:59:57,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 724. [2018-10-26 19:59:57,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-26 19:59:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1214 transitions. [2018-10-26 19:59:57,836 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1214 transitions. Word has length 100 [2018-10-26 19:59:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:57,837 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1214 transitions. [2018-10-26 19:59:57,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:57,837 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1214 transitions. [2018-10-26 19:59:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 19:59:57,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:57,841 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, 1] [2018-10-26 19:59:57,841 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:57,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1553143090, now seen corresponding path program 1 times [2018-10-26 19:59:57,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:57,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:57,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:57,843 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:58,061 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 19:59:58,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:58,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:58,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:58,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:58,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:58,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:58,063 INFO L87 Difference]: Start difference. First operand 724 states and 1214 transitions. Second operand 4 states. [2018-10-26 19:59:59,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:59,021 INFO L93 Difference]: Finished difference Result 1591 states and 2623 transitions. [2018-10-26 19:59:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:59,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-10-26 19:59:59,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:59,027 INFO L225 Difference]: With dead ends: 1591 [2018-10-26 19:59:59,027 INFO L226 Difference]: Without dead ends: 893 [2018-10-26 19:59:59,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:59,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-26 19:59:59,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 724. [2018-10-26 19:59:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-26 19:59:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1210 transitions. [2018-10-26 19:59:59,053 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1210 transitions. Word has length 101 [2018-10-26 19:59:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:59,053 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1210 transitions. [2018-10-26 19:59:59,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1210 transitions. [2018-10-26 19:59:59,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 19:59:59,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:59,058 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, 1] [2018-10-26 19:59:59,058 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:59,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:59,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1654819470, now seen corresponding path program 1 times [2018-10-26 19:59:59,059 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:59,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:59,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:59,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:59,060 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 19:59:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 19:59:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 19:59:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 19:59:59,281 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 19:59:59,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 19:59:59,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 19:59:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 19:59:59,282 INFO L87 Difference]: Start difference. First operand 724 states and 1210 transitions. Second operand 4 states. [2018-10-26 19:59:59,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 19:59:59,776 INFO L93 Difference]: Finished difference Result 1436 states and 2402 transitions. [2018-10-26 19:59:59,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 19:59:59,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-26 19:59:59,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 19:59:59,779 INFO L225 Difference]: With dead ends: 1436 [2018-10-26 19:59:59,779 INFO L226 Difference]: Without dead ends: 738 [2018-10-26 19:59:59,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 19:59:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-10-26 19:59:59,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 724. [2018-10-26 19:59:59,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-10-26 19:59:59,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1209 transitions. [2018-10-26 19:59:59,801 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1209 transitions. Word has length 108 [2018-10-26 19:59:59,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 19:59:59,803 INFO L481 AbstractCegarLoop]: Abstraction has 724 states and 1209 transitions. [2018-10-26 19:59:59,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 19:59:59,803 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1209 transitions. [2018-10-26 19:59:59,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 19:59:59,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 19:59:59,805 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, 1] [2018-10-26 19:59:59,806 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 19:59:59,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 19:59:59,806 INFO L82 PathProgramCache]: Analyzing trace with hash -927934174, now seen corresponding path program 1 times [2018-10-26 19:59:59,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 19:59:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:59,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 19:59:59,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 19:59:59,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 19:59:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-10-26 20:00:00,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:00,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-26 20:00:00,057 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:00,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-26 20:00:00,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-26 20:00:00,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:00,059 INFO L87 Difference]: Start difference. First operand 724 states and 1209 transitions. Second operand 5 states. [2018-10-26 20:00:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:00,423 INFO L93 Difference]: Finished difference Result 1442 states and 2410 transitions. [2018-10-26 20:00:00,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:00:00,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-26 20:00:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:00,426 INFO L225 Difference]: With dead ends: 1442 [2018-10-26 20:00:00,426 INFO L226 Difference]: Without dead ends: 744 [2018-10-26 20:00:00,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:00:00,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-26 20:00:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 742. [2018-10-26 20:00:00,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2018-10-26 20:00:00,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1219 transitions. [2018-10-26 20:00:00,481 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1219 transitions. Word has length 108 [2018-10-26 20:00:00,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:00,481 INFO L481 AbstractCegarLoop]: Abstraction has 742 states and 1219 transitions. [2018-10-26 20:00:00,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-26 20:00:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1219 transitions. [2018-10-26 20:00:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:00:00,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:00,486 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, 1] [2018-10-26 20:00:00,486 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:00,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1892658906, now seen corresponding path program 1 times [2018-10-26 20:00:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:00,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:00,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:00,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:00,491 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:00,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:00,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:00,724 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:00,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:00,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:00,726 INFO L87 Difference]: Start difference. First operand 742 states and 1219 transitions. Second operand 4 states. [2018-10-26 20:00:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:02,182 INFO L93 Difference]: Finished difference Result 1707 states and 2770 transitions. [2018-10-26 20:00:02,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:02,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-26 20:00:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:02,186 INFO L225 Difference]: With dead ends: 1707 [2018-10-26 20:00:02,186 INFO L226 Difference]: Without dead ends: 991 [2018-10-26 20:00:02,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:02,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2018-10-26 20:00:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 776. [2018-10-26 20:00:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-10-26 20:00:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1261 transitions. [2018-10-26 20:00:02,216 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1261 transitions. Word has length 108 [2018-10-26 20:00:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:02,216 INFO L481 AbstractCegarLoop]: Abstraction has 776 states and 1261 transitions. [2018-10-26 20:00:02,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1261 transitions. [2018-10-26 20:00:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:00:02,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:02,221 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, 1] [2018-10-26 20:00:02,221 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:02,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:02,221 INFO L82 PathProgramCache]: Analyzing trace with hash 632335343, now seen corresponding path program 1 times [2018-10-26 20:00:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:02,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:02,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:02,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:02,223 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:02,434 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:02,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:02,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:02,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:02,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:02,435 INFO L87 Difference]: Start difference. First operand 776 states and 1261 transitions. Second operand 4 states. [2018-10-26 20:00:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:03,166 INFO L93 Difference]: Finished difference Result 1775 states and 2852 transitions. [2018-10-26 20:00:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:03,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-10-26 20:00:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:03,170 INFO L225 Difference]: With dead ends: 1775 [2018-10-26 20:00:03,170 INFO L226 Difference]: Without dead ends: 1025 [2018-10-26 20:00:03,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2018-10-26 20:00:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 864. [2018-10-26 20:00:03,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-10-26 20:00:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1409 transitions. [2018-10-26 20:00:03,201 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1409 transitions. Word has length 109 [2018-10-26 20:00:03,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:03,201 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 1409 transitions. [2018-10-26 20:00:03,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:03,201 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1409 transitions. [2018-10-26 20:00:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:00:03,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:03,205 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, 1] [2018-10-26 20:00:03,206 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:03,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash 457751074, now seen corresponding path program 1 times [2018-10-26 20:00:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:03,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:03,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:03,207 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:03,408 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:03,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:03,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:03,409 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:03,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:03,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:03,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:03,411 INFO L87 Difference]: Start difference. First operand 864 states and 1409 transitions. Second operand 4 states. [2018-10-26 20:00:03,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:03,791 INFO L93 Difference]: Finished difference Result 1869 states and 3010 transitions. [2018-10-26 20:00:03,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:03,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-10-26 20:00:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:03,795 INFO L225 Difference]: With dead ends: 1869 [2018-10-26 20:00:03,795 INFO L226 Difference]: Without dead ends: 1031 [2018-10-26 20:00:03,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2018-10-26 20:00:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 864. [2018-10-26 20:00:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 864 states. [2018-10-26 20:00:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1395 transitions. [2018-10-26 20:00:03,825 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1395 transitions. Word has length 109 [2018-10-26 20:00:03,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:03,825 INFO L481 AbstractCegarLoop]: Abstraction has 864 states and 1395 transitions. [2018-10-26 20:00:03,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1395 transitions. [2018-10-26 20:00:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 20:00:03,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:03,831 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, 1, 1] [2018-10-26 20:00:03,831 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:03,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320162, now seen corresponding path program 1 times [2018-10-26 20:00:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:03,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:03,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:03,833 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:04,061 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:00:04,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:04,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:04,062 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:04,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:04,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:04,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:04,063 INFO L87 Difference]: Start difference. First operand 864 states and 1395 transitions. Second operand 4 states. [2018-10-26 20:00:04,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:04,862 INFO L93 Difference]: Finished difference Result 1869 states and 2982 transitions. [2018-10-26 20:00:04,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:04,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 20:00:04,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:04,865 INFO L225 Difference]: With dead ends: 1869 [2018-10-26 20:00:04,865 INFO L226 Difference]: Without dead ends: 1027 [2018-10-26 20:00:04,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2018-10-26 20:00:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 868. [2018-10-26 20:00:04,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-10-26 20:00:04,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1401 transitions. [2018-10-26 20:00:04,896 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1401 transitions. Word has length 110 [2018-10-26 20:00:04,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:04,896 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 1401 transitions. [2018-10-26 20:00:04,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:04,896 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1401 transitions. [2018-10-26 20:00:04,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 20:00:04,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:04,900 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, 1] [2018-10-26 20:00:04,901 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:04,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:04,901 INFO L82 PathProgramCache]: Analyzing trace with hash -247266505, now seen corresponding path program 1 times [2018-10-26 20:00:04,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:04,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:04,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:04,902 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:05,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:05,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:05,112 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:05,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:05,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:05,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:05,113 INFO L87 Difference]: Start difference. First operand 868 states and 1401 transitions. Second operand 4 states. [2018-10-26 20:00:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:06,862 INFO L93 Difference]: Finished difference Result 1955 states and 3122 transitions. [2018-10-26 20:00:06,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:06,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-10-26 20:00:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:06,865 INFO L225 Difference]: With dead ends: 1955 [2018-10-26 20:00:06,865 INFO L226 Difference]: Without dead ends: 1113 [2018-10-26 20:00:06,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:06,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2018-10-26 20:00:06,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 930. [2018-10-26 20:00:06,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-10-26 20:00:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1493 transitions. [2018-10-26 20:00:06,900 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1493 transitions. Word has length 122 [2018-10-26 20:00:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:06,900 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1493 transitions. [2018-10-26 20:00:06,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:06,900 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1493 transitions. [2018-10-26 20:00:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 20:00:06,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:06,903 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, 1] [2018-10-26 20:00:06,905 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:06,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:06,906 INFO L82 PathProgramCache]: Analyzing trace with hash -763639777, now seen corresponding path program 1 times [2018-10-26 20:00:06,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:06,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:06,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:06,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:06,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:07,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:07,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:07,040 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:07,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:07,041 INFO L87 Difference]: Start difference. First operand 930 states and 1493 transitions. Second operand 4 states. [2018-10-26 20:00:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:07,437 INFO L93 Difference]: Finished difference Result 1993 states and 3164 transitions. [2018-10-26 20:00:07,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:07,438 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-10-26 20:00:07,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:07,440 INFO L225 Difference]: With dead ends: 1993 [2018-10-26 20:00:07,441 INFO L226 Difference]: Without dead ends: 1089 [2018-10-26 20:00:07,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2018-10-26 20:00:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 930. [2018-10-26 20:00:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2018-10-26 20:00:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 1479 transitions. [2018-10-26 20:00:07,474 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 1479 transitions. Word has length 123 [2018-10-26 20:00:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:07,475 INFO L481 AbstractCegarLoop]: Abstraction has 930 states and 1479 transitions. [2018-10-26 20:00:07,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 1479 transitions. [2018-10-26 20:00:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 20:00:07,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:07,480 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, 1] [2018-10-26 20:00:07,480 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:07,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1064874668, now seen corresponding path program 1 times [2018-10-26 20:00:07,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:07,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:07,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:07,486 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:07,605 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:07,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:07,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:07,605 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:07,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:07,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:07,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:07,606 INFO L87 Difference]: Start difference. First operand 930 states and 1479 transitions. Second operand 4 states. [2018-10-26 20:00:08,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:08,145 INFO L93 Difference]: Finished difference Result 2079 states and 3274 transitions. [2018-10-26 20:00:08,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:08,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-10-26 20:00:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:08,148 INFO L225 Difference]: With dead ends: 2079 [2018-10-26 20:00:08,148 INFO L226 Difference]: Without dead ends: 1175 [2018-10-26 20:00:08,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2018-10-26 20:00:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 988. [2018-10-26 20:00:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-26 20:00:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1561 transitions. [2018-10-26 20:00:08,183 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1561 transitions. Word has length 126 [2018-10-26 20:00:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:08,183 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1561 transitions. [2018-10-26 20:00:08,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1561 transitions. [2018-10-26 20:00:08,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:00:08,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:08,188 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, 1] [2018-10-26 20:00:08,188 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:08,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:08,189 INFO L82 PathProgramCache]: Analyzing trace with hash -838401316, now seen corresponding path program 1 times [2018-10-26 20:00:08,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:08,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:08,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:08,190 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-10-26 20:00:08,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:08,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:08,405 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:08,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:08,407 INFO L87 Difference]: Start difference. First operand 988 states and 1561 transitions. Second operand 4 states. [2018-10-26 20:00:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:08,875 INFO L93 Difference]: Finished difference Result 2109 states and 3300 transitions. [2018-10-26 20:00:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:08,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-10-26 20:00:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:08,878 INFO L225 Difference]: With dead ends: 2109 [2018-10-26 20:00:08,879 INFO L226 Difference]: Without dead ends: 1147 [2018-10-26 20:00:08,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:08,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states. [2018-10-26 20:00:08,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 988. [2018-10-26 20:00:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-10-26 20:00:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1545 transitions. [2018-10-26 20:00:08,916 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1545 transitions. Word has length 127 [2018-10-26 20:00:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:08,916 INFO L481 AbstractCegarLoop]: Abstraction has 988 states and 1545 transitions. [2018-10-26 20:00:08,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:08,917 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1545 transitions. [2018-10-26 20:00:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 20:00:08,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:08,921 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, 1] [2018-10-26 20:00:08,921 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:08,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1452075573, now seen corresponding path program 1 times [2018-10-26 20:00:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:08,923 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:00:09,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:09,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:09,114 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:09,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:09,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:09,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:09,115 INFO L87 Difference]: Start difference. First operand 988 states and 1545 transitions. Second operand 4 states. [2018-10-26 20:00:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:09,483 INFO L93 Difference]: Finished difference Result 2195 states and 3402 transitions. [2018-10-26 20:00:09,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:09,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2018-10-26 20:00:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:09,487 INFO L225 Difference]: With dead ends: 2195 [2018-10-26 20:00:09,487 INFO L226 Difference]: Without dead ends: 1233 [2018-10-26 20:00:09,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:09,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2018-10-26 20:00:09,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1060. [2018-10-26 20:00:09,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-10-26 20:00:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1653 transitions. [2018-10-26 20:00:09,517 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1653 transitions. Word has length 134 [2018-10-26 20:00:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:09,517 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1653 transitions. [2018-10-26 20:00:09,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:09,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1653 transitions. [2018-10-26 20:00:09,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:00:09,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:09,520 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, 1] [2018-10-26 20:00:09,520 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:09,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:09,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1504969438, now seen corresponding path program 1 times [2018-10-26 20:00:09,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:09,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:09,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:09,522 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:09,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-26 20:00:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:09,665 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:09,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:09,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:09,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:09,668 INFO L87 Difference]: Start difference. First operand 1060 states and 1653 transitions. Second operand 4 states. [2018-10-26 20:00:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:10,080 INFO L93 Difference]: Finished difference Result 2253 states and 3484 transitions. [2018-10-26 20:00:10,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:10,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-10-26 20:00:10,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:10,092 INFO L225 Difference]: With dead ends: 2253 [2018-10-26 20:00:10,092 INFO L226 Difference]: Without dead ends: 1219 [2018-10-26 20:00:10,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:10,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-10-26 20:00:10,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1060. [2018-10-26 20:00:10,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2018-10-26 20:00:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1645 transitions. [2018-10-26 20:00:10,137 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1645 transitions. Word has length 135 [2018-10-26 20:00:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:10,137 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1645 transitions. [2018-10-26 20:00:10,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1645 transitions. [2018-10-26 20:00:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-26 20:00:10,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:10,140 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, 1, 1, 1] [2018-10-26 20:00:10,140 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:10,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:10,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1800358016, now seen corresponding path program 1 times [2018-10-26 20:00:10,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:10,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:10,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:10,145 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:10,336 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:00:10,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:10,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:10,336 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:10,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:10,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:10,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:10,338 INFO L87 Difference]: Start difference. First operand 1060 states and 1645 transitions. Second operand 4 states. [2018-10-26 20:00:10,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:10,956 INFO L93 Difference]: Finished difference Result 2342 states and 3601 transitions. [2018-10-26 20:00:10,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:10,957 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-10-26 20:00:10,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:10,960 INFO L225 Difference]: With dead ends: 2342 [2018-10-26 20:00:10,960 INFO L226 Difference]: Without dead ends: 1308 [2018-10-26 20:00:10,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:10,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-10-26 20:00:11,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1147. [2018-10-26 20:00:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-10-26 20:00:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1772 transitions. [2018-10-26 20:00:11,005 INFO L78 Accepts]: Start accepts. Automaton has 1147 states and 1772 transitions. Word has length 152 [2018-10-26 20:00:11,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:11,005 INFO L481 AbstractCegarLoop]: Abstraction has 1147 states and 1772 transitions. [2018-10-26 20:00:11,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:11,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1147 states and 1772 transitions. [2018-10-26 20:00:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-26 20:00:11,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:11,010 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, 1, 1, 1] [2018-10-26 20:00:11,011 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:11,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash 98777869, now seen corresponding path program 1 times [2018-10-26 20:00:11,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:11,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:11,229 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:00:11,230 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:11,231 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:11,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:11,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:11,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:11,232 INFO L87 Difference]: Start difference. First operand 1147 states and 1772 transitions. Second operand 4 states. [2018-10-26 20:00:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:11,716 INFO L93 Difference]: Finished difference Result 2427 states and 3722 transitions. [2018-10-26 20:00:11,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:11,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-10-26 20:00:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:11,720 INFO L225 Difference]: With dead ends: 2427 [2018-10-26 20:00:11,720 INFO L226 Difference]: Without dead ends: 1290 [2018-10-26 20:00:11,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-10-26 20:00:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1131. [2018-10-26 20:00:11,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1131 states. [2018-10-26 20:00:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1744 transitions. [2018-10-26 20:00:11,749 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1744 transitions. Word has length 153 [2018-10-26 20:00:11,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:11,750 INFO L481 AbstractCegarLoop]: Abstraction has 1131 states and 1744 transitions. [2018-10-26 20:00:11,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1744 transitions. [2018-10-26 20:00:11,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 20:00:11,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:11,752 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, 1] [2018-10-26 20:00:11,752 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:11,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 852159294, now seen corresponding path program 1 times [2018-10-26 20:00:11,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:11,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:11,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 20:00:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:11,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:11,922 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:11,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:11,923 INFO L87 Difference]: Start difference. First operand 1131 states and 1744 transitions. Second operand 4 states. [2018-10-26 20:00:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:12,263 INFO L93 Difference]: Finished difference Result 2465 states and 3776 transitions. [2018-10-26 20:00:12,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:12,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-26 20:00:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:12,266 INFO L225 Difference]: With dead ends: 2465 [2018-10-26 20:00:12,267 INFO L226 Difference]: Without dead ends: 1360 [2018-10-26 20:00:12,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:12,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2018-10-26 20:00:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1185. [2018-10-26 20:00:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-10-26 20:00:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1812 transitions. [2018-10-26 20:00:12,290 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1812 transitions. Word has length 155 [2018-10-26 20:00:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:12,290 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1812 transitions. [2018-10-26 20:00:12,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1812 transitions. [2018-10-26 20:00:12,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-26 20:00:12,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:12,292 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, 1] [2018-10-26 20:00:12,293 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:12,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:12,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1074902506, now seen corresponding path program 1 times [2018-10-26 20:00:12,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:12,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:12,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:12,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-26 20:00:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:12,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:12,538 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:12,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:12,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:12,540 INFO L87 Difference]: Start difference. First operand 1185 states and 1812 transitions. Second operand 4 states. [2018-10-26 20:00:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:12,959 INFO L93 Difference]: Finished difference Result 2503 states and 3802 transitions. [2018-10-26 20:00:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:12,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-10-26 20:00:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:12,966 INFO L225 Difference]: With dead ends: 2503 [2018-10-26 20:00:12,966 INFO L226 Difference]: Without dead ends: 1344 [2018-10-26 20:00:12,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2018-10-26 20:00:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1185. [2018-10-26 20:00:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2018-10-26 20:00:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1790 transitions. [2018-10-26 20:00:13,009 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1790 transitions. Word has length 156 [2018-10-26 20:00:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:13,009 INFO L481 AbstractCegarLoop]: Abstraction has 1185 states and 1790 transitions. [2018-10-26 20:00:13,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1790 transitions. [2018-10-26 20:00:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:00:13,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:13,013 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, 1] [2018-10-26 20:00:13,014 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:13,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -618930505, now seen corresponding path program 1 times [2018-10-26 20:00:13,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:13,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:13,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:13,015 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:13,144 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 20:00:13,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:13,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:13,144 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:13,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:13,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:13,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:13,145 INFO L87 Difference]: Start difference. First operand 1185 states and 1790 transitions. Second operand 4 states. [2018-10-26 20:00:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:13,454 INFO L93 Difference]: Finished difference Result 2573 states and 3866 transitions. [2018-10-26 20:00:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:13,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2018-10-26 20:00:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:13,458 INFO L225 Difference]: With dead ends: 2573 [2018-10-26 20:00:13,458 INFO L226 Difference]: Without dead ends: 1414 [2018-10-26 20:00:13,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2018-10-26 20:00:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1253. [2018-10-26 20:00:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1253 states. [2018-10-26 20:00:13,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1884 transitions. [2018-10-26 20:00:13,492 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1884 transitions. Word has length 169 [2018-10-26 20:00:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:13,492 INFO L481 AbstractCegarLoop]: Abstraction has 1253 states and 1884 transitions. [2018-10-26 20:00:13,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1884 transitions. [2018-10-26 20:00:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 20:00:13,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:13,494 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, 1] [2018-10-26 20:00:13,494 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:13,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:13,494 INFO L82 PathProgramCache]: Analyzing trace with hash 29223242, now seen corresponding path program 1 times [2018-10-26 20:00:13,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:13,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:13,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:13,495 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-26 20:00:13,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:13,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:13,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:13,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:13,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:13,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:13,691 INFO L87 Difference]: Start difference. First operand 1253 states and 1884 transitions. Second operand 4 states. [2018-10-26 20:00:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:14,216 INFO L93 Difference]: Finished difference Result 2639 states and 3946 transitions. [2018-10-26 20:00:14,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:14,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-10-26 20:00:14,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:14,220 INFO L225 Difference]: With dead ends: 2639 [2018-10-26 20:00:14,220 INFO L226 Difference]: Without dead ends: 1394 [2018-10-26 20:00:14,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2018-10-26 20:00:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1169. [2018-10-26 20:00:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-10-26 20:00:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1744 transitions. [2018-10-26 20:00:14,254 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1744 transitions. Word has length 170 [2018-10-26 20:00:14,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:14,254 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1744 transitions. [2018-10-26 20:00:14,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1744 transitions. [2018-10-26 20:00:14,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-26 20:00:14,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:14,256 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, 1, 1, 1] [2018-10-26 20:00:14,257 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:14,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:14,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1063015321, now seen corresponding path program 1 times [2018-10-26 20:00:14,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:14,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:14,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:14,258 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 20:00:14,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:14,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:14,504 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:14,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:14,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:14,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:14,507 INFO L87 Difference]: Start difference. First operand 1169 states and 1744 transitions. Second operand 4 states. [2018-10-26 20:00:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:15,108 INFO L93 Difference]: Finished difference Result 2497 states and 3708 transitions. [2018-10-26 20:00:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:15,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2018-10-26 20:00:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:15,111 INFO L225 Difference]: With dead ends: 2497 [2018-10-26 20:00:15,111 INFO L226 Difference]: Without dead ends: 1354 [2018-10-26 20:00:15,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-10-26 20:00:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1192. [2018-10-26 20:00:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-10-26 20:00:15,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1757 transitions. [2018-10-26 20:00:15,148 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1757 transitions. Word has length 175 [2018-10-26 20:00:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:15,148 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1757 transitions. [2018-10-26 20:00:15,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1757 transitions. [2018-10-26 20:00:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 20:00:15,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:15,152 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, 1, 1, 1] [2018-10-26 20:00:15,153 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:15,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:15,153 INFO L82 PathProgramCache]: Analyzing trace with hash -129182209, now seen corresponding path program 1 times [2018-10-26 20:00:15,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:15,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:15,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,154 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 20:00:15,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:15,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:15,346 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:15,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:15,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:15,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:15,347 INFO L87 Difference]: Start difference. First operand 1192 states and 1757 transitions. Second operand 4 states. [2018-10-26 20:00:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:15,896 INFO L93 Difference]: Finished difference Result 2513 states and 3687 transitions. [2018-10-26 20:00:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:15,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 176 [2018-10-26 20:00:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:15,899 INFO L225 Difference]: With dead ends: 2513 [2018-10-26 20:00:15,899 INFO L226 Difference]: Without dead ends: 1347 [2018-10-26 20:00:15,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-10-26 20:00:15,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1192. [2018-10-26 20:00:15,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2018-10-26 20:00:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1733 transitions. [2018-10-26 20:00:15,930 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1733 transitions. Word has length 176 [2018-10-26 20:00:15,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:15,930 INFO L481 AbstractCegarLoop]: Abstraction has 1192 states and 1733 transitions. [2018-10-26 20:00:15,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:15,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1733 transitions. [2018-10-26 20:00:15,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-26 20:00:15,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:15,932 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, 1] [2018-10-26 20:00:15,932 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:15,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:15,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2049732444, now seen corresponding path program 1 times [2018-10-26 20:00:15,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:15,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:15,933 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-10-26 20:00:16,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:16,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:00:16,060 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:16,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:00:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:00:16,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:16,061 INFO L87 Difference]: Start difference. First operand 1192 states and 1733 transitions. Second operand 3 states. [2018-10-26 20:00:16,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:16,234 INFO L93 Difference]: Finished difference Result 2384 states and 3486 transitions. [2018-10-26 20:00:16,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:00:16,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-10-26 20:00:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:16,238 INFO L225 Difference]: With dead ends: 2384 [2018-10-26 20:00:16,238 INFO L226 Difference]: Without dead ends: 1786 [2018-10-26 20:00:16,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:00:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-26 20:00:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1767. [2018-10-26 20:00:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-26 20:00:16,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2577 transitions. [2018-10-26 20:00:16,286 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2577 transitions. Word has length 176 [2018-10-26 20:00:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:16,287 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 2577 transitions. [2018-10-26 20:00:16,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:00:16,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2577 transitions. [2018-10-26 20:00:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 20:00:16,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:16,289 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, 1] [2018-10-26 20:00:16,289 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:16,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash 494990891, now seen corresponding path program 1 times [2018-10-26 20:00:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:16,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:16,290 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 20:00:16,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:00:16,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:00:16,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:00:16,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:00:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:00:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:00:16,387 INFO L87 Difference]: Start difference. First operand 1767 states and 2577 transitions. Second operand 4 states. [2018-10-26 20:00:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:00:16,757 INFO L93 Difference]: Finished difference Result 3816 states and 5544 transitions. [2018-10-26 20:00:16,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:00:16,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-10-26 20:00:16,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:00:16,762 INFO L225 Difference]: With dead ends: 3816 [2018-10-26 20:00:16,762 INFO L226 Difference]: Without dead ends: 2075 [2018-10-26 20:00:16,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:00:16,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2018-10-26 20:00:16,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1842. [2018-10-26 20:00:16,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2018-10-26 20:00:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2658 transitions. [2018-10-26 20:00:16,848 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2658 transitions. Word has length 178 [2018-10-26 20:00:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:00:16,849 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 2658 transitions. [2018-10-26 20:00:16,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:00:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2658 transitions. [2018-10-26 20:00:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 20:00:16,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:00:16,853 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, 1, 1, 1] [2018-10-26 20:00:16,853 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:00:16,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:16,853 INFO L82 PathProgramCache]: Analyzing trace with hash -208047317, now seen corresponding path program 1 times [2018-10-26 20:00:16,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:00:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:16,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:16,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:00:16,854 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:00:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 153 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:00:17,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:17,407 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:00:17,408 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 179 with the following transitions: [2018-10-26 20:00:17,409 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], [525], [540], [545], [550], [555], [561], [566], [568], [573], [578], [584], [587], [591], [612], [646], [648], [660], [663], [664], [665], [667] [2018-10-26 20:00:17,460 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:00:17,460 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:00:18,589 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:00:57,503 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:00:57,504 INFO L272 AbstractInterpreter]: Visited 80 different actions 408 times. Merged at 66 different actions 313 times. Widened at 9 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 142 variables. [2018-10-26 20:00:57,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:00:57,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:00:57,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:00:57,519 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:00:57,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:00:57,546 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:00:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:00:57,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:00:57,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-10-26 20:00:57,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:00:58,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:00:58,029 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,031 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:00:58,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:00:58,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:00:58,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:00:58,139 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:00:58,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:00:58,143 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:00:58,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:00:58,149 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,160 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,181 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-10-26 20:00:58,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 21 treesize of output 17 [2018-10-26 20:00:58,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-10-26 20:00:58,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-10-26 20:00:58,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-10-26 20:00:58,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,893 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:58,900 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-10-26 20:00:58,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:00:58,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-10-26 20:00:58,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,131 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-10-26 20:00:59,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-10-26 20:00:59,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-10-26 20:00:59,314 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:00:59,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:00:59,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-10-26 20:00:59,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:00:59,339 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,350 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-10-26 20:00:59,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 21 treesize of output 16 [2018-10-26 20:00:59,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:00:59,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-26 20:00:59,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,388 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-10-26 20:00:59,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-26 20:00:59,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:00:59,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:00:59,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-26 20:00:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:00:59,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:00:59,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-10-26 20:01:00,006 WARN L179 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2018-10-26 20:01:00,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:01:00,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:01:00,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-26 20:01:00,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-26 20:01:00,025 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:01:00,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:01:00,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:01:00,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:01:00,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-10-26 20:01:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:01:00,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:01:00,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2018-10-26 20:01:00,574 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:01:00,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-26 20:01:00,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-26 20:01:00,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2018-10-26 20:01:00,575 INFO L87 Difference]: Start difference. First operand 1842 states and 2658 transitions. Second operand 16 states. [2018-10-26 20:01:03,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:03,110 INFO L93 Difference]: Finished difference Result 3720 states and 5360 transitions. [2018-10-26 20:01:03,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:01:03,112 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 178 [2018-10-26 20:01:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:03,115 INFO L225 Difference]: With dead ends: 3720 [2018-10-26 20:01:03,116 INFO L226 Difference]: Without dead ends: 1904 [2018-10-26 20:01:03,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2018-10-26 20:01:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2018-10-26 20:01:03,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1638. [2018-10-26 20:01:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2018-10-26 20:01:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2364 transitions. [2018-10-26 20:01:03,223 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2364 transitions. Word has length 178 [2018-10-26 20:01:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:03,224 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2364 transitions. [2018-10-26 20:01:03,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-26 20:01:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2364 transitions. [2018-10-26 20:01:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-26 20:01:03,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:03,226 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, 1] [2018-10-26 20:01:03,227 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:03,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1267837171, now seen corresponding path program 1 times [2018-10-26 20:01:03,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:01:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:03,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:03,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:03,228 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:01:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-10-26 20:01:03,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:01:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:01:03,437 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:01:03,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:01:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:01:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:01:03,440 INFO L87 Difference]: Start difference. First operand 1638 states and 2364 transitions. Second operand 4 states. [2018-10-26 20:01:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:01:04,453 INFO L93 Difference]: Finished difference Result 2929 states and 4216 transitions. [2018-10-26 20:01:04,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:01:04,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-10-26 20:01:04,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:01:04,456 INFO L225 Difference]: With dead ends: 2929 [2018-10-26 20:01:04,456 INFO L226 Difference]: Without dead ends: 1305 [2018-10-26 20:01:04,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:01:04,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2018-10-26 20:01:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1157. [2018-10-26 20:01:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-10-26 20:01:04,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1649 transitions. [2018-10-26 20:01:04,536 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1649 transitions. Word has length 179 [2018-10-26 20:01:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:01:04,536 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1649 transitions. [2018-10-26 20:01:04,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:01:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1649 transitions. [2018-10-26 20:01:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:01:04,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:01:04,539 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-10-26 20:01:04,539 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:01:04,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:01:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1096033176, now seen corresponding path program 1 times [2018-10-26 20:01:04,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:01:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:01:04,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:01:04,540 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:01:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:01:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 192 proven. 28 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:01:05,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:01:05,031 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-26 20:01:05,031 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-10-26 20:01:05,031 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], [525], [612], [646], [648], [660], [663], [664], [665], [667] [2018-10-26 20:01:05,040 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-10-26 20:01:05,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-26 20:01:05,505 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-26 20:02:09,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-26 20:02:09,288 INFO L272 AbstractInterpreter]: Visited 86 different actions 610 times. Merged at 72 different actions 483 times. Widened at 13 different actions 37 times. Found 46 fixpoints after 20 different actions. Largest state had 153 variables. [2018-10-26 20:02:09,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:09,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-26 20:02:09,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:02:09,294 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:02:09,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:09,302 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-26 20:02:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:09,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:09,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:02:09,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,634 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 21 treesize of output 18 [2018-10-26 20:02:09,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-10-26 20:02:09,638 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:09,643 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 21 treesize of output 31 [2018-10-26 20:02:09,666 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:09,668 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:09,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 46 [2018-10-26 20:02:09,678 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:35, output treesize:10 [2018-10-26 20:02:09,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:02:09,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:09,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,829 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-10-26 20:02:09,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:02:09,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,864 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-10-26 20:02:09,874 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-10-26 20:02:09,874 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,895 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:02:09,919 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-10-26 20:02:09,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 53 treesize of output 49 [2018-10-26 20:02:09,951 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-10-26 20:02:09,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:02:09,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:02:09,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 25 treesize of output 22 [2018-10-26 20:02:09,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:02:09,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,974 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-10-26 20:02:09,977 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-10-26 20:02:09,977 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,980 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:09,984 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-10-26 20:02:09,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 10 treesize of output 8 [2018-10-26 20:02:10,002 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-10-26 20:02:10,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-10-26 20:02:10,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:02:10,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:02:10,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:02:10,083 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:02:10,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:02:10,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:02:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2018-10-26 20:02:10,115 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:02:10,118 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:02:10,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:02:10,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:02:10,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,132 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:10,134 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-10-26 20:02:10,155 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:02:10,162 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-10-26 20:02:10,162 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:02:10,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:02:10,193 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:02:10,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:02:10,194 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-10-26 20:02:10,194 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,197 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:02:10,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-26 20:02:10,201 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,203 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:10,219 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-10-26 20:02:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:02:10,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-26 20:02:10,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 15 [2018-10-26 20:02:10,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-26 20:02:10,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-26 20:02:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-26 20:02:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-26 20:02:10,316 INFO L87 Difference]: Start difference. First operand 1157 states and 1649 transitions. Second operand 14 states. [2018-10-26 20:02:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:13,126 INFO L93 Difference]: Finished difference Result 6740 states and 9671 transitions. [2018-10-26 20:02:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-26 20:02:13,127 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 204 [2018-10-26 20:02:13,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:13,137 INFO L225 Difference]: With dead ends: 6740 [2018-10-26 20:02:13,138 INFO L226 Difference]: Without dead ends: 5644 [2018-10-26 20:02:13,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-26 20:02:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5644 states. [2018-10-26 20:02:13,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5644 to 2380. [2018-10-26 20:02:13,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-10-26 20:02:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 3491 transitions. [2018-10-26 20:02:13,319 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 3491 transitions. Word has length 204 [2018-10-26 20:02:13,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:13,319 INFO L481 AbstractCegarLoop]: Abstraction has 2380 states and 3491 transitions. [2018-10-26 20:02:13,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-26 20:02:13,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 3491 transitions. [2018-10-26 20:02:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 20:02:13,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:13,325 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, 1, 1, 1] [2018-10-26 20:02:13,325 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:13,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:13,326 INFO L82 PathProgramCache]: Analyzing trace with hash 2143906995, now seen corresponding path program 1 times [2018-10-26 20:02:13,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:02:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:13,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:02:13,327 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:02:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:02:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:02:13,713 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:02:13,740 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,741 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,741 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,742 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,744 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:02:13,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:02:13 BoogieIcfgContainer [2018-10-26 20:02:13,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:02:13,827 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:02:13,827 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:02:13,827 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:02:13,828 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 07:59:47" (3/4) ... [2018-10-26 20:02:13,834 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-26 20:02:13,834 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:02:13,835 INFO L168 Benchmark]: Toolchain (without parser) took 150940.64 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 958.1 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 861.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,835 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:02:13,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1267.48 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 797.0 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 229.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 797.0 MB in the beginning and 1.1 GB in the end (delta: -335.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,836 INFO L168 Benchmark]: Boogie Preprocessor took 156.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,836 INFO L168 Benchmark]: RCFGBuilder took 2868.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 963.2 MB in the end (delta: 159.8 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,837 INFO L168 Benchmark]: TraceAbstraction took 146406.44 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 963.2 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 724.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:02:13,837 INFO L168 Benchmark]: Witness Printer took 7.28 ms. Allocated memory is still 5.0 GB. Free memory is still 4.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:02:13,845 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1267.48 ms. Allocated memory is still 1.0 GB. Free memory was 958.1 MB in the beginning and 797.0 MB in the end (delta: 161.1 MB). Peak memory consumption was 161.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 229.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 797.0 MB in the beginning and 1.1 GB in the end (delta: -335.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 156.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2868.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 963.2 MB in the end (delta: 159.8 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 146406.44 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 963.2 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 724.2 MB. Max. memory is 11.5 GB. * Witness Printer took 7.28 ms. Allocated memory is still 5.0 GB. Free memory is still 4.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: 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={24587: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={24587: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={24587: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={24587: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587: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={24587: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587: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 [L1594] CALL, EXPR s->session [L1594] RET, EXPR s->session [L1594] CALL, EXPR s->s3 [L1594] RET, EXPR s->s3 [L1594] CALL, EXPR (s->s3)->tmp.new_cipher [L1594] RET, EXPR (s->s3)->tmp.new_cipher [L1594] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1594] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={24587:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={24587:0}] [L1611] COND FALSE !(ret <= 0) [L1616] CALL s->state = 8672 [L1616] RET s->state = 8672 [L1617] CALL s->init_num = 0 [L1617] RET s->init_num = 0 [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24587:0}] [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587: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 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={24587:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={24587:0}] [L1637] COND FALSE !(ret <= 0) [L1642] CALL s->state = 8448 [L1642] RET s->state = 8448 [L1643] CALL s->hit [L1643] RET s->hit [L1643] COND TRUE s->hit [L1644] CALL, EXPR s->s3 [L1644] RET, EXPR s->s3 [L1644] CALL (s->s3)->tmp.next_state = 8640 [L1644] RET (s->s3)->tmp.next_state = 8640 [L1648] CALL s->init_num = 0 [L1648] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587: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={24587: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={24587:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24587: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={24587:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={24587:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24587:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 1 error locations. UNSAFE Result, 146.3s OverallTime, 36 OverallIterations, 7 TraceHistogramMax, 27.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5541 SDtfs, 6792 SDslu, 12270 SDs, 0 SdLazy, 11164 SolverSat, 1794 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 828 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2380occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 104.3s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 7735 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 5053 NumberOfCodeBlocks, 5053 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 5188 ConstructedInterpolants, 84 QuantifiedInterpolants, 4395190 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4095 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 39 InterpolantComputations, 33 PerfectInterpolantSequences, 4606/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-10-26 20:02:15,988 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:02:15,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:02:16,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:02:16,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:02:16,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:02:16,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:02:16,005 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:02:16,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:02:16,006 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:02:16,007 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:02:16,007 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:02:16,008 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:02:16,008 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:02:16,009 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:02:16,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:02:16,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:02:16,012 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:02:16,014 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:02:16,015 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:02:16,016 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:02:16,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:02:16,019 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:02:16,019 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:02:16,019 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:02:16,020 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:02:16,020 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:02:16,021 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:02:16,022 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:02:16,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:02:16,023 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:02:16,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:02:16,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:02:16,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:02:16,024 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:02:16,025 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:02:16,025 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-10-26 20:02:16,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:02:16,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:02:16,037 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:02:16,038 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:02:16,038 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:02:16,038 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:02:16,038 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:02:16,038 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:02:16,039 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:02:16,039 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:02:16,040 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:02:16,040 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:02:16,041 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:02:16,041 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-10-26 20:02:16,042 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:02:16,044 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-10-26 20:02:16,044 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-10-26 20:02:16,045 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_132ad91e-74b1-40db-a1cb-70b18c6d2484/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 -> d06f77684af1a50a152dd1d7247c10847b7d2ace [2018-10-26 20:02:16,077 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:02:16,087 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:02:16,089 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:02:16,091 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:02:16,091 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:02:16,092 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 20:02:16,137 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/b38a870b7/2b87333c08b14aecbd2cb0d05fb039c1/FLAG643eabb6b [2018-10-26 20:02:16,630 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:02:16,630 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/sv-benchmarks/c/ssh/s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 20:02:16,660 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/b38a870b7/2b87333c08b14aecbd2cb0d05fb039c1/FLAG643eabb6b [2018-10-26 20:02:16,671 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/data/b38a870b7/2b87333c08b14aecbd2cb0d05fb039c1 [2018-10-26 20:02:16,674 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:02:16,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:02:16,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:02:16,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:02:16,680 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:02:16,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:02:16" (1/1) ... [2018-10-26 20:02:16,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d694fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:16, skipping insertion in model container [2018-10-26 20:02:16,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:02:16" (1/1) ... [2018-10-26 20:02:16,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:02:16,740 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:02:17,267 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:02:17,279 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:02:17,516 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:02:17,534 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:02:17,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17 WrapperNode [2018-10-26 20:02:17,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:02:17,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:02:17,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:02:17,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:02:17,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,666 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:02:17,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:02:17,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:02:17,743 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:02:17,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,775 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,857 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... [2018-10-26 20:02:17,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:02:17,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:02:17,871 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:02:17,871 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:02:17,872 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:02:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:02:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:02:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-10-26 20:02:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-10-26 20:02:17,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:02:17,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:02:17,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:02:17,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:02:20,575 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-10-26 20:02:20,575 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-10-26 20:02:22,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:02:22,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:02:22 BoogieIcfgContainer [2018-10-26 20:02:22,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:02:22,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:02:22,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:02:22,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:02:22,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:02:16" (1/3) ... [2018-10-26 20:02:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbc4535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:02:22, skipping insertion in model container [2018-10-26 20:02:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:02:17" (2/3) ... [2018-10-26 20:02:22,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbc4535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:02:22, skipping insertion in model container [2018-10-26 20:02:22,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:02:22" (3/3) ... [2018-10-26 20:02:22,128 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14_false-unreach-call.i.cil.c [2018-10-26 20:02:22,136 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:02:22,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:02:22,155 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:02:22,180 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:02:22,181 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:02:22,181 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:02:22,181 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:02:22,181 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:02:22,181 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:02:22,182 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:02:22,182 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:02:22,182 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:02:22,197 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-10-26 20:02:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-26 20:02:22,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:22,205 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, 1] [2018-10-26 20:02:22,207 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:22,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 283188315, now seen corresponding path program 1 times [2018-10-26 20:02:22,217 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:22,218 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:22,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:22,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:22,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:22,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-10-26 20:02:22,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:22,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:22,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:22,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:02:23,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-10-26 20:02:23,082 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:23,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:23,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:23,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:23,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:23,499 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:23,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:23,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:23,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:23,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:23,521 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 6 states. [2018-10-26 20:02:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:26,515 INFO L93 Difference]: Finished difference Result 346 states and 581 transitions. [2018-10-26 20:02:26,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:26,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-10-26 20:02:26,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:26,528 INFO L225 Difference]: With dead ends: 346 [2018-10-26 20:02:26,528 INFO L226 Difference]: Without dead ends: 176 [2018-10-26 20:02:26,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:02:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-26 20:02:26,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-10-26 20:02:26,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-26 20:02:26,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 244 transitions. [2018-10-26 20:02:26,575 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 244 transitions. Word has length 49 [2018-10-26 20:02:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:26,575 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 244 transitions. [2018-10-26 20:02:26,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2018-10-26 20:02:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-26 20:02:26,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:26,578 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, 1] [2018-10-26 20:02:26,578 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash 564877000, now seen corresponding path program 1 times [2018-10-26 20:02:26,579 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:26,579 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:26,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:27,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:27,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-10-26 20:02:27,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:27,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:02:27,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-10-26 20:02:27,257 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:27,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:27,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:27,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:02:27,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:02:27,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:27,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:02:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:27,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:27,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:27,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:27,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:27,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:27,377 INFO L87 Difference]: Start difference. First operand 159 states and 244 transitions. Second operand 6 states. [2018-10-26 20:02:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:30,125 INFO L93 Difference]: Finished difference Result 309 states and 472 transitions. [2018-10-26 20:02:30,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:30,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-10-26 20:02:30,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:30,127 INFO L225 Difference]: With dead ends: 309 [2018-10-26 20:02:30,127 INFO L226 Difference]: Without dead ends: 176 [2018-10-26 20:02:30,128 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-10-26 20:02:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-26 20:02:30,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 159. [2018-10-26 20:02:30,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-26 20:02:30,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 243 transitions. [2018-10-26 20:02:30,140 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 243 transitions. Word has length 63 [2018-10-26 20:02:30,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:30,140 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 243 transitions. [2018-10-26 20:02:30,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 243 transitions. [2018-10-26 20:02:30,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 20:02:30,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:30,142 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-10-26 20:02:30,142 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:30,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash -715240359, now seen corresponding path program 1 times [2018-10-26 20:02:30,143 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:30,143 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:30,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:30,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:30,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:30,577 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:30,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:02:30,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:02:30,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 15 treesize of output 3 [2018-10-26 20:02:30,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:30,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:02:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:30,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:02:30,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:30,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:02:30,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:30,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:30,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:30,651 INFO L87 Difference]: Start difference. First operand 159 states and 243 transitions. Second operand 4 states. [2018-10-26 20:02:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:33,261 INFO L93 Difference]: Finished difference Result 322 states and 494 transitions. [2018-10-26 20:02:33,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:33,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-10-26 20:02:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:33,263 INFO L225 Difference]: With dead ends: 322 [2018-10-26 20:02:33,264 INFO L226 Difference]: Without dead ends: 189 [2018-10-26 20:02:33,264 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-10-26 20:02:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-26 20:02:33,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 176. [2018-10-26 20:02:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-26 20:02:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2018-10-26 20:02:33,275 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 64 [2018-10-26 20:02:33,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:33,276 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2018-10-26 20:02:33,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:33,276 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2018-10-26 20:02:33,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 20:02:33,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:33,279 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-10-26 20:02:33,279 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:33,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:33,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1940737371, now seen corresponding path program 1 times [2018-10-26 20:02:33,280 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:33,280 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:33,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:33,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:33,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:33,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:33,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:02:33,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 19 treesize of output 15 [2018-10-26 20:02:33,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:02:33,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:33,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:02:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:33,764 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:02:33,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:33,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:02:33,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:33,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:33,769 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand 4 states. [2018-10-26 20:02:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:36,443 INFO L93 Difference]: Finished difference Result 441 states and 683 transitions. [2018-10-26 20:02:36,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:36,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-10-26 20:02:36,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:36,446 INFO L225 Difference]: With dead ends: 441 [2018-10-26 20:02:36,446 INFO L226 Difference]: Without dead ends: 291 [2018-10-26 20:02:36,447 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-10-26 20:02:36,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-26 20:02:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 217. [2018-10-26 20:02:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:02:36,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 344 transitions. [2018-10-26 20:02:36,463 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 344 transitions. Word has length 64 [2018-10-26 20:02:36,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:36,463 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 344 transitions. [2018-10-26 20:02:36,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:36,464 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 344 transitions. [2018-10-26 20:02:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-26 20:02:36,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:36,465 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, 1] [2018-10-26 20:02:36,467 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:36,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -2008297372, now seen corresponding path program 1 times [2018-10-26 20:02:36,468 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:36,468 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:36,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:37,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:37,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:37,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:37,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:02:37,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:02:37,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:37,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:37,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:37,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-10-26 20:02:37,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:02:37,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:37,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-10-26 20:02:37,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:02:37,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:37,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:02:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:37,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:37,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:37,213 INFO L87 Difference]: Start difference. First operand 217 states and 344 transitions. Second operand 6 states. [2018-10-26 20:02:39,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:39,851 INFO L93 Difference]: Finished difference Result 423 states and 671 transitions. [2018-10-26 20:02:39,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:39,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-10-26 20:02:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:39,854 INFO L225 Difference]: With dead ends: 423 [2018-10-26 20:02:39,854 INFO L226 Difference]: Without dead ends: 232 [2018-10-26 20:02:39,854 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-10-26 20:02:39,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-26 20:02:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 217. [2018-10-26 20:02:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:02:39,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 343 transitions. [2018-10-26 20:02:39,871 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 343 transitions. Word has length 64 [2018-10-26 20:02:39,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:39,872 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 343 transitions. [2018-10-26 20:02:39,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:39,872 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 343 transitions. [2018-10-26 20:02:39,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:02:39,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:39,873 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, 1] [2018-10-26 20:02:39,873 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:39,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:39,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1947154439, now seen corresponding path program 1 times [2018-10-26 20:02:39,873 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:39,873 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:39,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:40,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:40,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:02:40,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:02:40,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:02:40,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:02:40,628 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:40,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:40,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:40,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 23 treesize of output 18 [2018-10-26 20:02:40,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:40,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:40,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,661 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:40,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:02:40,727 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:40,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:40,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:40,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 20:02:40,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:02:40,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:40,776 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-10-26 20:02:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:40,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:40,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:40,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:02:40,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:02:40,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:02:40,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:02:40,798 INFO L87 Difference]: Start difference. First operand 217 states and 343 transitions. Second operand 8 states. [2018-10-26 20:02:44,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:44,644 INFO L93 Difference]: Finished difference Result 417 states and 663 transitions. [2018-10-26 20:02:44,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:02:44,644 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-10-26 20:02:44,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:44,645 INFO L225 Difference]: With dead ends: 417 [2018-10-26 20:02:44,645 INFO L226 Difference]: Without dead ends: 226 [2018-10-26 20:02:44,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:02:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-26 20:02:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-10-26 20:02:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-26 20:02:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 354 transitions. [2018-10-26 20:02:44,656 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 354 transitions. Word has length 65 [2018-10-26 20:02:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:44,656 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 354 transitions. [2018-10-26 20:02:44,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:02:44,656 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 354 transitions. [2018-10-26 20:02:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:02:44,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:44,658 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, 1] [2018-10-26 20:02:44,659 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:44,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 712277477, now seen corresponding path program 1 times [2018-10-26 20:02:44,659 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:44,659 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:44,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:45,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:45,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:45,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:45,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:02:45,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:02:45,314 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:45,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:45,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:45,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-10-26 20:02:45,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:02:45,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:45,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:02:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:45,398 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:45,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:45,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:45,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:45,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:45,402 INFO L87 Difference]: Start difference. First operand 226 states and 354 transitions. Second operand 6 states. [2018-10-26 20:02:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:48,110 INFO L93 Difference]: Finished difference Result 450 states and 703 transitions. [2018-10-26 20:02:48,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:48,111 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-10-26 20:02:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:48,112 INFO L225 Difference]: With dead ends: 450 [2018-10-26 20:02:48,112 INFO L226 Difference]: Without dead ends: 250 [2018-10-26 20:02:48,113 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-10-26 20:02:48,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-26 20:02:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 226. [2018-10-26 20:02:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-26 20:02:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 353 transitions. [2018-10-26 20:02:48,123 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 353 transitions. Word has length 65 [2018-10-26 20:02:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:48,123 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 353 transitions. [2018-10-26 20:02:48,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 353 transitions. [2018-10-26 20:02:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-26 20:02:48,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:48,124 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, 1] [2018-10-26 20:02:48,124 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:48,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash -273589102, now seen corresponding path program 1 times [2018-10-26 20:02:48,125 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:48,125 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:48,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:48,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:48,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:02:48,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:48,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:02:48,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:02:48,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:02:48,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:48,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:02:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:48,514 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:02:48,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:02:48,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:02:48,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:02:48,517 INFO L87 Difference]: Start difference. First operand 226 states and 353 transitions. Second operand 4 states. [2018-10-26 20:02:51,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:51,202 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2018-10-26 20:02:51,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:02:51,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-10-26 20:02:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:51,208 INFO L225 Difference]: With dead ends: 502 [2018-10-26 20:02:51,208 INFO L226 Difference]: Without dead ends: 302 [2018-10-26 20:02:51,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:02:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-26 20:02:51,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 227. [2018-10-26 20:02:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-26 20:02:51,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 354 transitions. [2018-10-26 20:02:51,221 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 354 transitions. Word has length 65 [2018-10-26 20:02:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:51,222 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 354 transitions. [2018-10-26 20:02:51,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:02:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 354 transitions. [2018-10-26 20:02:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-26 20:02:51,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:51,224 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, 1] [2018-10-26 20:02:51,224 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:51,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:51,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1402822207, now seen corresponding path program 1 times [2018-10-26 20:02:51,225 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:51,225 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:02:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:51,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:51,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 13 treesize of output 10 [2018-10-26 20:02:51,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:02:51,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:02:51,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:02:51,958 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:51,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:51,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:02:51,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:02:51,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:02:51,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:51,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-10-26 20:02:51,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:02:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:52,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:52,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:52,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:02:52,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:02:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:02:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:02:52,012 INFO L87 Difference]: Start difference. First operand 227 states and 354 transitions. Second operand 6 states. [2018-10-26 20:02:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:55,414 INFO L93 Difference]: Finished difference Result 452 states and 704 transitions. [2018-10-26 20:02:55,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:02:55,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-10-26 20:02:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:55,415 INFO L225 Difference]: With dead ends: 452 [2018-10-26 20:02:55,415 INFO L226 Difference]: Without dead ends: 251 [2018-10-26 20:02:55,416 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-10-26 20:02:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-26 20:02:55,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 227. [2018-10-26 20:02:55,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-26 20:02:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2018-10-26 20:02:55,427 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 66 [2018-10-26 20:02:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:55,427 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2018-10-26 20:02:55,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:02:55,427 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2018-10-26 20:02:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 20:02:55,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:55,428 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, 1] [2018-10-26 20:02:55,428 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:55,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:55,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2083404063, now seen corresponding path program 1 times [2018-10-26 20:02:55,431 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:55,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:02:55,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:02:56,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:02:56,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:02:56,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:02:56,061 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:02:56,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:02:56,063 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:02:56,069 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:56,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:56,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:02:56,081 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:02:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:02:56,150 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:02:56,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:02:56,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:02:56,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:02:56,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:02:56,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:02:56,154 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand 7 states. [2018-10-26 20:02:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:02:59,466 INFO L93 Difference]: Finished difference Result 481 states and 751 transitions. [2018-10-26 20:02:59,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:02:59,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2018-10-26 20:02:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:02:59,468 INFO L225 Difference]: With dead ends: 481 [2018-10-26 20:02:59,468 INFO L226 Difference]: Without dead ends: 280 [2018-10-26 20:02:59,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:02:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-26 20:02:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 250. [2018-10-26 20:02:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:02:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 392 transitions. [2018-10-26 20:02:59,482 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 392 transitions. Word has length 67 [2018-10-26 20:02:59,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:02:59,483 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 392 transitions. [2018-10-26 20:02:59,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:02:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 392 transitions. [2018-10-26 20:02:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-26 20:02:59,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:02:59,484 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, 1] [2018-10-26 20:02:59,484 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:02:59,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:02:59,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1993465152, now seen corresponding path program 1 times [2018-10-26 20:02:59,485 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:02:59,485 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:02:59,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:02:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:00,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:00,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:00,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:00,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:03:00,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:03:00,171 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:00,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:00,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:03:00,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 19 treesize of output 15 [2018-10-26 20:03:00,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:00,197 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,201 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:00,201 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:00,211 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:00,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:00,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:03:00,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:03:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:03:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:03:00,214 INFO L87 Difference]: Start difference. First operand 250 states and 392 transitions. Second operand 6 states. [2018-10-26 20:03:02,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:02,937 INFO L93 Difference]: Finished difference Result 498 states and 781 transitions. [2018-10-26 20:03:02,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:03:02,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-10-26 20:03:02,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:02,938 INFO L225 Difference]: With dead ends: 498 [2018-10-26 20:03:02,938 INFO L226 Difference]: Without dead ends: 274 [2018-10-26 20:03:02,939 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-10-26 20:03:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-26 20:03:02,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 250. [2018-10-26 20:03:02,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 391 transitions. [2018-10-26 20:03:02,947 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 391 transitions. Word has length 67 [2018-10-26 20:03:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:02,947 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 391 transitions. [2018-10-26 20:03:02,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:03:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 391 transitions. [2018-10-26 20:03:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-26 20:03:02,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:02,948 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, 1] [2018-10-26 20:03:02,949 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:02,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:02,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1724377852, now seen corresponding path program 1 times [2018-10-26 20:03:02,949 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:02,949 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:02,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:03,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:03,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:03,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:03,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:03:03,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-10-26 20:03:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:03,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:03,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,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-10-26 20:03:03,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:03:03,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:03,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:03,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,681 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:03,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:03,697 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:03,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:03,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:03:03,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:03:03,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:03:03,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:03:03,701 INFO L87 Difference]: Start difference. First operand 250 states and 391 transitions. Second operand 6 states. [2018-10-26 20:03:06,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:06,436 INFO L93 Difference]: Finished difference Result 488 states and 767 transitions. [2018-10-26 20:03:06,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:03:06,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-10-26 20:03:06,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:06,437 INFO L225 Difference]: With dead ends: 488 [2018-10-26 20:03:06,438 INFO L226 Difference]: Without dead ends: 264 [2018-10-26 20:03:06,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 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-10-26 20:03:06,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-26 20:03:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 250. [2018-10-26 20:03:06,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 390 transitions. [2018-10-26 20:03:06,445 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 390 transitions. Word has length 68 [2018-10-26 20:03:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:06,446 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 390 transitions. [2018-10-26 20:03:06,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:03:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 390 transitions. [2018-10-26 20:03:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 20:03:06,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:06,448 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, 1] [2018-10-26 20:03:06,448 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:06,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 933081670, now seen corresponding path program 1 times [2018-10-26 20:03:06,448 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:06,449 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:06,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:07,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:07,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:07,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:03:07,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:03:07,299 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:07,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:07,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,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-10-26 20:03:07,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:03:07,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:07,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:07,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:07,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:07,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-10-26 20:03:07,337 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (14)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:03:07,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:07,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-26 20:03:07,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-26 20:03:07,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-26 20:03:07,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-26 20:03:07,342 INFO L87 Difference]: Start difference. First operand 250 states and 390 transitions. Second operand 6 states. [2018-10-26 20:03:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:10,185 INFO L93 Difference]: Finished difference Result 478 states and 754 transitions. [2018-10-26 20:03:10,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-26 20:03:10,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 78 [2018-10-26 20:03:10,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:10,186 INFO L225 Difference]: With dead ends: 478 [2018-10-26 20:03:10,186 INFO L226 Difference]: Without dead ends: 254 [2018-10-26 20:03:10,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 73 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-10-26 20:03:10,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-26 20:03:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-10-26 20:03:10,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:10,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 389 transitions. [2018-10-26 20:03:10,198 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 389 transitions. Word has length 78 [2018-10-26 20:03:10,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:10,198 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 389 transitions. [2018-10-26 20:03:10,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-26 20:03:10,199 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 389 transitions. [2018-10-26 20:03:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-26 20:03:10,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:10,199 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, 1] [2018-10-26 20:03:10,200 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:10,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:10,200 INFO L82 PathProgramCache]: Analyzing trace with hash -854908014, now seen corresponding path program 1 times [2018-10-26 20:03:10,200 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:10,200 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:10,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:10,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:10,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:10,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:10,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-10-26 20:03:10,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:10,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:10,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:10,672 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:10,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:10,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:10,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:10,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:10,678 INFO L87 Difference]: Start difference. First operand 250 states and 389 transitions. Second operand 4 states. [2018-10-26 20:03:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:13,580 INFO L93 Difference]: Finished difference Result 549 states and 852 transitions. [2018-10-26 20:03:13,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:13,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-10-26 20:03:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:13,582 INFO L225 Difference]: With dead ends: 549 [2018-10-26 20:03:13,582 INFO L226 Difference]: Without dead ends: 325 [2018-10-26 20:03:13,583 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-10-26 20:03:13,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-26 20:03:13,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 250. [2018-10-26 20:03:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 388 transitions. [2018-10-26 20:03:13,597 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 388 transitions. Word has length 78 [2018-10-26 20:03:13,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:13,598 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 388 transitions. [2018-10-26 20:03:13,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 388 transitions. [2018-10-26 20:03:13,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-26 20:03:13,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:13,600 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, 1] [2018-10-26 20:03:13,600 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:13,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:13,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1223007450, now seen corresponding path program 1 times [2018-10-26 20:03:13,601 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:13,601 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:13,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:14,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:14,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:14,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 10 treesize of output 9 [2018-10-26 20:03:14,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:14,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:14,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:14,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:14,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:14,115 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:14,115 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:14,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:14,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:14,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:14,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:14,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:14,126 INFO L87 Difference]: Start difference. First operand 250 states and 388 transitions. Second operand 4 states. [2018-10-26 20:03:16,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:16,879 INFO L93 Difference]: Finished difference Result 547 states and 848 transitions. [2018-10-26 20:03:16,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:16,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-10-26 20:03:16,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:16,881 INFO L225 Difference]: With dead ends: 547 [2018-10-26 20:03:16,904 INFO L226 Difference]: Without dead ends: 323 [2018-10-26 20:03:16,906 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-10-26 20:03:16,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-26 20:03:16,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-10-26 20:03:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 387 transitions. [2018-10-26 20:03:16,927 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 387 transitions. Word has length 79 [2018-10-26 20:03:16,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:16,927 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 387 transitions. [2018-10-26 20:03:16,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 387 transitions. [2018-10-26 20:03:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-26 20:03:16,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:16,931 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, 1] [2018-10-26 20:03:16,931 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2098479151, now seen corresponding path program 1 times [2018-10-26 20:03:16,932 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:16,932 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:16,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:17,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:17,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 13 treesize of output 10 [2018-10-26 20:03:17,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:17,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:17,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:17,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:17,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:17,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:17,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:17,533 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:17,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:17,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:17,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:17,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:17,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:17,536 INFO L87 Difference]: Start difference. First operand 250 states and 387 transitions. Second operand 4 states. [2018-10-26 20:03:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:20,273 INFO L93 Difference]: Finished difference Result 547 states and 846 transitions. [2018-10-26 20:03:20,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:20,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-10-26 20:03:20,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:20,275 INFO L225 Difference]: With dead ends: 547 [2018-10-26 20:03:20,275 INFO L226 Difference]: Without dead ends: 323 [2018-10-26 20:03:20,275 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-10-26 20:03:20,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-26 20:03:20,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-10-26 20:03:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 386 transitions. [2018-10-26 20:03:20,289 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 386 transitions. Word has length 80 [2018-10-26 20:03:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:20,289 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 386 transitions. [2018-10-26 20:03:20,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:20,290 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 386 transitions. [2018-10-26 20:03:20,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 20:03:20,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:20,292 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, 1] [2018-10-26 20:03:20,292 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:20,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1380243273, now seen corresponding path program 1 times [2018-10-26 20:03:20,293 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:20,293 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:20,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:20,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:20,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:20,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 10 treesize of output 9 [2018-10-26 20:03:20,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:20,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:20,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:20,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:20,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:20,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:20,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:20,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:21,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-10-26 20:03:21,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:21,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (18)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:03:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:21,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:21,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:21,103 INFO L87 Difference]: Start difference. First operand 250 states and 386 transitions. Second operand 4 states. [2018-10-26 20:03:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:23,903 INFO L93 Difference]: Finished difference Result 547 states and 844 transitions. [2018-10-26 20:03:23,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:23,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-26 20:03:23,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:23,905 INFO L225 Difference]: With dead ends: 547 [2018-10-26 20:03:23,905 INFO L226 Difference]: Without dead ends: 323 [2018-10-26 20:03:23,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:03:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-26 20:03:23,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 250. [2018-10-26 20:03:23,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-26 20:03:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 385 transitions. [2018-10-26 20:03:23,918 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 385 transitions. Word has length 81 [2018-10-26 20:03:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:23,918 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 385 transitions. [2018-10-26 20:03:23,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:23,918 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 385 transitions. [2018-10-26 20:03:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-26 20:03:23,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:23,919 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, 1] [2018-10-26 20:03:23,919 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:23,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 232049804, now seen corresponding path program 1 times [2018-10-26 20:03:23,920 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:24,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:24,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:03:24,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:03:24,742 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:24,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:24,745 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,752 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,767 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:24,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:03:24,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 13 treesize of output 5 [2018-10-26 20:03:24,783 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:03:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:24,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:03:24,829 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:03:24,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:24,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:03:24,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:24,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:03:24,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:03:24,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:03:24,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:03:24,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:03:24,847 INFO L87 Difference]: Start difference. First operand 250 states and 385 transitions. Second operand 9 states. [2018-10-26 20:03:28,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:28,036 INFO L93 Difference]: Finished difference Result 641 states and 990 transitions. [2018-10-26 20:03:28,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:03:28,037 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 81 [2018-10-26 20:03:28,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:28,039 INFO L225 Difference]: With dead ends: 641 [2018-10-26 20:03:28,039 INFO L226 Difference]: Without dead ends: 417 [2018-10-26 20:03:28,039 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-10-26 20:03:28,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-26 20:03:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 267. [2018-10-26 20:03:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:03:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 411 transitions. [2018-10-26 20:03:28,053 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 411 transitions. Word has length 81 [2018-10-26 20:03:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:28,053 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 411 transitions. [2018-10-26 20:03:28,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:03:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 411 transitions. [2018-10-26 20:03:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 20:03:28,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:28,055 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, 1] [2018-10-26 20:03:28,055 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:28,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:28,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1293518198, now seen corresponding path program 1 times [2018-10-26 20:03:28,056 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:28,056 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:28,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:28,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:28,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:28,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:28,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:28,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 19 treesize of output 15 [2018-10-26 20:03:28,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:28,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:28,495 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:28,504 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:28,504 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:28,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:28,508 INFO L87 Difference]: Start difference. First operand 267 states and 411 transitions. Second operand 4 states. [2018-10-26 20:03:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:31,272 INFO L93 Difference]: Finished difference Result 581 states and 894 transitions. [2018-10-26 20:03:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:31,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-10-26 20:03:31,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:31,274 INFO L225 Difference]: With dead ends: 581 [2018-10-26 20:03:31,274 INFO L226 Difference]: Without dead ends: 340 [2018-10-26 20:03:31,274 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-10-26 20:03:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-26 20:03:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 267. [2018-10-26 20:03:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-26 20:03:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 410 transitions. [2018-10-26 20:03:31,289 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 410 transitions. Word has length 82 [2018-10-26 20:03:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:31,289 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 410 transitions. [2018-10-26 20:03:31,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:31,289 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 410 transitions. [2018-10-26 20:03:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-26 20:03:31,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:31,291 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, 1] [2018-10-26 20:03:31,291 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:31,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:31,292 INFO L82 PathProgramCache]: Analyzing trace with hash 558961440, now seen corresponding path program 1 times [2018-10-26 20:03:31,292 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:31,292 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:31,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:32,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:32,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:03:32,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:03:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:32,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:32,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:32,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:03:32,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:03:32,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,073 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:03:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:32,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:03:32,297 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:03:32,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:32,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:03:32,368 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:32,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:03:32,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:03:32,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:03:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:03:32,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:03:32,371 INFO L87 Difference]: Start difference. First operand 267 states and 410 transitions. Second operand 9 states. [2018-10-26 20:03:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:35,756 INFO L93 Difference]: Finished difference Result 656 states and 1010 transitions. [2018-10-26 20:03:35,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:03:35,756 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-10-26 20:03:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:35,757 INFO L225 Difference]: With dead ends: 656 [2018-10-26 20:03:35,757 INFO L226 Difference]: Without dead ends: 415 [2018-10-26 20:03:35,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:03:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-26 20:03:35,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 268. [2018-10-26 20:03:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 410 transitions. [2018-10-26 20:03:35,768 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 410 transitions. Word has length 82 [2018-10-26 20:03:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:35,768 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 410 transitions. [2018-10-26 20:03:35,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:03:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 410 transitions. [2018-10-26 20:03:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:03:35,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:35,769 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, 1] [2018-10-26 20:03:35,769 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:35,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1947896946, now seen corresponding path program 1 times [2018-10-26 20:03:35,772 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:35,772 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:36,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:36,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:36,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-10-26 20:03:36,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:36,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:36,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:36,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:36,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:36,264 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:36,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:36,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:36,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:36,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:36,267 INFO L87 Difference]: Start difference. First operand 268 states and 410 transitions. Second operand 4 states. [2018-10-26 20:03:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:38,845 INFO L93 Difference]: Finished difference Result 573 states and 879 transitions. [2018-10-26 20:03:38,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:38,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-10-26 20:03:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:38,847 INFO L225 Difference]: With dead ends: 573 [2018-10-26 20:03:38,847 INFO L226 Difference]: Without dead ends: 331 [2018-10-26 20:03:38,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:03:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-26 20:03:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 268. [2018-10-26 20:03:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 409 transitions. [2018-10-26 20:03:38,856 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 409 transitions. Word has length 83 [2018-10-26 20:03:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:38,857 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 409 transitions. [2018-10-26 20:03:38,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 409 transitions. [2018-10-26 20:03:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-26 20:03:38,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:38,858 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, 1] [2018-10-26 20:03:38,858 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:38,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1307077975, now seen corresponding path program 1 times [2018-10-26 20:03:38,858 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:38,859 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:39,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:39,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:03:39,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:03:39,815 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:39,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:39,817 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,823 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,835 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:39,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:39,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:39,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:39,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:39,864 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:39,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:39,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:03:39,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:39,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:39,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:39,867 INFO L87 Difference]: Start difference. First operand 268 states and 409 transitions. Second operand 7 states. [2018-10-26 20:03:42,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:42,793 INFO L93 Difference]: Finished difference Result 538 states and 824 transitions. [2018-10-26 20:03:42,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:03:42,795 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2018-10-26 20:03:42,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:42,796 INFO L225 Difference]: With dead ends: 538 [2018-10-26 20:03:42,796 INFO L226 Difference]: Without dead ends: 296 [2018-10-26 20:03:42,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:03:42,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-26 20:03:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-10-26 20:03:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 408 transitions. [2018-10-26 20:03:42,815 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 408 transitions. Word has length 83 [2018-10-26 20:03:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:42,815 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 408 transitions. [2018-10-26 20:03:42,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:03:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 408 transitions. [2018-10-26 20:03:42,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-26 20:03:42,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:42,816 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, 1] [2018-10-26 20:03:42,817 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:42,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:42,817 INFO L82 PathProgramCache]: Analyzing trace with hash 421668221, now seen corresponding path program 1 times [2018-10-26 20:03:42,818 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:42,818 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:42,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:43,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:43,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:03:43,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:03:43,770 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:43,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:43,775 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,792 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:43,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-10-26 20:03:43,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-10-26 20:03:43,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:43,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-10-26 20:03:43,809 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:43,821 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:43,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:43,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:03:43,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:43,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:43,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:43,825 INFO L87 Difference]: Start difference. First operand 268 states and 408 transitions. Second operand 7 states. [2018-10-26 20:03:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:46,611 INFO L93 Difference]: Finished difference Result 538 states and 822 transitions. [2018-10-26 20:03:46,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:03:46,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-10-26 20:03:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:46,612 INFO L225 Difference]: With dead ends: 538 [2018-10-26 20:03:46,612 INFO L226 Difference]: Without dead ends: 296 [2018-10-26 20:03:46,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:03:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-26 20:03:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-10-26 20:03:46,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 407 transitions. [2018-10-26 20:03:46,629 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 407 transitions. Word has length 84 [2018-10-26 20:03:46,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:46,629 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 407 transitions. [2018-10-26 20:03:46,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:03:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 407 transitions. [2018-10-26 20:03:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-26 20:03:46,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:46,631 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, 1] [2018-10-26 20:03:46,631 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:46,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:46,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1268836732, now seen corresponding path program 1 times [2018-10-26 20:03:46,632 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:46,632 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:46,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:47,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:47,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 18 treesize of output 15 [2018-10-26 20:03:47,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:03:47,433 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:47,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:47,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,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-10-26 20:03:47,453 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:47,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:47,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 15 treesize of output 3 [2018-10-26 20:03:47,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:47,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:47,480 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:47,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:47,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:03:47,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:47,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:47,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:47,484 INFO L87 Difference]: Start difference. First operand 268 states and 407 transitions. Second operand 7 states. [2018-10-26 20:03:50,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:50,327 INFO L93 Difference]: Finished difference Result 538 states and 820 transitions. [2018-10-26 20:03:50,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:03:50,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-10-26 20:03:50,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:50,329 INFO L225 Difference]: With dead ends: 538 [2018-10-26 20:03:50,329 INFO L226 Difference]: Without dead ends: 296 [2018-10-26 20:03:50,329 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-10-26 20:03:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-26 20:03:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 268. [2018-10-26 20:03:50,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 406 transitions. [2018-10-26 20:03:50,351 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 406 transitions. Word has length 85 [2018-10-26 20:03:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:50,351 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 406 transitions. [2018-10-26 20:03:50,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:03:50,352 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 406 transitions. [2018-10-26 20:03:50,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-26 20:03:50,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:50,352 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, 1] [2018-10-26 20:03:50,353 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:50,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1581944904, now seen corresponding path program 1 times [2018-10-26 20:03:50,354 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:50,354 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:50,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:51,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:51,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-10-26 20:03:51,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-10-26 20:03:51,236 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:03:51,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:03:51,239 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,246 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,258 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:03:51,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:51,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:51,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:51,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:03:51,362 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:51,362 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:51,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:51,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:03:51,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:03:51,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:03:51,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:03:51,366 INFO L87 Difference]: Start difference. First operand 268 states and 406 transitions. Second operand 7 states. [2018-10-26 20:03:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,258 INFO L93 Difference]: Finished difference Result 528 states and 805 transitions. [2018-10-26 20:03:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:03:54,259 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2018-10-26 20:03:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:54,260 INFO L225 Difference]: With dead ends: 528 [2018-10-26 20:03:54,260 INFO L226 Difference]: Without dead ends: 286 [2018-10-26 20:03:54,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:03:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-26 20:03:54,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2018-10-26 20:03:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-26 20:03:54,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 405 transitions. [2018-10-26 20:03:54,275 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 405 transitions. Word has length 86 [2018-10-26 20:03:54,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:54,276 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 405 transitions. [2018-10-26 20:03:54,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:03:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 405 transitions. [2018-10-26 20:03:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 20:03:54,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:54,277 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, 1] [2018-10-26 20:03:54,277 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:54,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:54,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1005910262, now seen corresponding path program 1 times [2018-10-26 20:03:54,277 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:54,277 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:03:54,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:54,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-10-26 20:03:54,397 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:54,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:54,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:54,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:54,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:54,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,400 INFO L87 Difference]: Start difference. First operand 268 states and 405 transitions. Second operand 3 states. [2018-10-26 20:03:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,522 INFO L93 Difference]: Finished difference Result 724 states and 1116 transitions. [2018-10-26 20:03:54,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:54,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2018-10-26 20:03:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:54,524 INFO L225 Difference]: With dead ends: 724 [2018-10-26 20:03:54,524 INFO L226 Difference]: Without dead ends: 482 [2018-10-26 20:03:54,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2018-10-26 20:03:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 480. [2018-10-26 20:03:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:03:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 725 transitions. [2018-10-26 20:03:54,547 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 725 transitions. Word has length 87 [2018-10-26 20:03:54,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:54,547 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 725 transitions. [2018-10-26 20:03:54,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:54,548 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 725 transitions. [2018-10-26 20:03:54,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 20:03:54,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:54,549 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, 1] [2018-10-26 20:03:54,549 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:54,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:54,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1903303540, now seen corresponding path program 1 times [2018-10-26 20:03:54,553 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:54,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:03:54,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:55,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:55,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:03:55,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:55,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:55,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:55,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:55,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:55,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:55,083 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:55,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:55,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:55,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:55,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:55,086 INFO L87 Difference]: Start difference. First operand 480 states and 725 transitions. Second operand 4 states. [2018-10-26 20:03:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:57,777 INFO L93 Difference]: Finished difference Result 1059 states and 1586 transitions. [2018-10-26 20:03:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:03:57,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-10-26 20:03:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:57,779 INFO L225 Difference]: With dead ends: 1059 [2018-10-26 20:03:57,779 INFO L226 Difference]: Without dead ends: 605 [2018-10-26 20:03:57,780 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-10-26 20:03:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-26 20:03:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 480. [2018-10-26 20:03:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:03:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 723 transitions. [2018-10-26 20:03:57,812 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 723 transitions. Word has length 87 [2018-10-26 20:03:57,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:57,812 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 723 transitions. [2018-10-26 20:03:57,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:03:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 723 transitions. [2018-10-26 20:03:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-26 20:03:57,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:57,813 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, 1] [2018-10-26 20:03:57,813 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:57,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:57,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1799100376, now seen corresponding path program 1 times [2018-10-26 20:03:57,816 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:03:57,816 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:03:57,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:58,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:03:58,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 13 treesize of output 10 [2018-10-26 20:03:58,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:03:58,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:03:58,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:03:58,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:03:58,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:03:58,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:03:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:58,380 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:03:58,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:58,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:03:58,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:03:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:03:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:03:58,384 INFO L87 Difference]: Start difference. First operand 480 states and 723 transitions. Second operand 4 states. [2018-10-26 20:04:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:01,086 INFO L93 Difference]: Finished difference Result 1059 states and 1582 transitions. [2018-10-26 20:04:01,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:01,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-10-26 20:04:01,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:01,096 INFO L225 Difference]: With dead ends: 1059 [2018-10-26 20:04:01,097 INFO L226 Difference]: Without dead ends: 605 [2018-10-26 20:04:01,097 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-10-26 20:04:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2018-10-26 20:04:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 480. [2018-10-26 20:04:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:04:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 721 transitions. [2018-10-26 20:04:01,133 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 721 transitions. Word has length 87 [2018-10-26 20:04:01,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:01,133 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 721 transitions. [2018-10-26 20:04:01,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 721 transitions. [2018-10-26 20:04:01,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 20:04:01,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:01,136 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, 1] [2018-10-26 20:04:01,136 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:01,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:01,136 INFO L82 PathProgramCache]: Analyzing trace with hash -102427100, now seen corresponding path program 1 times [2018-10-26 20:04:01,137 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:01,137 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:01,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:01,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:01,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:01,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:01,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:01,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 19 treesize of output 15 [2018-10-26 20:04:01,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:01,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:01,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:01,778 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:01,778 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:01,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:01,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:01,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:01,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:01,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:01,781 INFO L87 Difference]: Start difference. First operand 480 states and 721 transitions. Second operand 4 states. [2018-10-26 20:04:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:04,383 INFO L93 Difference]: Finished difference Result 1051 states and 1567 transitions. [2018-10-26 20:04:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:04,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-26 20:04:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:04,385 INFO L225 Difference]: With dead ends: 1051 [2018-10-26 20:04:04,385 INFO L226 Difference]: Without dead ends: 597 [2018-10-26 20:04:04,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:04,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-26 20:04:04,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 480. [2018-10-26 20:04:04,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:04:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 719 transitions. [2018-10-26 20:04:04,414 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 719 transitions. Word has length 88 [2018-10-26 20:04:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:04,414 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 719 transitions. [2018-10-26 20:04:04,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 719 transitions. [2018-10-26 20:04:04,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-26 20:04:04,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:04,415 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, 1] [2018-10-26 20:04:04,415 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:04,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:04,415 INFO L82 PathProgramCache]: Analyzing trace with hash 527991312, now seen corresponding path program 1 times [2018-10-26 20:04:04,416 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:04,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:04,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:04,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:04,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-10-26 20:04:04,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:04,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:04,986 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:04,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:04,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:04,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-10-26 20:04:04,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:04,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:05,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:05,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:05,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:05,018 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:05,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:05,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:05,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:05,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:05,021 INFO L87 Difference]: Start difference. First operand 480 states and 719 transitions. Second operand 4 states. [2018-10-26 20:04:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:07,940 INFO L93 Difference]: Finished difference Result 1041 states and 1550 transitions. [2018-10-26 20:04:07,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:07,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-10-26 20:04:07,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:07,944 INFO L225 Difference]: With dead ends: 1041 [2018-10-26 20:04:07,944 INFO L226 Difference]: Without dead ends: 587 [2018-10-26 20:04:07,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-26 20:04:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 480. [2018-10-26 20:04:07,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:04:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 717 transitions. [2018-10-26 20:04:07,979 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 717 transitions. Word has length 88 [2018-10-26 20:04:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:07,979 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 717 transitions. [2018-10-26 20:04:07,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:07,979 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 717 transitions. [2018-10-26 20:04:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 20:04:07,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:07,980 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, 1] [2018-10-26 20:04:07,980 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:07,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1666332655, now seen corresponding path program 1 times [2018-10-26 20:04:07,981 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:08,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:08,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:08,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:08,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:08,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:08,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:08,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:08,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:08,587 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:08,587 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:08,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:08,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:08,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:08,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:08,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:08,591 INFO L87 Difference]: Start difference. First operand 480 states and 717 transitions. Second operand 4 states. [2018-10-26 20:04:11,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:11,360 INFO L93 Difference]: Finished difference Result 1041 states and 1546 transitions. [2018-10-26 20:04:11,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:11,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2018-10-26 20:04:11,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:11,363 INFO L225 Difference]: With dead ends: 1041 [2018-10-26 20:04:11,363 INFO L226 Difference]: Without dead ends: 587 [2018-10-26 20:04:11,364 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-10-26 20:04:11,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-10-26 20:04:11,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 480. [2018-10-26 20:04:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-26 20:04:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 715 transitions. [2018-10-26 20:04:11,396 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 715 transitions. Word has length 90 [2018-10-26 20:04:11,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:11,398 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 715 transitions. [2018-10-26 20:04:11,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 715 transitions. [2018-10-26 20:04:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 20:04:11,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:11,400 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-10-26 20:04:11,404 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:11,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash 391567184, now seen corresponding path program 1 times [2018-10-26 20:04:11,405 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:11,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:12,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:12,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:12,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:12,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:04: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:04:12,304 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:04:12,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:04:12,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:04:12,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:04:12,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-10-26 20:04:12,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:12,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:04:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:04:12,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:12,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:12,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:04:12,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:04:12,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:04:12,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:04:12,352 INFO L87 Difference]: Start difference. First operand 480 states and 715 transitions. Second operand 7 states. [2018-10-26 20:04:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:15,558 INFO L93 Difference]: Finished difference Result 964 states and 1442 transitions. [2018-10-26 20:04:15,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:04:15,560 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-10-26 20:04:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:15,561 INFO L225 Difference]: With dead ends: 964 [2018-10-26 20:04:15,562 INFO L226 Difference]: Without dead ends: 719 [2018-10-26 20:04:15,562 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-10-26 20:04:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-26 20:04:15,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 562. [2018-10-26 20:04:15,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-10-26 20:04:15,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 859 transitions. [2018-10-26 20:04:15,588 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 859 transitions. Word has length 90 [2018-10-26 20:04:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:15,588 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 859 transitions. [2018-10-26 20:04:15,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 859 transitions. [2018-10-26 20:04:15,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-26 20:04:15,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:15,590 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-10-26 20:04:15,590 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:15,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:15,590 INFO L82 PathProgramCache]: Analyzing trace with hash 815213906, now seen corresponding path program 1 times [2018-10-26 20:04:15,590 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:15,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:15,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:16,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:16,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-10-26 20:04:16,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-10-26 20:04:16,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:16,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:16,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:16,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:04:16,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:04:16,490 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:04:16,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:04:16,492 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:16,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:16,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-10-26 20:04:16,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:04:16,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:04:16,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:16,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:16,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:04:16,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:04:16,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:04:16,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:04:16,530 INFO L87 Difference]: Start difference. First operand 562 states and 859 transitions. Second operand 7 states. [2018-10-26 20:04:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:19,399 INFO L93 Difference]: Finished difference Result 1213 states and 1854 transitions. [2018-10-26 20:04:19,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:04:19,400 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-10-26 20:04:19,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:19,403 INFO L225 Difference]: With dead ends: 1213 [2018-10-26 20:04:19,403 INFO L226 Difference]: Without dead ends: 677 [2018-10-26 20:04:19,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:04:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-10-26 20:04:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 612. [2018-10-26 20:04:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-26 20:04:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 941 transitions. [2018-10-26 20:04:19,428 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 941 transitions. Word has length 90 [2018-10-26 20:04:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:19,428 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 941 transitions. [2018-10-26 20:04:19,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 941 transitions. [2018-10-26 20:04:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 20:04:19,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:19,430 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, 1] [2018-10-26 20:04:19,430 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:19,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:19,430 INFO L82 PathProgramCache]: Analyzing trace with hash 417468791, now seen corresponding path program 1 times [2018-10-26 20:04:19,431 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:19,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:19,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:19,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:19,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:19,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:19,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:19,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:19,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:19,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:19,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:19,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:19,953 INFO L87 Difference]: Start difference. First operand 612 states and 941 transitions. Second operand 4 states. [2018-10-26 20:04:22,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:22,575 INFO L93 Difference]: Finished difference Result 1289 states and 1968 transitions. [2018-10-26 20:04:22,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:22,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-10-26 20:04:22,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:22,578 INFO L225 Difference]: With dead ends: 1289 [2018-10-26 20:04:22,578 INFO L226 Difference]: Without dead ends: 703 [2018-10-26 20:04:22,579 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-10-26 20:04:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-10-26 20:04:22,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 612. [2018-10-26 20:04:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-10-26 20:04:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 939 transitions. [2018-10-26 20:04:22,601 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 939 transitions. Word has length 91 [2018-10-26 20:04:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:22,601 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 939 transitions. [2018-10-26 20:04:22,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:22,601 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 939 transitions. [2018-10-26 20:04:22,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-26 20:04:22,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:22,602 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, 1] [2018-10-26 20:04:22,602 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:22,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:22,602 INFO L82 PathProgramCache]: Analyzing trace with hash -986591929, now seen corresponding path program 1 times [2018-10-26 20:04:22,603 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:22,603 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:22,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:23,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:23,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:23,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 10 treesize of output 9 [2018-10-26 20:04:23,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,338 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:04:23,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:04:23,360 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:04:23,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:04:23,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:04:23,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:04:23,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:04:23,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:23,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:04:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:04:23,407 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:23,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:23,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:04:23,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:04:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:04:23,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:04:23,411 INFO L87 Difference]: Start difference. First operand 612 states and 939 transitions. Second operand 7 states. [2018-10-26 20:04:26,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:26,389 INFO L93 Difference]: Finished difference Result 1070 states and 1620 transitions. [2018-10-26 20:04:26,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:04:26,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-10-26 20:04:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:26,392 INFO L225 Difference]: With dead ends: 1070 [2018-10-26 20:04:26,392 INFO L226 Difference]: Without dead ends: 759 [2018-10-26 20:04:26,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 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-10-26 20:04:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-26 20:04:26,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 592. [2018-10-26 20:04:26,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-10-26 20:04:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 901 transitions. [2018-10-26 20:04:26,414 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 901 transitions. Word has length 91 [2018-10-26 20:04:26,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:26,414 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 901 transitions. [2018-10-26 20:04:26,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 901 transitions. [2018-10-26 20:04:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-26 20:04:26,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:26,415 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, 1] [2018-10-26 20:04:26,415 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:26,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1419867985, now seen corresponding path program 1 times [2018-10-26 20:04:26,416 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:26,416 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:26,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:26,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:26,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:26,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:26,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:26,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:26,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:26,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:26,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:26,908 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:26,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:26,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:26,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:26,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:26,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:26,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:26,915 INFO L87 Difference]: Start difference. First operand 592 states and 901 transitions. Second operand 4 states. [2018-10-26 20:04:29,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:29,570 INFO L93 Difference]: Finished difference Result 1271 states and 1928 transitions. [2018-10-26 20:04:29,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:29,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-10-26 20:04:29,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:29,573 INFO L225 Difference]: With dead ends: 1271 [2018-10-26 20:04:29,573 INFO L226 Difference]: Without dead ends: 705 [2018-10-26 20:04:29,574 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-10-26 20:04:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2018-10-26 20:04:29,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 594. [2018-10-26 20:04:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-26 20:04:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 903 transitions. [2018-10-26 20:04:29,597 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 903 transitions. Word has length 92 [2018-10-26 20:04:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:29,597 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 903 transitions. [2018-10-26 20:04:29,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 903 transitions. [2018-10-26 20:04:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 20:04:29,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:29,598 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, 1] [2018-10-26 20:04:29,598 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:29,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:29,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1136297924, now seen corresponding path program 1 times [2018-10-26 20:04:29,599 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:29,599 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:30,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:30,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:30,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:30,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:30,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:30,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:30,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:30,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 19 treesize of output 15 [2018-10-26 20:04:30,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:30,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:30,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:30,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-10-26 20:04:30,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:04:30,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:30,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:30,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:30,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:30,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:30,175 INFO L87 Difference]: Start difference. First operand 594 states and 903 transitions. Second operand 4 states. [2018-10-26 20:04:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:32,756 INFO L93 Difference]: Finished difference Result 1253 states and 1904 transitions. [2018-10-26 20:04:32,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:32,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 20:04:32,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:32,761 INFO L225 Difference]: With dead ends: 1253 [2018-10-26 20:04:32,761 INFO L226 Difference]: Without dead ends: 685 [2018-10-26 20:04:32,762 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-10-26 20:04:32,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-26 20:04:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 594. [2018-10-26 20:04:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-26 20:04:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 901 transitions. [2018-10-26 20:04:32,790 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 901 transitions. Word has length 93 [2018-10-26 20:04:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:32,790 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 901 transitions. [2018-10-26 20:04:32,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 901 transitions. [2018-10-26 20:04:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 20:04:32,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:32,791 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, 1] [2018-10-26 20:04:32,791 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:32,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 959893007, now seen corresponding path program 1 times [2018-10-26 20:04:32,792 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:32,792 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:32,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:33,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:33,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:33,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:33,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:33,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:33,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:33,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:33,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:33,348 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:33,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:33,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:33,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:33,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:33,352 INFO L87 Difference]: Start difference. First operand 594 states and 901 transitions. Second operand 4 states. [2018-10-26 20:04:35,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:35,946 INFO L93 Difference]: Finished difference Result 1253 states and 1900 transitions. [2018-10-26 20:04:35,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:35,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 20:04:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:35,949 INFO L225 Difference]: With dead ends: 1253 [2018-10-26 20:04:35,950 INFO L226 Difference]: Without dead ends: 685 [2018-10-26 20:04:35,950 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-10-26 20:04:35,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2018-10-26 20:04:35,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 594. [2018-10-26 20:04:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2018-10-26 20:04:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 899 transitions. [2018-10-26 20:04:35,975 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 899 transitions. Word has length 93 [2018-10-26 20:04:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:35,975 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 899 transitions. [2018-10-26 20:04:35,975 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 899 transitions. [2018-10-26 20:04:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-26 20:04:35,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:35,976 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, 1] [2018-10-26 20:04:35,976 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:35,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash -610315369, now seen corresponding path program 1 times [2018-10-26 20:04:35,977 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:35,977 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:35,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:36,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:36,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:36,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:36,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:36,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:36,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:36,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:36,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:36,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:36,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:36,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:36,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:36,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:36,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:36,532 INFO L87 Difference]: Start difference. First operand 594 states and 899 transitions. Second operand 4 states. [2018-10-26 20:04:39,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:39,136 INFO L93 Difference]: Finished difference Result 1249 states and 1892 transitions. [2018-10-26 20:04:39,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:39,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-10-26 20:04:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:39,140 INFO L225 Difference]: With dead ends: 1249 [2018-10-26 20:04:39,140 INFO L226 Difference]: Without dead ends: 681 [2018-10-26 20:04:39,141 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-10-26 20:04:39,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-26 20:04:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 596. [2018-10-26 20:04:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-26 20:04:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 901 transitions. [2018-10-26 20:04:39,169 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 901 transitions. Word has length 93 [2018-10-26 20:04:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:39,169 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 901 transitions. [2018-10-26 20:04:39,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 901 transitions. [2018-10-26 20:04:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 20:04:39,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:39,173 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, 1] [2018-10-26 20:04:39,173 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:39,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:39,173 INFO L82 PathProgramCache]: Analyzing trace with hash 598775527, now seen corresponding path program 1 times [2018-10-26 20:04:39,174 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:39,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:39,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:39,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:39,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:39,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:39,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:39,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:39,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:39,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:39,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:39,723 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:39,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:39,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:39,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:39,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:39,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:39,727 INFO L87 Difference]: Start difference. First operand 596 states and 901 transitions. Second operand 4 states. [2018-10-26 20:04:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:42,320 INFO L93 Difference]: Finished difference Result 1247 states and 1886 transitions. [2018-10-26 20:04:42,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:42,321 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 20:04:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:42,323 INFO L225 Difference]: With dead ends: 1247 [2018-10-26 20:04:42,323 INFO L226 Difference]: Without dead ends: 677 [2018-10-26 20:04:42,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:42,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2018-10-26 20:04:42,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 596. [2018-10-26 20:04:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-26 20:04:42,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 899 transitions. [2018-10-26 20:04:42,348 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 899 transitions. Word has length 94 [2018-10-26 20:04:42,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:42,348 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 899 transitions. [2018-10-26 20:04:42,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 899 transitions. [2018-10-26 20:04:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-26 20:04:42,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:42,349 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, 1] [2018-10-26 20:04:42,349 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:42,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:42,349 INFO L82 PathProgramCache]: Analyzing trace with hash 251255469, now seen corresponding path program 1 times [2018-10-26 20:04:42,350 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:42,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:42,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:42,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:42,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:42,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:42,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:42,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:42,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:42,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:42,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:42,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:42,906 INFO L87 Difference]: Start difference. First operand 596 states and 899 transitions. Second operand 4 states. [2018-10-26 20:04:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:45,472 INFO L93 Difference]: Finished difference Result 1241 states and 1874 transitions. [2018-10-26 20:04:45,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:45,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-10-26 20:04:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:45,476 INFO L225 Difference]: With dead ends: 1241 [2018-10-26 20:04:45,476 INFO L226 Difference]: Without dead ends: 671 [2018-10-26 20:04:45,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:04:45,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-10-26 20:04:45,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 598. [2018-10-26 20:04:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-10-26 20:04:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 901 transitions. [2018-10-26 20:04:45,501 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 901 transitions. Word has length 94 [2018-10-26 20:04:45,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:45,501 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 901 transitions. [2018-10-26 20:04:45,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:45,501 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 901 transitions. [2018-10-26 20:04:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-26 20:04:45,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:45,502 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, 1] [2018-10-26 20:04:45,502 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:45,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:45,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1301709822, now seen corresponding path program 1 times [2018-10-26 20:04:45,503 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:45,503 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:45,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:46,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:46,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:46,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:04:46,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:04:46,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:04:46,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:04:46,599 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,607 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,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-10-26 20:04:46,620 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:04:46,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:46,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:46,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:46,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:04:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:04:46,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:46,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:46,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:04:46,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:04:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:04:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:04:46,656 INFO L87 Difference]: Start difference. First operand 598 states and 901 transitions. Second operand 7 states. [2018-10-26 20:04:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:49,502 INFO L93 Difference]: Finished difference Result 907 states and 1375 transitions. [2018-10-26 20:04:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:04:49,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-10-26 20:04:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:49,505 INFO L225 Difference]: With dead ends: 907 [2018-10-26 20:04:49,505 INFO L226 Difference]: Without dead ends: 606 [2018-10-26 20:04:49,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:04:49,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-10-26 20:04:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 598. [2018-10-26 20:04:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-10-26 20:04:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 900 transitions. [2018-10-26 20:04:49,531 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 900 transitions. Word has length 96 [2018-10-26 20:04:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:49,532 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 900 transitions. [2018-10-26 20:04:49,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:04:49,532 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 900 transitions. [2018-10-26 20:04:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-26 20:04:49,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:49,533 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, 1] [2018-10-26 20:04:49,533 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:49,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 829943983, now seen corresponding path program 1 times [2018-10-26 20:04:49,533 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:49,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:50,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:50,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:50,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:50,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:50,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:50,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:50,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:50,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:50,092 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:50,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:50,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:50,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:50,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:50,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:50,096 INFO L87 Difference]: Start difference. First operand 598 states and 900 transitions. Second operand 4 states. [2018-10-26 20:04:52,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:52,788 INFO L93 Difference]: Finished difference Result 1243 states and 1872 transitions. [2018-10-26 20:04:52,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:52,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-10-26 20:04:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:52,792 INFO L225 Difference]: With dead ends: 1243 [2018-10-26 20:04:52,792 INFO L226 Difference]: Without dead ends: 671 [2018-10-26 20:04:52,793 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-10-26 20:04:52,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-10-26 20:04:52,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 600. [2018-10-26 20:04:52,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-26 20:04:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 902 transitions. [2018-10-26 20:04:52,823 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 902 transitions. Word has length 97 [2018-10-26 20:04:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:52,824 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 902 transitions. [2018-10-26 20:04:52,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 902 transitions. [2018-10-26 20:04:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 20:04:52,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:52,825 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, 1] [2018-10-26 20:04:52,825 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:52,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash -618572222, now seen corresponding path program 1 times [2018-10-26 20:04:52,826 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:52,826 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:53,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:53,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:53,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:53,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:53,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:53,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:53,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:53,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:53,433 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (45)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:04:53,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:53,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:53,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:53,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:53,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:53,440 INFO L87 Difference]: Start difference. First operand 600 states and 902 transitions. Second operand 4 states. [2018-10-26 20:04:56,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:56,060 INFO L93 Difference]: Finished difference Result 1233 states and 1856 transitions. [2018-10-26 20:04:56,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:56,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-26 20:04:56,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:56,064 INFO L225 Difference]: With dead ends: 1233 [2018-10-26 20:04:56,064 INFO L226 Difference]: Without dead ends: 659 [2018-10-26 20:04:56,065 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-10-26 20:04:56,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-26 20:04:56,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 602. [2018-10-26 20:04:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-10-26 20:04:56,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 904 transitions. [2018-10-26 20:04:56,092 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 904 transitions. Word has length 98 [2018-10-26 20:04:56,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:56,092 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 904 transitions. [2018-10-26 20:04:56,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:56,092 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 904 transitions. [2018-10-26 20:04:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-26 20:04:56,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:56,093 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, 1] [2018-10-26 20:04:56,093 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:56,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash -542645439, now seen corresponding path program 1 times [2018-10-26 20:04:56,101 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:56,101 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:56,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:56,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:56,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:04:56,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:56,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:56,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:56,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:56,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:56,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:56,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:56,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:56,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:56,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:56,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:56,655 INFO L87 Difference]: Start difference. First operand 602 states and 904 transitions. Second operand 4 states. [2018-10-26 20:04:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:04:59,227 INFO L93 Difference]: Finished difference Result 1235 states and 1856 transitions. [2018-10-26 20:04:59,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:04:59,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-10-26 20:04:59,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:04:59,232 INFO L225 Difference]: With dead ends: 1235 [2018-10-26 20:04:59,232 INFO L226 Difference]: Without dead ends: 659 [2018-10-26 20:04:59,233 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-10-26 20:04:59,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-26 20:04:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 604. [2018-10-26 20:04:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-26 20:04:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 906 transitions. [2018-10-26 20:04:59,271 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 906 transitions. Word has length 98 [2018-10-26 20:04:59,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:04:59,271 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 906 transitions. [2018-10-26 20:04:59,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:04:59,271 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 906 transitions. [2018-10-26 20:04:59,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-26 20:04:59,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:04:59,272 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, 1] [2018-10-26 20:04:59,273 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:04:59,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:04:59,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1273993042, now seen corresponding path program 1 times [2018-10-26 20:04:59,273 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:04:59,274 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:04:59,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:04:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:04:59,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:04:59,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-10-26 20:04:59,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:04:59,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:04:59,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:04:59,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:04:59,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:04:59,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:04:59,892 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:04:59,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:04:59,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:04:59,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:04:59,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:04:59,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:04:59,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:04:59,896 INFO L87 Difference]: Start difference. First operand 604 states and 906 transitions. Second operand 4 states. [2018-10-26 20:05:02,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:02,511 INFO L93 Difference]: Finished difference Result 1231 states and 1849 transitions. [2018-10-26 20:05:02,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:02,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-10-26 20:05:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:02,515 INFO L225 Difference]: With dead ends: 1231 [2018-10-26 20:05:02,515 INFO L226 Difference]: Without dead ends: 653 [2018-10-26 20:05:02,516 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-10-26 20:05:02,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-26 20:05:02,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 606. [2018-10-26 20:05:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-10-26 20:05:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 908 transitions. [2018-10-26 20:05:02,546 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 908 transitions. Word has length 99 [2018-10-26 20:05:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:02,546 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 908 transitions. [2018-10-26 20:05:02,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:02,546 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 908 transitions. [2018-10-26 20:05:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-26 20:05:02,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:02,547 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, 1] [2018-10-26 20:05:02,548 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:02,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash -674572391, now seen corresponding path program 1 times [2018-10-26 20:05:02,548 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:02,549 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:02,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:03,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:03,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:03,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:03,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:03,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,392 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:03,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:03,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:03,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:03,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:03,433 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:03,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:03,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:03,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:03,437 INFO L87 Difference]: Start difference. First operand 606 states and 908 transitions. Second operand 4 states. [2018-10-26 20:05:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:06,063 INFO L93 Difference]: Finished difference Result 1233 states and 1849 transitions. [2018-10-26 20:05:06,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:06,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-10-26 20:05:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:06,068 INFO L225 Difference]: With dead ends: 1233 [2018-10-26 20:05:06,068 INFO L226 Difference]: Without dead ends: 653 [2018-10-26 20:05:06,069 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-10-26 20:05:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-10-26 20:05:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 608. [2018-10-26 20:05:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-10-26 20:05:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 910 transitions. [2018-10-26 20:05:06,100 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 910 transitions. Word has length 100 [2018-10-26 20:05:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:06,100 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 910 transitions. [2018-10-26 20:05:06,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 910 transitions. [2018-10-26 20:05:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-26 20:05:06,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:06,101 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, 1] [2018-10-26 20:05:06,101 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:06,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash 2097999462, now seen corresponding path program 1 times [2018-10-26 20:05:06,102 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:06,102 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:06,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:06,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:06,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:06,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:06,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:06,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-10-26 20:05:06,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:06,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:06,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:06,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:06,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:06,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:06,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:06,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:06,749 INFO L87 Difference]: Start difference. First operand 608 states and 910 transitions. Second operand 4 states. [2018-10-26 20:05:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:09,290 INFO L93 Difference]: Finished difference Result 1229 states and 1842 transitions. [2018-10-26 20:05:09,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:09,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-10-26 20:05:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:09,293 INFO L225 Difference]: With dead ends: 1229 [2018-10-26 20:05:09,294 INFO L226 Difference]: Without dead ends: 647 [2018-10-26 20:05:09,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-10-26 20:05:09,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 610. [2018-10-26 20:05:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 20:05:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 912 transitions. [2018-10-26 20:05:09,320 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 912 transitions. Word has length 101 [2018-10-26 20:05:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:09,320 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 912 transitions. [2018-10-26 20:05:09,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:09,320 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 912 transitions. [2018-10-26 20:05:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 20:05:09,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:09,321 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, 1] [2018-10-26 20:05:09,321 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:09,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1153937114, now seen corresponding path program 1 times [2018-10-26 20:05:09,322 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:10,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05: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 13 treesize of output 10 [2018-10-26 20:05:10,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:10,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:10,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:10,373 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:10,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:10,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:10,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:10,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:10,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:10,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:10,413 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:10,413 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:10,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:10,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:10,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:10,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:10,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:10,418 INFO L87 Difference]: Start difference. First operand 610 states and 912 transitions. Second operand 7 states. [2018-10-26 20:05:13,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:13,439 INFO L93 Difference]: Finished difference Result 1343 states and 1990 transitions. [2018-10-26 20:05:13,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:13,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-10-26 20:05:13,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:13,442 INFO L225 Difference]: With dead ends: 1343 [2018-10-26 20:05:13,442 INFO L226 Difference]: Without dead ends: 759 [2018-10-26 20:05:13,443 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-10-26 20:05:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-26 20:05:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 610. [2018-10-26 20:05:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 20:05:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 910 transitions. [2018-10-26 20:05:13,472 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 910 transitions. Word has length 106 [2018-10-26 20:05:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:13,472 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 910 transitions. [2018-10-26 20:05:13,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 910 transitions. [2018-10-26 20:05:13,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-26 20:05:13,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:13,473 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, 1] [2018-10-26 20:05:13,473 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:13,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:13,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1880112932, now seen corresponding path program 1 times [2018-10-26 20:05:13,474 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:13,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:13,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:14,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:14,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:14,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:14,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:14,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:14,623 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:14,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:14,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:14,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:14,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:14,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:14,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:14,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:14,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:14,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:14,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:14,678 INFO L87 Difference]: Start difference. First operand 610 states and 910 transitions. Second operand 7 states. [2018-10-26 20:05:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:17,606 INFO L93 Difference]: Finished difference Result 1259 states and 1872 transitions. [2018-10-26 20:05:17,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:17,608 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2018-10-26 20:05:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:17,611 INFO L225 Difference]: With dead ends: 1259 [2018-10-26 20:05:17,611 INFO L226 Difference]: Without dead ends: 675 [2018-10-26 20:05:17,612 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-10-26 20:05:17,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-26 20:05:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 610. [2018-10-26 20:05:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-26 20:05:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 908 transitions. [2018-10-26 20:05:17,640 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 908 transitions. Word has length 106 [2018-10-26 20:05:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:17,640 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 908 transitions. [2018-10-26 20:05:17,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 908 transitions. [2018-10-26 20:05:17,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 20:05:17,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:17,641 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-10-26 20:05:17,641 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:17,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:17,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1239340172, now seen corresponding path program 1 times [2018-10-26 20:05:17,642 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:17,642 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:17,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:18,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:18,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-10-26 20:05:18,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:18,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:18,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:18,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:18,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:18,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:18,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:18,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:18,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:18,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:18,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:18,297 INFO L87 Difference]: Start difference. First operand 610 states and 908 transitions. Second operand 4 states. [2018-10-26 20:05:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:20,980 INFO L93 Difference]: Finished difference Result 1231 states and 1834 transitions. [2018-10-26 20:05:20,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:20,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2018-10-26 20:05:20,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:20,984 INFO L225 Difference]: With dead ends: 1231 [2018-10-26 20:05:20,984 INFO L226 Difference]: Without dead ends: 647 [2018-10-26 20:05:20,985 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-10-26 20:05:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-10-26 20:05:21,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2018-10-26 20:05:21,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-26 20:05:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 914 transitions. [2018-10-26 20:05:21,018 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 914 transitions. Word has length 107 [2018-10-26 20:05:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:21,018 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 914 transitions. [2018-10-26 20:05:21,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 914 transitions. [2018-10-26 20:05:21,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 20:05:21,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:21,019 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, 1] [2018-10-26 20:05:21,020 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:21,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:21,020 INFO L82 PathProgramCache]: Analyzing trace with hash -596275348, now seen corresponding path program 1 times [2018-10-26 20:05:21,020 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:21,021 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:22,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:22,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 13 treesize of output 10 [2018-10-26 20:05:22,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-10-26 20:05:22,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:22,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:22,169 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:22,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:22,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,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-10-26 20:05:22,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:22,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:22,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:22,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:22,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:22,209 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:22,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:22,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:22,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:22,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:22,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:22,213 INFO L87 Difference]: Start difference. First operand 616 states and 914 transitions. Second operand 7 states. [2018-10-26 20:05:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:25,526 INFO L93 Difference]: Finished difference Result 1351 states and 1990 transitions. [2018-10-26 20:05:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:25,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-10-26 20:05:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:25,530 INFO L225 Difference]: With dead ends: 1351 [2018-10-26 20:05:25,530 INFO L226 Difference]: Without dead ends: 761 [2018-10-26 20:05:25,532 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-10-26 20:05:25,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2018-10-26 20:05:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 616. [2018-10-26 20:05:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-26 20:05:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 912 transitions. [2018-10-26 20:05:25,571 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 912 transitions. Word has length 107 [2018-10-26 20:05:25,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:25,572 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 912 transitions. [2018-10-26 20:05:25,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:25,572 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 912 transitions. [2018-10-26 20:05:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-26 20:05:25,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:25,573 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, 1] [2018-10-26 20:05:25,573 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:25,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:25,574 INFO L82 PathProgramCache]: Analyzing trace with hash -162546262, now seen corresponding path program 1 times [2018-10-26 20:05:25,574 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:25,574 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:25,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:26,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:26,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:26,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:26,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:26,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:26,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:26,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:26,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:27,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:27,004 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:27,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:27,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:27,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:27,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:27,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:27,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:27,048 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:27,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:27,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:27,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:27,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:27,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:27,053 INFO L87 Difference]: Start difference. First operand 616 states and 912 transitions. Second operand 7 states. [2018-10-26 20:05:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:28,142 INFO L93 Difference]: Finished difference Result 1271 states and 1876 transitions. [2018-10-26 20:05:28,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:28,144 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-10-26 20:05:28,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:28,146 INFO L225 Difference]: With dead ends: 1271 [2018-10-26 20:05:28,146 INFO L226 Difference]: Without dead ends: 681 [2018-10-26 20:05:28,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-10-26 20:05:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 616. [2018-10-26 20:05:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-10-26 20:05:28,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 910 transitions. [2018-10-26 20:05:28,183 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 910 transitions. Word has length 107 [2018-10-26 20:05:28,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:28,184 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 910 transitions. [2018-10-26 20:05:28,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:28,184 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 910 transitions. [2018-10-26 20:05:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:05:28,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:28,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, 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-10-26 20:05:28,185 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:28,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:28,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1792478521, now seen corresponding path program 1 times [2018-10-26 20:05:28,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:28,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:28,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:28,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:28,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:28,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:28,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,878 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:28,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 19 treesize of output 15 [2018-10-26 20:05:28,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:28,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:28,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:28,915 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:28,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:28,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:28,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:28,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:28,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:28,919 INFO L87 Difference]: Start difference. First operand 616 states and 910 transitions. Second operand 4 states. [2018-10-26 20:05:31,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:31,523 INFO L93 Difference]: Finished difference Result 1227 states and 1818 transitions. [2018-10-26 20:05:31,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:31,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2018-10-26 20:05:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:31,528 INFO L225 Difference]: With dead ends: 1227 [2018-10-26 20:05:31,528 INFO L226 Difference]: Without dead ends: 637 [2018-10-26 20:05:31,529 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-10-26 20:05:31,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-10-26 20:05:31,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 618. [2018-10-26 20:05:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-26 20:05:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 912 transitions. [2018-10-26 20:05:31,567 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 912 transitions. Word has length 108 [2018-10-26 20:05:31,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:31,567 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 912 transitions. [2018-10-26 20:05:31,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:31,567 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 912 transitions. [2018-10-26 20:05:31,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:05:31,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:31,568 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, 1] [2018-10-26 20:05:31,568 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:31,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:31,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1534650997, now seen corresponding path program 1 times [2018-10-26 20:05:31,569 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:31,569 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:31,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:32,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:32,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:32,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 13 treesize of output 10 [2018-10-26 20:05:32,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:32,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:32,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-10-26 20:05:32,888 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:32,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:32,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:32,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:32,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 15 treesize of output 3 [2018-10-26 20:05:32,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:32,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:32,940 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:32,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:32,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:32,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:32,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:32,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:32,945 INFO L87 Difference]: Start difference. First operand 618 states and 912 transitions. Second operand 7 states. [2018-10-26 20:05:33,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:33,974 INFO L93 Difference]: Finished difference Result 1355 states and 1986 transitions. [2018-10-26 20:05:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:33,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-10-26 20:05:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:33,979 INFO L225 Difference]: With dead ends: 1355 [2018-10-26 20:05:33,979 INFO L226 Difference]: Without dead ends: 763 [2018-10-26 20:05:33,980 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-10-26 20:05:33,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2018-10-26 20:05:34,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 618. [2018-10-26 20:05:34,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-26 20:05:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 910 transitions. [2018-10-26 20:05:34,017 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 910 transitions. Word has length 108 [2018-10-26 20:05:34,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:34,017 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 910 transitions. [2018-10-26 20:05:34,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:34,017 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 910 transitions. [2018-10-26 20:05:34,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-26 20:05:34,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:34,018 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, 1] [2018-10-26 20:05:34,018 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:34,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2095350775, now seen corresponding path program 1 times [2018-10-26 20:05:34,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:34,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:34,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:35,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:35,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:35,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:35,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:35,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:35,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:35,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:35,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:35,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:35,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:35,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:35,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:35,424 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:35,424 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:35,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:35,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:35,429 INFO L87 Difference]: Start difference. First operand 618 states and 910 transitions. Second operand 7 states. [2018-10-26 20:05:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:36,586 INFO L93 Difference]: Finished difference Result 1275 states and 1872 transitions. [2018-10-26 20:05:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:36,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-10-26 20:05:36,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:36,590 INFO L225 Difference]: With dead ends: 1275 [2018-10-26 20:05:36,590 INFO L226 Difference]: Without dead ends: 683 [2018-10-26 20:05:36,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-10-26 20:05:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 618. [2018-10-26 20:05:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-26 20:05:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 908 transitions. [2018-10-26 20:05:36,634 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 908 transitions. Word has length 108 [2018-10-26 20:05:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:36,635 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 908 transitions. [2018-10-26 20:05:36,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 908 transitions. [2018-10-26 20:05:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:05:36,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:36,636 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, 1] [2018-10-26 20:05:36,636 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:36,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:36,636 INFO L82 PathProgramCache]: Analyzing trace with hash 632335343, now seen corresponding path program 1 times [2018-10-26 20:05:36,637 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:36,637 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:36,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:37,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:37,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:37,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:37,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:37,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-10-26 20:05:37,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:37,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:37,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:37,403 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:37,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:37,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:37,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:37,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:37,407 INFO L87 Difference]: Start difference. First operand 618 states and 908 transitions. Second operand 4 states. [2018-10-26 20:05:40,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:40,073 INFO L93 Difference]: Finished difference Result 1229 states and 1810 transitions. [2018-10-26 20:05:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:40,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-10-26 20:05:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:40,077 INFO L225 Difference]: With dead ends: 1229 [2018-10-26 20:05:40,077 INFO L226 Difference]: Without dead ends: 637 [2018-10-26 20:05:40,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:40,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-10-26 20:05:40,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 620. [2018-10-26 20:05:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-26 20:05:40,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 910 transitions. [2018-10-26 20:05:40,120 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 910 transitions. Word has length 109 [2018-10-26 20:05:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:40,120 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 910 transitions. [2018-10-26 20:05:40,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 910 transitions. [2018-10-26 20:05:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:05:40,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:40,122 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, 1] [2018-10-26 20:05:40,122 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:40,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -573171225, now seen corresponding path program 1 times [2018-10-26 20:05:40,123 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:40,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:40,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:41,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:41,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:41,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-10-26 20:05:41,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:41,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:41,528 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:41,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:41,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:41,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:41,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:41,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:41,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:41,589 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:41,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:41,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:41,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:41,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:41,594 INFO L87 Difference]: Start difference. First operand 620 states and 910 transitions. Second operand 7 states. [2018-10-26 20:05:42,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:42,962 INFO L93 Difference]: Finished difference Result 1339 states and 1956 transitions. [2018-10-26 20:05:42,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:42,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-26 20:05:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:42,967 INFO L225 Difference]: With dead ends: 1339 [2018-10-26 20:05:42,967 INFO L226 Difference]: Without dead ends: 745 [2018-10-26 20:05:42,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2018-10-26 20:05:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 620. [2018-10-26 20:05:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-26 20:05:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 908 transitions. [2018-10-26 20:05:43,020 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 908 transitions. Word has length 109 [2018-10-26 20:05:43,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:43,020 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 908 transitions. [2018-10-26 20:05:43,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 908 transitions. [2018-10-26 20:05:43,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-26 20:05:43,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:43,021 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, 1] [2018-10-26 20:05:43,022 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:43,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:43,022 INFO L82 PathProgramCache]: Analyzing trace with hash -371347291, now seen corresponding path program 1 times [2018-10-26 20:05:43,023 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:43,023 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:44,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:44,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:44,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:44,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:44,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:44,467 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:44,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-10-26 20:05:44,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:44,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-10-26 20:05:44,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-10-26 20:05:44,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:44,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:05:44,526 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:44,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (60)] Exception during sending of exit command (exit): Broken pipe [2018-10-26 20:05:44,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:44,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:44,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:44,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:44,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:44,535 INFO L87 Difference]: Start difference. First operand 620 states and 908 transitions. Second operand 7 states. [2018-10-26 20:05:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:47,534 INFO L93 Difference]: Finished difference Result 1259 states and 1842 transitions. [2018-10-26 20:05:47,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:47,537 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-10-26 20:05:47,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:47,538 INFO L225 Difference]: With dead ends: 1259 [2018-10-26 20:05:47,538 INFO L226 Difference]: Without dead ends: 665 [2018-10-26 20:05:47,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-10-26 20:05:47,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 620. [2018-10-26 20:05:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-26 20:05:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 906 transitions. [2018-10-26 20:05:47,584 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 906 transitions. Word has length 109 [2018-10-26 20:05:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:47,584 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 906 transitions. [2018-10-26 20:05:47,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 906 transitions. [2018-10-26 20:05:47,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-26 20:05:47,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:47,585 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, 1, 1] [2018-10-26 20:05:47,585 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:47,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:47,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1285320162, now seen corresponding path program 1 times [2018-10-26 20:05:47,586 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:47,586 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:47,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:48,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:48,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:48,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:48,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:48,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:48,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:48,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:48,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:05:48,375 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:48,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:48,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:48,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:48,380 INFO L87 Difference]: Start difference. First operand 620 states and 906 transitions. Second operand 4 states. [2018-10-26 20:05:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:50,931 INFO L93 Difference]: Finished difference Result 988 states and 1437 transitions. [2018-10-26 20:05:50,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:05:50,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-10-26 20:05:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:50,935 INFO L225 Difference]: With dead ends: 988 [2018-10-26 20:05:50,935 INFO L226 Difference]: Without dead ends: 348 [2018-10-26 20:05:50,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:05:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-26 20:05:50,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 341. [2018-10-26 20:05:50,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-26 20:05:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 505 transitions. [2018-10-26 20:05:50,973 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 505 transitions. Word has length 110 [2018-10-26 20:05:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:50,973 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 505 transitions. [2018-10-26 20:05:50,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:05:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 505 transitions. [2018-10-26 20:05:50,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 20:05:50,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:50,982 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:50,982 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:50,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:50,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1222238925, now seen corresponding path program 1 times [2018-10-26 20:05:50,983 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:50,983 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:51,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:52,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:52,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:52,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:52,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:05:52,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:05:52,249 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:52,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:52,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:05:52,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 17 treesize of output 13 [2018-10-26 20:05:52,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:05:52,276 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,280 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:52,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:05:52,298 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:05:52,298 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:52,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:52,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:52,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:52,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:52,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:52,305 INFO L87 Difference]: Start difference. First operand 341 states and 505 transitions. Second operand 7 states. [2018-10-26 20:05:53,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:53,335 INFO L93 Difference]: Finished difference Result 694 states and 1036 transitions. [2018-10-26 20:05:53,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:53,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-10-26 20:05:53,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:53,339 INFO L225 Difference]: With dead ends: 694 [2018-10-26 20:05:53,339 INFO L226 Difference]: Without dead ends: 404 [2018-10-26 20:05:53,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 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-10-26 20:05:53,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-26 20:05:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 341. [2018-10-26 20:05:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-26 20:05:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 504 transitions. [2018-10-26 20:05:53,372 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 504 transitions. Word has length 113 [2018-10-26 20:05:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:53,372 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 504 transitions. [2018-10-26 20:05:53,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 504 transitions. [2018-10-26 20:05:53,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-26 20:05:53,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:53,374 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:53,374 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:53,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:53,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1167846027, now seen corresponding path program 1 times [2018-10-26 20:05:53,375 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:53,375 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:54,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:54,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:05:54,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:05:54,749 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:05:54,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:05:54,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:54,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:54,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:54,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:54,775 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:05:54,819 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:05:54,819 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:54,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:54,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:05:54,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:05:54,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:05:54,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:05:54,825 INFO L87 Difference]: Start difference. First operand 341 states and 504 transitions. Second operand 7 states. [2018-10-26 20:05:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:05:57,567 INFO L93 Difference]: Finished difference Result 693 states and 1037 transitions. [2018-10-26 20:05:57,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:05:57,569 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-10-26 20:05:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:05:57,570 INFO L225 Difference]: With dead ends: 693 [2018-10-26 20:05:57,570 INFO L226 Difference]: Without dead ends: 403 [2018-10-26 20:05:57,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:05:57,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2018-10-26 20:05:57,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 368. [2018-10-26 20:05:57,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-26 20:05:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 549 transitions. [2018-10-26 20:05:57,593 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 549 transitions. Word has length 113 [2018-10-26 20:05:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:05:57,594 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 549 transitions. [2018-10-26 20:05:57,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:05:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 549 transitions. [2018-10-26 20:05:57,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-26 20:05:57,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:05:57,594 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:05:57,595 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:05:57,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:05:57,595 INFO L82 PathProgramCache]: Analyzing trace with hash 550997210, now seen corresponding path program 1 times [2018-10-26 20:05:57,595 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:05:57,595 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:05:57,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:05:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:05:58,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:05:58,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:05:58,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:05:58,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:05:58,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:05:58,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:05:58,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:05:58,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:05:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:05:58,233 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:05:58,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:05:58,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:05:58,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:05:58,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:05:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:05:58,237 INFO L87 Difference]: Start difference. First operand 368 states and 549 transitions. Second operand 4 states. [2018-10-26 20:06:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:00,985 INFO L93 Difference]: Finished difference Result 761 states and 1150 transitions. [2018-10-26 20:06:00,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:00,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-10-26 20:06:00,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:00,987 INFO L225 Difference]: With dead ends: 761 [2018-10-26 20:06:00,988 INFO L226 Difference]: Without dead ends: 444 [2018-10-26 20:06:00,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:00,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-26 20:06:01,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 399. [2018-10-26 20:06:01,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:01,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 602 transitions. [2018-10-26 20:06:01,009 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 602 transitions. Word has length 116 [2018-10-26 20:06:01,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:01,009 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 602 transitions. [2018-10-26 20:06:01,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:01,009 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 602 transitions. [2018-10-26 20:06:01,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-26 20:06:01,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:01,010 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, 1] [2018-10-26 20:06:01,010 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:01,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:01,010 INFO L82 PathProgramCache]: Analyzing trace with hash 484593370, now seen corresponding path program 1 times [2018-10-26 20:06:01,011 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:01,011 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:01,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:02,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:02,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:02,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:02,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:02,339 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:02,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:02,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:02,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:02,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:02,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:02,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:02,394 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:02,394 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:02,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:02,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:02,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:02,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:02,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:02,401 INFO L87 Difference]: Start difference. First operand 399 states and 602 transitions. Second operand 7 states. [2018-10-26 20:06:05,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:05,595 INFO L93 Difference]: Finished difference Result 810 states and 1230 transitions. [2018-10-26 20:06:05,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:05,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2018-10-26 20:06:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:05,598 INFO L225 Difference]: With dead ends: 810 [2018-10-26 20:06:05,599 INFO L226 Difference]: Without dead ends: 462 [2018-10-26 20:06:05,599 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-10-26 20:06:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-26 20:06:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 399. [2018-10-26 20:06:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 601 transitions. [2018-10-26 20:06:05,640 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 601 transitions. Word has length 118 [2018-10-26 20:06:05,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:05,640 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 601 transitions. [2018-10-26 20:06:05,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 601 transitions. [2018-10-26 20:06:05,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 20:06:05,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:05,641 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, 1] [2018-10-26 20:06:05,641 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:05,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:05,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2067429233, now seen corresponding path program 1 times [2018-10-26 20:06:05,642 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:05,642 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:05,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:07,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:07,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 13 treesize of output 10 [2018-10-26 20:06:07,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:07,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:07,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:07,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:07,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:07,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:07,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:06:07,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:06:07,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:07,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:06:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 20:06:07,277 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:07,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:07,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:07,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:07,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:07,285 INFO L87 Difference]: Start difference. First operand 399 states and 601 transitions. Second operand 7 states. [2018-10-26 20:06:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:10,367 INFO L93 Difference]: Finished difference Result 800 states and 1216 transitions. [2018-10-26 20:06:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:10,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-26 20:06:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:10,371 INFO L225 Difference]: With dead ends: 800 [2018-10-26 20:06:10,371 INFO L226 Difference]: Without dead ends: 452 [2018-10-26 20:06:10,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:06:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-26 20:06:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-10-26 20:06:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 600 transitions. [2018-10-26 20:06:10,397 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 600 transitions. Word has length 119 [2018-10-26 20:06:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:10,397 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 600 transitions. [2018-10-26 20:06:10,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 600 transitions. [2018-10-26 20:06:10,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 20:06:10,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:10,399 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, 1] [2018-10-26 20:06:10,399 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:10,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:10,399 INFO L82 PathProgramCache]: Analyzing trace with hash -131347132, now seen corresponding path program 1 times [2018-10-26 20:06:10,400 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:10,400 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:10,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:11,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:11,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:11,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:11,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:11,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:11,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:11,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-10-26 20:06:11,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:11,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:11,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-10-26 20:06:11,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:11,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:11,745 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:11,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:11,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:11,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:11,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:11,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:11,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:11,751 INFO L87 Difference]: Start difference. First operand 399 states and 600 transitions. Second operand 7 states. [2018-10-26 20:06:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:12,600 INFO L93 Difference]: Finished difference Result 800 states and 1214 transitions. [2018-10-26 20:06:12,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:12,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-26 20:06:12,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:12,603 INFO L225 Difference]: With dead ends: 800 [2018-10-26 20:06:12,603 INFO L226 Difference]: Without dead ends: 452 [2018-10-26 20:06:12,604 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-10-26 20:06:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-10-26 20:06:12,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 399. [2018-10-26 20:06:12,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 599 transitions. [2018-10-26 20:06:12,624 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 599 transitions. Word has length 119 [2018-10-26 20:06:12,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:12,624 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 599 transitions. [2018-10-26 20:06:12,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:12,624 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 599 transitions. [2018-10-26 20:06:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 20:06:12,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:12,625 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, 1] [2018-10-26 20:06:12,625 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:12,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:12,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1701555508, now seen corresponding path program 1 times [2018-10-26 20:06:12,626 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:12,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:12,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:13,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:13,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:13,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:13,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:13,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:13,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:13,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:13,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,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-10-26 20:06:13,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:13,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:13,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:13,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:13,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:13,884 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:13,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:13,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:13,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:13,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:13,889 INFO L87 Difference]: Start difference. First operand 399 states and 599 transitions. Second operand 7 states. [2018-10-26 20:06:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:16,810 INFO L93 Difference]: Finished difference Result 798 states and 1210 transitions. [2018-10-26 20:06:16,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:16,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-26 20:06:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:16,813 INFO L225 Difference]: With dead ends: 798 [2018-10-26 20:06:16,813 INFO L226 Difference]: Without dead ends: 450 [2018-10-26 20:06:16,814 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-10-26 20:06:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-26 20:06:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 399. [2018-10-26 20:06:16,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 598 transitions. [2018-10-26 20:06:16,848 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 598 transitions. Word has length 119 [2018-10-26 20:06:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:16,848 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 598 transitions. [2018-10-26 20:06:16,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:16,848 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 598 transitions. [2018-10-26 20:06:16,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-26 20:06:16,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:16,849 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, 1] [2018-10-26 20:06:16,849 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:16,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:16,849 INFO L82 PathProgramCache]: Analyzing trace with hash -319080273, now seen corresponding path program 1 times [2018-10-26 20:06:16,861 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:16,861 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:16,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:18,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:18,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-10-26 20:06:18,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-10-26 20:06:18,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:18,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:18,241 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:18,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:18,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,263 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:18,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:06:18,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:06:18,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:18,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:06:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-10-26 20:06:18,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:18,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:18,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:18,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:18,296 INFO L87 Difference]: Start difference. First operand 399 states and 598 transitions. Second operand 7 states. [2018-10-26 20:06:21,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:21,251 INFO L93 Difference]: Finished difference Result 760 states and 1151 transitions. [2018-10-26 20:06:21,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:21,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-10-26 20:06:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:21,254 INFO L225 Difference]: With dead ends: 760 [2018-10-26 20:06:21,254 INFO L226 Difference]: Without dead ends: 412 [2018-10-26 20:06:21,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:06:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-26 20:06:21,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 399. [2018-10-26 20:06:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:21,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 597 transitions. [2018-10-26 20:06:21,279 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 597 transitions. Word has length 119 [2018-10-26 20:06:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:21,279 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 597 transitions. [2018-10-26 20:06:21,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:21,279 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 597 transitions. [2018-10-26 20:06:21,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 20:06:21,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:21,280 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, 1] [2018-10-26 20:06:21,280 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:21,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1130069586, now seen corresponding path program 1 times [2018-10-26 20:06:21,281 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:21,281 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:21,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:22,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:22,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:22,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:22,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:22,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:22,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 23 treesize of output 18 [2018-10-26 20:06:22,741 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:22,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:22,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:22,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:22,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:22,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:22,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:22,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:22,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:22,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:22,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:22,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:22,800 INFO L87 Difference]: Start difference. First operand 399 states and 597 transitions. Second operand 7 states. [2018-10-26 20:06:25,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:25,851 INFO L93 Difference]: Finished difference Result 796 states and 1203 transitions. [2018-10-26 20:06:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:25,853 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-10-26 20:06:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:25,854 INFO L225 Difference]: With dead ends: 796 [2018-10-26 20:06:25,854 INFO L226 Difference]: Without dead ends: 448 [2018-10-26 20:06:25,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 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-10-26 20:06:25,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-26 20:06:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 399. [2018-10-26 20:06:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 596 transitions. [2018-10-26 20:06:25,877 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 596 transitions. Word has length 120 [2018-10-26 20:06:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:25,877 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 596 transitions. [2018-10-26 20:06:25,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 596 transitions. [2018-10-26 20:06:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-26 20:06:25,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:25,878 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, 1] [2018-10-26 20:06:25,878 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:25,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:25,878 INFO L82 PathProgramCache]: Analyzing trace with hash 782549528, now seen corresponding path program 1 times [2018-10-26 20:06:25,879 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:25,879 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:25,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:26,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:27,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:27,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:27,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:27,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:27,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:27,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:27,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:27,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:27,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:27,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:27,085 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:27,105 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:27,105 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:27,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:27,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:27,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:27,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:27,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:27,110 INFO L87 Difference]: Start difference. First operand 399 states and 596 transitions. Second operand 7 states. [2018-10-26 20:06:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:29,908 INFO L93 Difference]: Finished difference Result 793 states and 1197 transitions. [2018-10-26 20:06:29,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:29,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-10-26 20:06:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:29,911 INFO L225 Difference]: With dead ends: 793 [2018-10-26 20:06:29,911 INFO L226 Difference]: Without dead ends: 445 [2018-10-26 20:06:29,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 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-10-26 20:06:29,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-10-26 20:06:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 399. [2018-10-26 20:06:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-26 20:06:29,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 595 transitions. [2018-10-26 20:06:29,946 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 595 transitions. Word has length 120 [2018-10-26 20:06:29,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:29,950 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 595 transitions. [2018-10-26 20:06:29,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 595 transitions. [2018-10-26 20:06:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 20:06:29,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:29,951 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:29,951 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:29,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1125001675, now seen corresponding path program 1 times [2018-10-26 20:06:29,952 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:29,952 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:30,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:30,191 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:30,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:30,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:30,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:30,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:30,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:30,195 INFO L87 Difference]: Start difference. First operand 399 states and 595 transitions. Second operand 3 states. [2018-10-26 20:06:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:30,270 INFO L93 Difference]: Finished difference Result 1090 states and 1653 transitions. [2018-10-26 20:06:30,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:30,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2018-10-26 20:06:30,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:30,273 INFO L225 Difference]: With dead ends: 1090 [2018-10-26 20:06:30,274 INFO L226 Difference]: Without dead ends: 742 [2018-10-26 20:06:30,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-10-26 20:06:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 740. [2018-10-26 20:06:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-26 20:06:30,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1105 transitions. [2018-10-26 20:06:30,313 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1105 transitions. Word has length 122 [2018-10-26 20:06:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:30,313 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1105 transitions. [2018-10-26 20:06:30,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1105 transitions. [2018-10-26 20:06:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-26 20:06:30,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:30,314 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:06:30,314 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:30,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:30,314 INFO L82 PathProgramCache]: Analyzing trace with hash -701354953, now seen corresponding path program 1 times [2018-10-26 20:06:30,315 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:30,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:31,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:31,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:31,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-10-26 20:06:31,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:31,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:31,601 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:31,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:31,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:31,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 17 treesize of output 13 [2018-10-26 20:06:31,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:31,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:31,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:31,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:31,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:31,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:31,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:31,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:31,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:31,657 INFO L87 Difference]: Start difference. First operand 740 states and 1105 transitions. Second operand 7 states. [2018-10-26 20:06:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:32,595 INFO L93 Difference]: Finished difference Result 1520 states and 2271 transitions. [2018-10-26 20:06:32,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:32,597 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 122 [2018-10-26 20:06:32,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:32,598 INFO L225 Difference]: With dead ends: 1520 [2018-10-26 20:06:32,599 INFO L226 Difference]: Without dead ends: 831 [2018-10-26 20:06:32,599 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-10-26 20:06:32,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2018-10-26 20:06:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 740. [2018-10-26 20:06:32,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-26 20:06:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1103 transitions. [2018-10-26 20:06:32,669 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1103 transitions. Word has length 122 [2018-10-26 20:06:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:32,669 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1103 transitions. [2018-10-26 20:06:32,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1103 transitions. [2018-10-26 20:06:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 20:06:32,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:32,678 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, 1] [2018-10-26 20:06:32,678 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:32,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:32,678 INFO L82 PathProgramCache]: Analyzing trace with hash 2009359305, now seen corresponding path program 1 times [2018-10-26 20:06:32,679 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:32,679 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:32,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:34,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:34,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:34,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:34,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:34,037 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:34,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:34,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,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-10-26 20:06:34,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:34,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:34,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:34,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:34,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-10-26 20:06:34,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:34,080 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:34,080 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:34,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:34,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:34,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:34,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:34,085 INFO L87 Difference]: Start difference. First operand 740 states and 1103 transitions. Second operand 7 states. [2018-10-26 20:06:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:36,892 INFO L93 Difference]: Finished difference Result 1504 states and 2241 transitions. [2018-10-26 20:06:36,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:36,894 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-10-26 20:06:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:36,895 INFO L225 Difference]: With dead ends: 1504 [2018-10-26 20:06:36,895 INFO L226 Difference]: Without dead ends: 815 [2018-10-26 20:06:36,896 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-10-26 20:06:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-26 20:06:36,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 740. [2018-10-26 20:06:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-26 20:06:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1101 transitions. [2018-10-26 20:06:36,935 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1101 transitions. Word has length 123 [2018-10-26 20:06:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:36,935 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 1101 transitions. [2018-10-26 20:06:36,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1101 transitions. [2018-10-26 20:06:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-26 20:06:36,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:36,936 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] [2018-10-26 20:06:36,936 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:36,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1656769892, now seen corresponding path program 1 times [2018-10-26 20:06:36,937 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:36,937 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:36,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:37,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:37,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:37,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:37,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:06:37,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:06:37,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:06:37,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,542 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:37,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:06:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:06:37,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:37,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:37,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:06:37,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:37,562 INFO L87 Difference]: Start difference. First operand 740 states and 1101 transitions. Second operand 4 states. [2018-10-26 20:06:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:40,148 INFO L93 Difference]: Finished difference Result 1521 states and 2270 transitions. [2018-10-26 20:06:40,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:40,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-10-26 20:06:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:40,152 INFO L225 Difference]: With dead ends: 1521 [2018-10-26 20:06:40,152 INFO L226 Difference]: Without dead ends: 832 [2018-10-26 20:06:40,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-10-26 20:06:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 772. [2018-10-26 20:06:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-26 20:06:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1153 transitions. [2018-10-26 20:06:40,228 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1153 transitions. Word has length 123 [2018-10-26 20:06:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:40,228 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1153 transitions. [2018-10-26 20:06:40,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1153 transitions. [2018-10-26 20:06:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-26 20:06:40,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:40,229 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, 1] [2018-10-26 20:06:40,229 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:40,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:40,230 INFO L82 PathProgramCache]: Analyzing trace with hash -680846036, now seen corresponding path program 1 times [2018-10-26 20:06:40,230 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:40,230 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:40,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:41,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:41,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:41,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:41,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:41,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:41,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:41,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:41,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,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-10-26 20:06:41,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:41,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:41,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:41,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:41,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-10-26 20:06:41,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:41,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:41,766 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:41,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:41,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:41,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:41,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:41,767 INFO L87 Difference]: Start difference. First operand 772 states and 1153 transitions. Second operand 7 states. [2018-10-26 20:06:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:42,806 INFO L93 Difference]: Finished difference Result 1568 states and 2341 transitions. [2018-10-26 20:06:42,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:42,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-10-26 20:06:42,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:42,810 INFO L225 Difference]: With dead ends: 1568 [2018-10-26 20:06:42,810 INFO L226 Difference]: Without dead ends: 847 [2018-10-26 20:06:42,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:06:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2018-10-26 20:06:42,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 772. [2018-10-26 20:06:42,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-26 20:06:42,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1151 transitions. [2018-10-26 20:06:42,859 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1151 transitions. Word has length 124 [2018-10-26 20:06:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:42,859 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1151 transitions. [2018-10-26 20:06:42,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:42,860 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1151 transitions. [2018-10-26 20:06:42,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:06:42,861 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:42,861 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, 1] [2018-10-26 20:06:42,861 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:42,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1263244253, now seen corresponding path program 1 times [2018-10-26 20:06:42,862 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:42,862 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:42,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:43,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:44,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:44,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-10-26 20:06:44,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-10-26 20:06:44,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,214 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:44,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:44,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:44,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:44,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:44,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:44,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:44,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:44,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-10-26 20:06:44,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:44,295 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:44,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:44,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:44,300 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:44,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:44,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:44,300 INFO L87 Difference]: Start difference. First operand 772 states and 1151 transitions. Second operand 7 states. [2018-10-26 20:06:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:47,329 INFO L93 Difference]: Finished difference Result 1562 states and 2330 transitions. [2018-10-26 20:06:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:47,330 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-10-26 20:06:47,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:47,332 INFO L225 Difference]: With dead ends: 1562 [2018-10-26 20:06:47,333 INFO L226 Difference]: Without dead ends: 841 [2018-10-26 20:06:47,334 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-10-26 20:06:47,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-26 20:06:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 772. [2018-10-26 20:06:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2018-10-26 20:06:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1149 transitions. [2018-10-26 20:06:47,422 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1149 transitions. Word has length 125 [2018-10-26 20:06:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:47,426 INFO L481 AbstractCegarLoop]: Abstraction has 772 states and 1149 transitions. [2018-10-26 20:06:47,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1149 transitions. [2018-10-26 20:06:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-26 20:06:47,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:47,427 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, 1] [2018-10-26 20:06:47,427 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:47,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash -824130532, now seen corresponding path program 1 times [2018-10-26 20:06:47,434 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:47,434 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:47,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:48,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:48,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:48,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:06:48,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,179 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:06:48,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:06:48,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:06:48,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:48,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:06:48,215 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:06:48,215 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:48,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:48,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:06:48,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:06:48,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:06:48,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:06:48,220 INFO L87 Difference]: Start difference. First operand 772 states and 1149 transitions. Second operand 4 states. [2018-10-26 20:06:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:50,840 INFO L93 Difference]: Finished difference Result 1678 states and 2512 transitions. [2018-10-26 20:06:50,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:06:50,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-10-26 20:06:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:50,844 INFO L225 Difference]: With dead ends: 1678 [2018-10-26 20:06:50,844 INFO L226 Difference]: Without dead ends: 957 [2018-10-26 20:06:50,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:06:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-26 20:06:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 844. [2018-10-26 20:06:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:06:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1275 transitions. [2018-10-26 20:06:50,888 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1275 transitions. Word has length 125 [2018-10-26 20:06:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:50,888 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1275 transitions. [2018-10-26 20:06:50,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:06:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1275 transitions. [2018-10-26 20:06:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-26 20:06:50,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:50,889 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, 1] [2018-10-26 20:06:50,889 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:50,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash -341359932, now seen corresponding path program 1 times [2018-10-26 20:06:50,890 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:50,890 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:50,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:52,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:52,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:52,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-10-26 20:06:52,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:52,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:52,104 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:52,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:52,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,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-10-26 20:06:52,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:52,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:52,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:52,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:52,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:52,157 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:52,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:52,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:52,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:52,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:52,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:52,162 INFO L87 Difference]: Start difference. First operand 844 states and 1275 transitions. Second operand 7 states. [2018-10-26 20:06:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:55,016 INFO L93 Difference]: Finished difference Result 1706 states and 2578 transitions. [2018-10-26 20:06:55,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:55,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-10-26 20:06:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:55,020 INFO L225 Difference]: With dead ends: 1706 [2018-10-26 20:06:55,020 INFO L226 Difference]: Without dead ends: 913 [2018-10-26 20:06:55,021 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-10-26 20:06:55,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-26 20:06:55,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-10-26 20:06:55,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:06:55,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1273 transitions. [2018-10-26 20:06:55,064 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1273 transitions. Word has length 126 [2018-10-26 20:06:55,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:55,064 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1273 transitions. [2018-10-26 20:06:55,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1273 transitions. [2018-10-26 20:06:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-26 20:06:55,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:55,065 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, 1] [2018-10-26 20:06:55,065 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:55,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -457316197, now seen corresponding path program 1 times [2018-10-26 20:06:55,066 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:55,066 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:55,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:55,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:56,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:06:56,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:06:56,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 10 treesize of output 9 [2018-10-26 20:06:56,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:06:56,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:06:56,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:06:56,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:06:56,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,397 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:06:56,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:06:56,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:06:56,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:06:56,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:06:56,436 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:06:56,436 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:06:56,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:56,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:06:56,441 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:06:56,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:06:56,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:06:56,441 INFO L87 Difference]: Start difference. First operand 844 states and 1273 transitions. Second operand 7 states. [2018-10-26 20:06:59,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:59,385 INFO L93 Difference]: Finished difference Result 1700 states and 2567 transitions. [2018-10-26 20:06:59,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:06:59,386 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-10-26 20:06:59,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:59,387 INFO L225 Difference]: With dead ends: 1700 [2018-10-26 20:06:59,387 INFO L226 Difference]: Without dead ends: 907 [2018-10-26 20:06:59,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 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-10-26 20:06:59,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-10-26 20:06:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 844. [2018-10-26 20:06:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:06:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1271 transitions. [2018-10-26 20:06:59,462 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1271 transitions. Word has length 127 [2018-10-26 20:06:59,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:59,465 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1271 transitions. [2018-10-26 20:06:59,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:06:59,465 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1271 transitions. [2018-10-26 20:06:59,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-26 20:06:59,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:59,466 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, 1] [2018-10-26 20:06:59,466 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:59,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:59,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2074930197, now seen corresponding path program 1 times [2018-10-26 20:06:59,467 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:06:59,467 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:06:59,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:00,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:00,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:00,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:00,745 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:00,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:00,748 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,802 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:00,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:07:00,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 15 treesize of output 3 [2018-10-26 20:07:00,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:00,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:07:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:00,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:00,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:00,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:00,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:00,849 INFO L87 Difference]: Start difference. First operand 844 states and 1271 transitions. Second operand 7 states. [2018-10-26 20:07:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:03,847 INFO L93 Difference]: Finished difference Result 1706 states and 2567 transitions. [2018-10-26 20:07:03,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:03,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-10-26 20:07:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:03,851 INFO L225 Difference]: With dead ends: 1706 [2018-10-26 20:07:03,851 INFO L226 Difference]: Without dead ends: 913 [2018-10-26 20:07:03,852 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-10-26 20:07:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-26 20:07:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-10-26 20:07:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:07:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1269 transitions. [2018-10-26 20:07:03,910 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1269 transitions. Word has length 129 [2018-10-26 20:07:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:03,911 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1269 transitions. [2018-10-26 20:07:03,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1269 transitions. [2018-10-26 20:07:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-26 20:07:03,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:03,912 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, 1] [2018-10-26 20:07:03,912 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:03,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:03,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2110260847, now seen corresponding path program 1 times [2018-10-26 20:07:03,914 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:03,914 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:05,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:05,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:05,619 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:05,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:05,622 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,652 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:05,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-10-26 20:07:05,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-10-26 20:07:05,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:05,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:07:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:05,702 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:05,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:05,708 INFO L87 Difference]: Start difference. First operand 844 states and 1269 transitions. Second operand 7 states. [2018-10-26 20:07:06,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:06,845 INFO L93 Difference]: Finished difference Result 1706 states and 2563 transitions. [2018-10-26 20:07:06,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:06,846 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-10-26 20:07:06,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:06,848 INFO L225 Difference]: With dead ends: 1706 [2018-10-26 20:07:06,848 INFO L226 Difference]: Without dead ends: 913 [2018-10-26 20:07:06,849 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-10-26 20:07:06,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-26 20:07:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-10-26 20:07:06,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:07:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1267 transitions. [2018-10-26 20:07:06,906 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1267 transitions. Word has length 130 [2018-10-26 20:07:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1267 transitions. [2018-10-26 20:07:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1267 transitions. [2018-10-26 20:07:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-26 20:07:06,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:06,908 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, 1] [2018-10-26 20:07:06,909 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:06,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1845740784, now seen corresponding path program 1 times [2018-10-26 20:07:06,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:06,910 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:06,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:08,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:08,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:08,654 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:08,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:08,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,668 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:08,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:07:08,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:07:08,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:08,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-10-26 20:07:08,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:07:08,739 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:08,739 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:08,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:08,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:08,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:08,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:08,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:08,745 INFO L87 Difference]: Start difference. First operand 844 states and 1267 transitions. Second operand 7 states. [2018-10-26 20:07:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:09,795 INFO L93 Difference]: Finished difference Result 1706 states and 2559 transitions. [2018-10-26 20:07:09,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:09,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-10-26 20:07:09,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:09,798 INFO L225 Difference]: With dead ends: 1706 [2018-10-26 20:07:09,798 INFO L226 Difference]: Without dead ends: 913 [2018-10-26 20:07:09,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:07:09,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-26 20:07:09,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 844. [2018-10-26 20:07:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:07:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1265 transitions. [2018-10-26 20:07:09,900 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1265 transitions. Word has length 131 [2018-10-26 20:07:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:09,900 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1265 transitions. [2018-10-26 20:07:09,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:09,900 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1265 transitions. [2018-10-26 20:07:09,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 20:07:09,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:09,901 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-10-26 20:07:09,901 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:09,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:09,902 INFO L82 PathProgramCache]: Analyzing trace with hash 480677580, now seen corresponding path program 1 times [2018-10-26 20:07:09,902 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:09,902 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:09,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:11,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:11,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:11,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:11,321 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:11,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:11,324 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:11,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:07:11,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:07:11,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:11,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:07:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:11,399 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:11,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:11,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:11,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:11,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:11,406 INFO L87 Difference]: Start difference. First operand 844 states and 1265 transitions. Second operand 7 states. [2018-10-26 20:07:14,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:14,233 INFO L93 Difference]: Finished difference Result 1686 states and 2529 transitions. [2018-10-26 20:07:14,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:14,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-26 20:07:14,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:14,235 INFO L225 Difference]: With dead ends: 1686 [2018-10-26 20:07:14,235 INFO L226 Difference]: Without dead ends: 893 [2018-10-26 20:07:14,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:07:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-26 20:07:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 844. [2018-10-26 20:07:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-26 20:07:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1263 transitions. [2018-10-26 20:07:14,280 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1263 transitions. Word has length 132 [2018-10-26 20:07:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:14,281 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 1263 transitions. [2018-10-26 20:07:14,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:14,281 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1263 transitions. [2018-10-26 20:07:14,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-26 20:07:14,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:14,283 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] [2018-10-26 20:07:14,283 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:14,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:14,283 INFO L82 PathProgramCache]: Analyzing trace with hash 149095944, now seen corresponding path program 1 times [2018-10-26 20:07:14,284 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:14,284 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:14,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:14,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:14,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-26 20:07:14,459 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:14,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:14,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:07:14,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:07:14,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:07:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:14,462 INFO L87 Difference]: Start difference. First operand 844 states and 1263 transitions. Second operand 3 states. [2018-10-26 20:07:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:14,548 INFO L93 Difference]: Finished difference Result 1688 states and 2533 transitions. [2018-10-26 20:07:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:07:14,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-10-26 20:07:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:14,552 INFO L225 Difference]: With dead ends: 1688 [2018-10-26 20:07:14,552 INFO L226 Difference]: Without dead ends: 895 [2018-10-26 20:07:14,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:07:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-10-26 20:07:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2018-10-26 20:07:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-26 20:07:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1331 transitions. [2018-10-26 20:07:14,601 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1331 transitions. Word has length 132 [2018-10-26 20:07:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:14,601 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 1331 transitions. [2018-10-26 20:07:14,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:07:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1331 transitions. [2018-10-26 20:07:14,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-26 20:07:14,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:14,603 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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-10-26 20:07:14,603 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:14,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:14,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1666771433, now seen corresponding path program 1 times [2018-10-26 20:07:14,604 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:14,604 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:14,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:15,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:15,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:15,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:15,865 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:15,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-10-26 20:07:15,868 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,897 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,906 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:15,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:15,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:15,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:15,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:15,974 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:07:15,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:15,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 20:07:15,992 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:15,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:15,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:07:15,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:07:15,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:07:15,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:15,998 INFO L87 Difference]: Start difference. First operand 895 states and 1331 transitions. Second operand 9 states. [2018-10-26 20:07:19,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:19,635 INFO L93 Difference]: Finished difference Result 2249 states and 3355 transitions. [2018-10-26 20:07:19,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:07:19,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 133 [2018-10-26 20:07:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:19,639 INFO L225 Difference]: With dead ends: 2249 [2018-10-26 20:07:19,639 INFO L226 Difference]: Without dead ends: 1405 [2018-10-26 20:07:19,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 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-10-26 20:07:19,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2018-10-26 20:07:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 977. [2018-10-26 20:07:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2018-10-26 20:07:19,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1475 transitions. [2018-10-26 20:07:19,695 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1475 transitions. Word has length 133 [2018-10-26 20:07:19,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:19,695 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1475 transitions. [2018-10-26 20:07:19,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:07:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1475 transitions. [2018-10-26 20:07:19,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-26 20:07:19,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:19,697 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, 1, 1] [2018-10-26 20:07:19,697 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:19,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:19,697 INFO L82 PathProgramCache]: Analyzing trace with hash -109965874, now seen corresponding path program 1 times [2018-10-26 20:07:19,698 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:19,698 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:19,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:20,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:20,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:20,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:20,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:20,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:20,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:20,998 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:21,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:21,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:21,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:21,065 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:21,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:21,088 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:07:21,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:21,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 20:07:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:21,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:21,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:07:21,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:07:21,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:07:21,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:21,148 INFO L87 Difference]: Start difference. First operand 977 states and 1475 transitions. Second operand 9 states. [2018-10-26 20:07:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:24,952 INFO L93 Difference]: Finished difference Result 2365 states and 3571 transitions. [2018-10-26 20:07:24,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:07:24,955 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2018-10-26 20:07:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:24,957 INFO L225 Difference]: With dead ends: 2365 [2018-10-26 20:07:24,957 INFO L226 Difference]: Without dead ends: 1439 [2018-10-26 20:07:24,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:07:24,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2018-10-26 20:07:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1019. [2018-10-26 20:07:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2018-10-26 20:07:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1561 transitions. [2018-10-26 20:07:25,023 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1561 transitions. Word has length 134 [2018-10-26 20:07:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:25,023 INFO L481 AbstractCegarLoop]: Abstraction has 1019 states and 1561 transitions. [2018-10-26 20:07:25,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:07:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1561 transitions. [2018-10-26 20:07:25,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-26 20:07:25,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:25,024 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, 1, 1] [2018-10-26 20:07:25,025 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:25,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:25,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1676845348, now seen corresponding path program 1 times [2018-10-26 20:07:25,025 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:25,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:26,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:26,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:07:26,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:07:26,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:07:26,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:07:26,577 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:26,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:26,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:26,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:07:26,630 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-26 20:07:26,630 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:26,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:26,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:26,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:26,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:26,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:26,636 INFO L87 Difference]: Start difference. First operand 1019 states and 1561 transitions. Second operand 7 states. [2018-10-26 20:07:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:27,479 INFO L93 Difference]: Finished difference Result 2041 states and 3128 transitions. [2018-10-26 20:07:27,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:27,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 135 [2018-10-26 20:07:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:27,484 INFO L225 Difference]: With dead ends: 2041 [2018-10-26 20:07:27,484 INFO L226 Difference]: Without dead ends: 1073 [2018-10-26 20:07:27,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:07:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2018-10-26 20:07:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1025. [2018-10-26 20:07:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-10-26 20:07:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1567 transitions. [2018-10-26 20:07:27,542 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1567 transitions. Word has length 135 [2018-10-26 20:07:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:27,542 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1567 transitions. [2018-10-26 20:07:27,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1567 transitions. [2018-10-26 20:07:27,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-26 20:07:27,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:27,544 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, 1] [2018-10-26 20:07:27,544 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:27,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 310985188, now seen corresponding path program 1 times [2018-10-26 20:07:27,545 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:27,545 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:27,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:28,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:28,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:07:28,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:07:28,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:07:28,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-10-26 20:07:28,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-10-26 20:07:28,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:28,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:07:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:28,498 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:28,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:28,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:07:28,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:07:28,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:07:28,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:07:28,503 INFO L87 Difference]: Start difference. First operand 1025 states and 1567 transitions. Second operand 4 states. [2018-10-26 20:07:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:31,207 INFO L93 Difference]: Finished difference Result 2107 states and 3213 transitions. [2018-10-26 20:07:31,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:07:31,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-26 20:07:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:31,211 INFO L225 Difference]: With dead ends: 2107 [2018-10-26 20:07:31,211 INFO L226 Difference]: Without dead ends: 1133 [2018-10-26 20:07:31,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:07:31,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2018-10-26 20:07:31,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1025. [2018-10-26 20:07:31,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-10-26 20:07:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1565 transitions. [2018-10-26 20:07:31,281 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1565 transitions. Word has length 155 [2018-10-26 20:07:31,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:31,282 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1565 transitions. [2018-10-26 20:07:31,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:07:31,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1565 transitions. [2018-10-26 20:07:31,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-26 20:07:31,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:31,283 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, 1, 1] [2018-10-26 20:07:31,283 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:31,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:31,284 INFO L82 PathProgramCache]: Analyzing trace with hash -396688655, now seen corresponding path program 1 times [2018-10-26 20:07:31,284 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:31,284 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:31,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:33,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:33,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:33,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:33,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:33,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:33,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,109 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:33,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:33,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:33,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:33,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:33,182 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:07:33,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:33,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 20:07:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:33,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:33,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:07:33,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:07:33,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:07:33,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:33,209 INFO L87 Difference]: Start difference. First operand 1025 states and 1565 transitions. Second operand 9 states. [2018-10-26 20:07:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:36,789 INFO L93 Difference]: Finished difference Result 2565 states and 3929 transitions. [2018-10-26 20:07:36,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:07:36,790 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 163 [2018-10-26 20:07:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:36,792 INFO L225 Difference]: With dead ends: 2565 [2018-10-26 20:07:36,792 INFO L226 Difference]: Without dead ends: 1591 [2018-10-26 20:07:36,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:07:36,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-10-26 20:07:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1157. [2018-10-26 20:07:36,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-10-26 20:07:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1793 transitions. [2018-10-26 20:07:36,856 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1793 transitions. Word has length 163 [2018-10-26 20:07:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:36,856 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1793 transitions. [2018-10-26 20:07:36,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:07:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1793 transitions. [2018-10-26 20:07:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-26 20:07:36,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:36,858 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, 1, 1] [2018-10-26 20:07:36,858 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:36,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:36,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1792392413, now seen corresponding path program 1 times [2018-10-26 20:07:36,859 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:36,859 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:36,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:38,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:38,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:38,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:38,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:38,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:38,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:38,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,630 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:38,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:38,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:38,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:38,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:38,705 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:07:38,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:38,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 20:07:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:38,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:07:38,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:07:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:07:38,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:38,732 INFO L87 Difference]: Start difference. First operand 1157 states and 1793 transitions. Second operand 9 states. [2018-10-26 20:07:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:42,348 INFO L93 Difference]: Finished difference Result 2755 states and 4245 transitions. [2018-10-26 20:07:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:07:42,351 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2018-10-26 20:07:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:42,353 INFO L225 Difference]: With dead ends: 2755 [2018-10-26 20:07:42,353 INFO L226 Difference]: Without dead ends: 1649 [2018-10-26 20:07:42,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:07:42,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2018-10-26 20:07:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1233. [2018-10-26 20:07:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-10-26 20:07:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1923 transitions. [2018-10-26 20:07:42,435 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1923 transitions. Word has length 169 [2018-10-26 20:07:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:42,435 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1923 transitions. [2018-10-26 20:07:42,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:07:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1923 transitions. [2018-10-26 20:07:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-26 20:07:42,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:42,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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:07:42,437 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:42,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1264497058, now seen corresponding path program 1 times [2018-10-26 20:07:42,438 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:42,438 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:42,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:44,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:44,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 18 treesize of output 15 [2018-10-26 20:07:44,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:44,159 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:44,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:44,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,168 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,184 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:44,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:44,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:44,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,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-10-26 20:07:44,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:44,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:44,257 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:07:44,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:44,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:07:44,279 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:07:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:07:44,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:07:44,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:07:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:07:44,285 INFO L87 Difference]: Start difference. First operand 1233 states and 1923 transitions. Second operand 9 states. [2018-10-26 20:07:48,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:48,104 INFO L93 Difference]: Finished difference Result 2819 states and 4354 transitions. [2018-10-26 20:07:48,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:07:48,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2018-10-26 20:07:48,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:48,110 INFO L225 Difference]: With dead ends: 2819 [2018-10-26 20:07:48,110 INFO L226 Difference]: Without dead ends: 1637 [2018-10-26 20:07:48,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 335 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-10-26 20:07:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2018-10-26 20:07:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1233. [2018-10-26 20:07:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-10-26 20:07:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1919 transitions. [2018-10-26 20:07:48,189 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1919 transitions. Word has length 170 [2018-10-26 20:07:48,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:48,189 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1919 transitions. [2018-10-26 20:07:48,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:07:48,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1919 transitions. [2018-10-26 20:07:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-26 20:07:48,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:48,191 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, 1] [2018-10-26 20:07:48,192 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:48,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1610277282, now seen corresponding path program 1 times [2018-10-26 20:07:48,193 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:07:48,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:50,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:50,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:07:50,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:07:50,695 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:50,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:50,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,709 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,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-10-26 20:07:50,727 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:07:50,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:07:50,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:07:50,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,751 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:50,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:07:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:07:50,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:07:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:07:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:07:50,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:07:50,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:07:50,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:07:50,790 INFO L87 Difference]: Start difference. First operand 1233 states and 1919 transitions. Second operand 7 states. [2018-10-26 20:07:53,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:07:53,741 INFO L93 Difference]: Finished difference Result 2445 states and 3814 transitions. [2018-10-26 20:07:53,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:07:53,744 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2018-10-26 20:07:53,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:07:53,745 INFO L225 Difference]: With dead ends: 2445 [2018-10-26 20:07:53,745 INFO L226 Difference]: Without dead ends: 1263 [2018-10-26 20:07:53,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:07:53,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-10-26 20:07:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1233. [2018-10-26 20:07:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2018-10-26 20:07:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 1917 transitions. [2018-10-26 20:07:53,808 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 1917 transitions. Word has length 172 [2018-10-26 20:07:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:07:53,808 INFO L481 AbstractCegarLoop]: Abstraction has 1233 states and 1917 transitions. [2018-10-26 20:07:53,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:07:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 1917 transitions. [2018-10-26 20:07:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-26 20:07:53,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:07:53,810 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, 1, 1, 1] [2018-10-26 20:07:53,810 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:07:53,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:07:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash -208047317, now seen corresponding path program 1 times [2018-10-26 20:07:53,811 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:07:53,811 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 94 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 94 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:07:53,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:56,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:56,820 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:56,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-10-26 20:07:56,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-10-26 20:07:56,869 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:56,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:56,880 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:56,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-10-26 20:07:56,881 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:56,922 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:07:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:07:57,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:07:57,054 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,056 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:07:57,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,075 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,084 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,093 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:07:57,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:07:57,132 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,139 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,166 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-10-26 20:07:57,318 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-10-26 20:07:57,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:07:57,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-10-26 20:07:57,379 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:07:57,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-10-26 20:07:57,381 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,410 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-10-26 20:07:57,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-26 20:07:57,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-10-26 20:07:57,449 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-10-26 20:07:57,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:07:57,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-10-26 20:07:57,479 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-10-26 20:07:57,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-26 20:07:57,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 20:07:57,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-26 20:07:57,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 1 [2018-10-26 20:07:57,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-10-26 20:07:57,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:07:57,687 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,690 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:07:57,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-10-26 20:07:57,697 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:07:57,706 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:07:57,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,716 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-10-26 20:07:57,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:07:57,744 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:57,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:07:57,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:07:57,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:07:57,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:07:57,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:57,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:07:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:57,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:07:58,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 34 treesize of output 25 [2018-10-26 20:07:58,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2018-10-26 20:07:58,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-26 20:07:58,060 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-10-26 20:07:58,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:07:58,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:07:58,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-26 20:07:58,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-10-26 20:07:58,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,515 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-10-26 20:07:58,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-10-26 20:07:58,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-10-26 20:07:58,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:58,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-10-26 20:07:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:07:59,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:07:59,042 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:07:59,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:07:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:07:59,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:07:59,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:07:59,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:07:59,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:07:59,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,529 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:07:59,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:07:59,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:59,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:07:59,570 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:59,572 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:59,574 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:59,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:07:59,580 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,592 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,601 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,609 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,627 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-10-26 20:07:59,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-10-26 20:07:59,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-10-26 20:07:59,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,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 23 treesize of output 19 [2018-10-26 20:07:59,805 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:07:59,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-10-26 20:07:59,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,811 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,818 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-10-26 20:07:59,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 13 treesize of output 10 [2018-10-26 20:07:59,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:07:59,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-10-26 20:07:59,906 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:07:59,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-10-26 20:07:59,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-10-26 20:07:59,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:07:59,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-10-26 20:07:59,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:07:59,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-10-26 20:07:59,939 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:07:59,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:08:00,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,010 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-10-26 20:08:00,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 23 treesize of output 18 [2018-10-26 20:08:00,018 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:08:00,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:08:00,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:08:00,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:08:00,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:08:00,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,046 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:08:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:08:00,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:08:00,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:08:00,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:08:00,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-10-26 20:08:00,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 8 treesize of output 1 [2018-10-26 20:08:00,307 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,311 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:00,332 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-10-26 20:08:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-10-26 20:08:00,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:08:00,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-10-26 20:08:00,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-26 20:08:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-26 20:08:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-10-26 20:08:00,792 INFO L87 Difference]: Start difference. First operand 1233 states and 1917 transitions. Second operand 24 states. [2018-10-26 20:08:11,256 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-10-26 20:08:13,195 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-10-26 20:08:15,336 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-26 20:08:18,145 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-10-26 20:08:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:19,009 INFO L93 Difference]: Finished difference Result 2787 states and 4284 transitions. [2018-10-26 20:08:19,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:08:19,011 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 178 [2018-10-26 20:08:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:19,012 INFO L225 Difference]: With dead ends: 2787 [2018-10-26 20:08:19,012 INFO L226 Difference]: Without dead ends: 1605 [2018-10-26 20:08:19,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 685 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-10-26 20:08:19,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2018-10-26 20:08:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1165. [2018-10-26 20:08:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1799 transitions. [2018-10-26 20:08:19,095 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1799 transitions. Word has length 178 [2018-10-26 20:08:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:19,095 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1799 transitions. [2018-10-26 20:08:19,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-26 20:08:19,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1799 transitions. [2018-10-26 20:08:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:08:19,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:19,097 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] [2018-10-26 20:08:19,097 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:19,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1988960283, now seen corresponding path program 1 times [2018-10-26 20:08:19,098 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:19,099 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:19,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:20,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:20,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:20,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:20,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:20,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:20,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:20,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:20,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:20,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:20,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:20,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:20,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-10-26 20:08:20,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:20,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:20,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:20,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:20,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:20,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:20,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:20,240 INFO L87 Difference]: Start difference. First operand 1165 states and 1799 transitions. Second operand 4 states. [2018-10-26 20:08:22,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:22,816 INFO L93 Difference]: Finished difference Result 2320 states and 3589 transitions. [2018-10-26 20:08:22,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:22,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-26 20:08:22,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:22,820 INFO L225 Difference]: With dead ends: 2320 [2018-10-26 20:08:22,820 INFO L226 Difference]: Without dead ends: 1206 [2018-10-26 20:08:22,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-26 20:08:22,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-10-26 20:08:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1797 transitions. [2018-10-26 20:08:22,894 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1797 transitions. Word has length 182 [2018-10-26 20:08:22,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:22,895 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1797 transitions. [2018-10-26 20:08:22,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:22,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1797 transitions. [2018-10-26 20:08:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-26 20:08:22,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:22,896 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] [2018-10-26 20:08:22,897 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:22,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash -276746631, now seen corresponding path program 1 times [2018-10-26 20:08:22,898 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:22,898 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:22,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:23,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:23,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 13 treesize of output 10 [2018-10-26 20:08:23,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:23,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:23,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:23,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-10-26 20:08:23,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:23,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:24,000 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:24,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:24,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:24,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:24,005 INFO L87 Difference]: Start difference. First operand 1165 states and 1797 transitions. Second operand 4 states. [2018-10-26 20:08:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:26,556 INFO L93 Difference]: Finished difference Result 2320 states and 3585 transitions. [2018-10-26 20:08:26,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:26,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2018-10-26 20:08:26,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:26,560 INFO L225 Difference]: With dead ends: 2320 [2018-10-26 20:08:26,560 INFO L226 Difference]: Without dead ends: 1206 [2018-10-26 20:08:26,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:26,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-26 20:08:26,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-10-26 20:08:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:26,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1795 transitions. [2018-10-26 20:08:26,636 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1795 transitions. Word has length 182 [2018-10-26 20:08:26,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:26,637 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1795 transitions. [2018-10-26 20:08:26,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:26,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1795 transitions. [2018-10-26 20:08:26,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 20:08:26,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:26,638 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] [2018-10-26 20:08:26,639 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:26,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 651147599, now seen corresponding path program 1 times [2018-10-26 20:08:26,639 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:26,640 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:26,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:27,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:27,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:27,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:27,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,627 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:27,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:27,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-10-26 20:08:27,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:27,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:27,672 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:27,673 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:27,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:27,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:27,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:27,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:27,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:27,678 INFO L87 Difference]: Start difference. First operand 1165 states and 1795 transitions. Second operand 4 states. [2018-10-26 20:08:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:30,298 INFO L93 Difference]: Finished difference Result 2320 states and 3581 transitions. [2018-10-26 20:08:30,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:30,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-26 20:08:30,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:30,304 INFO L225 Difference]: With dead ends: 2320 [2018-10-26 20:08:30,304 INFO L226 Difference]: Without dead ends: 1206 [2018-10-26 20:08:30,306 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-10-26 20:08:30,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-26 20:08:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-10-26 20:08:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:30,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1793 transitions. [2018-10-26 20:08:30,407 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1793 transitions. Word has length 183 [2018-10-26 20:08:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:30,407 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1793 transitions. [2018-10-26 20:08:30,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1793 transitions. [2018-10-26 20:08:30,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-26 20:08:30,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:30,409 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, 1] [2018-10-26 20:08:30,410 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:30,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:30,410 INFO L82 PathProgramCache]: Analyzing trace with hash 493617646, now seen corresponding path program 1 times [2018-10-26 20:08:30,411 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:30,411 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:30,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:31,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:31,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:31,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:31,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:31,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:31,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:31,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:31,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:08:31,593 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:31,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:31,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:31,598 INFO L87 Difference]: Start difference. First operand 1165 states and 1793 transitions. Second operand 4 states. [2018-10-26 20:08:34,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:34,277 INFO L93 Difference]: Finished difference Result 2387 states and 3665 transitions. [2018-10-26 20:08:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:34,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-10-26 20:08:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:34,281 INFO L225 Difference]: With dead ends: 2387 [2018-10-26 20:08:34,281 INFO L226 Difference]: Without dead ends: 1273 [2018-10-26 20:08:34,283 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-10-26 20:08:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1273 states. [2018-10-26 20:08:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1273 to 1165. [2018-10-26 20:08:34,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:34,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1791 transitions. [2018-10-26 20:08:34,356 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1791 transitions. Word has length 183 [2018-10-26 20:08:34,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:34,356 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1791 transitions. [2018-10-26 20:08:34,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:34,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1791 transitions. [2018-10-26 20:08:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:08:34,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:34,357 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] [2018-10-26 20:08:34,357 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:34,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1205390082, now seen corresponding path program 1 times [2018-10-26 20:08:34,358 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:34,358 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:34,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:35,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:35,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 13 treesize of output 10 [2018-10-26 20:08:35,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:35,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:35,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:35,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:35,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:35,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:35,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:35,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:35,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:35,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-10-26 20:08:35,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:35,397 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:35,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:35,402 INFO L87 Difference]: Start difference. First operand 1165 states and 1791 transitions. Second operand 4 states. [2018-10-26 20:08:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:37,908 INFO L93 Difference]: Finished difference Result 2320 states and 3573 transitions. [2018-10-26 20:08:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:37,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:08:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:37,912 INFO L225 Difference]: With dead ends: 2320 [2018-10-26 20:08:37,912 INFO L226 Difference]: Without dead ends: 1206 [2018-10-26 20:08:37,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-26 20:08:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1165. [2018-10-26 20:08:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:37,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1789 transitions. [2018-10-26 20:08:37,986 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1789 transitions. Word has length 184 [2018-10-26 20:08:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:37,986 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1789 transitions. [2018-10-26 20:08:37,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1789 transitions. [2018-10-26 20:08:37,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:08:37,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:37,988 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, 1] [2018-10-26 20:08:37,988 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:37,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 466277933, now seen corresponding path program 1 times [2018-10-26 20:08:37,989 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:37,989 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:38,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:38,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:38,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:38,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:38,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:38,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:38,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:38,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:38,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-10-26 20:08:39,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:39,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:39,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:39,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:39,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:39,022 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:39,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:39,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:39,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:39,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:39,027 INFO L87 Difference]: Start difference. First operand 1165 states and 1789 transitions. Second operand 4 states. [2018-10-26 20:08:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:41,685 INFO L93 Difference]: Finished difference Result 2367 states and 3633 transitions. [2018-10-26 20:08:41,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:41,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:08:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:41,688 INFO L225 Difference]: With dead ends: 2367 [2018-10-26 20:08:41,688 INFO L226 Difference]: Without dead ends: 1253 [2018-10-26 20:08:41,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-26 20:08:41,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1165. [2018-10-26 20:08:41,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1787 transitions. [2018-10-26 20:08:41,762 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1787 transitions. Word has length 184 [2018-10-26 20:08:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:41,762 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1787 transitions. [2018-10-26 20:08:41,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1787 transitions. [2018-10-26 20:08:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:08:41,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:41,763 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, 1] [2018-10-26 20:08:41,764 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:41,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2116475711, now seen corresponding path program 1 times [2018-10-26 20:08:41,765 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:41,765 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:41,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:42,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:42,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:42,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:42,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:42,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:42,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:42,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:42,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:42,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:42,892 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:42,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:42,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:42,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:42,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:42,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:42,906 INFO L87 Difference]: Start difference. First operand 1165 states and 1787 transitions. Second operand 4 states. [2018-10-26 20:08:45,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:45,632 INFO L93 Difference]: Finished difference Result 2367 states and 3629 transitions. [2018-10-26 20:08:45,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:45,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:08:45,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:45,636 INFO L225 Difference]: With dead ends: 2367 [2018-10-26 20:08:45,636 INFO L226 Difference]: Without dead ends: 1253 [2018-10-26 20:08:45,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2018-10-26 20:08:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1165. [2018-10-26 20:08:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1785 transitions. [2018-10-26 20:08:45,711 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1785 transitions. Word has length 184 [2018-10-26 20:08:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:45,711 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1785 transitions. [2018-10-26 20:08:45,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1785 transitions. [2018-10-26 20:08:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-26 20:08:45,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:45,713 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, 1] [2018-10-26 20:08:45,713 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:45,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:45,713 INFO L82 PathProgramCache]: Analyzing trace with hash 728932424, now seen corresponding path program 1 times [2018-10-26 20:08:45,716 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:45,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:46,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:46,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-10-26 20:08:46,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:46,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:46,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:46,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-10-26 20:08:46,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:46,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:08:46,806 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:46,810 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:46,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:46,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:46,811 INFO L87 Difference]: Start difference. First operand 1165 states and 1785 transitions. Second operand 4 states. [2018-10-26 20:08:49,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:49,559 INFO L93 Difference]: Finished difference Result 2363 states and 3621 transitions. [2018-10-26 20:08:49,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:49,562 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-10-26 20:08:49,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:49,563 INFO L225 Difference]: With dead ends: 2363 [2018-10-26 20:08:49,563 INFO L226 Difference]: Without dead ends: 1249 [2018-10-26 20:08:49,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:08:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2018-10-26 20:08:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1165. [2018-10-26 20:08:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-10-26 20:08:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1783 transitions. [2018-10-26 20:08:49,660 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1783 transitions. Word has length 184 [2018-10-26 20:08:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:49,661 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1783 transitions. [2018-10-26 20:08:49,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1783 transitions. [2018-10-26 20:08:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 20:08:49,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:49,662 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] [2018-10-26 20:08:49,663 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:49,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 814996212, now seen corresponding path program 1 times [2018-10-26 20:08:49,664 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:49,664 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:49,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:50,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:50,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:50,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:50,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:50,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:50,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-10-26 20:08:50,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:50,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:50,912 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:50,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:50,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:50,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:50,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:50,918 INFO L87 Difference]: Start difference. First operand 1165 states and 1783 transitions. Second operand 4 states. [2018-10-26 20:08:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:53,463 INFO L93 Difference]: Finished difference Result 2300 states and 3531 transitions. [2018-10-26 20:08:53,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:53,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-26 20:08:53,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:53,468 INFO L225 Difference]: With dead ends: 2300 [2018-10-26 20:08:53,468 INFO L226 Difference]: Without dead ends: 1186 [2018-10-26 20:08:53,469 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-10-26 20:08:53,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2018-10-26 20:08:53,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1133. [2018-10-26 20:08:53,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:08:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1739 transitions. [2018-10-26 20:08:53,559 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1739 transitions. Word has length 185 [2018-10-26 20:08:53,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:53,559 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1739 transitions. [2018-10-26 20:08:53,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1739 transitions. [2018-10-26 20:08:53,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-26 20:08:53,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:53,561 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, 1] [2018-10-26 20:08:53,561 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:53,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:53,562 INFO L82 PathProgramCache]: Analyzing trace with hash -545879033, now seen corresponding path program 1 times [2018-10-26 20:08:53,562 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:53,562 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:53,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:54,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:54,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:54,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:54,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:54,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:08:54,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:54,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:54,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:54,835 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:54,835 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:54,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:54,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:54,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:54,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:54,840 INFO L87 Difference]: Start difference. First operand 1133 states and 1739 transitions. Second operand 4 states. [2018-10-26 20:08:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:08:57,591 INFO L93 Difference]: Finished difference Result 2299 states and 3529 transitions. [2018-10-26 20:08:57,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:08:57,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-10-26 20:08:57,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:08:57,595 INFO L225 Difference]: With dead ends: 2299 [2018-10-26 20:08:57,596 INFO L226 Difference]: Without dead ends: 1217 [2018-10-26 20:08:57,597 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-10-26 20:08:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2018-10-26 20:08:57,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1133. [2018-10-26 20:08:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:08:57,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1737 transitions. [2018-10-26 20:08:57,673 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1737 transitions. Word has length 185 [2018-10-26 20:08:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:08:57,673 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1737 transitions. [2018-10-26 20:08:57,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:08:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1737 transitions. [2018-10-26 20:08:57,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-26 20:08:57,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:08:57,675 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, 1] [2018-10-26 20:08:57,675 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:08:57,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:08:57,675 INFO L82 PathProgramCache]: Analyzing trace with hash 341489990, now seen corresponding path program 1 times [2018-10-26 20:08:57,676 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:08:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:08:57,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:08:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:08:58,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:08:58,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:08:58,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:08:58,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:08:58,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 19 treesize of output 15 [2018-10-26 20:08:58,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:08:58,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:08:58,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:08:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:08:58,902 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:08:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:08:58,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:08:58,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:08:58,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:08:58,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:08:58,907 INFO L87 Difference]: Start difference. First operand 1133 states and 1737 transitions. Second operand 4 states. [2018-10-26 20:09:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:01,681 INFO L93 Difference]: Finished difference Result 2299 states and 3525 transitions. [2018-10-26 20:09:01,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:09:01,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-10-26 20:09:01,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:01,685 INFO L225 Difference]: With dead ends: 2299 [2018-10-26 20:09:01,685 INFO L226 Difference]: Without dead ends: 1217 [2018-10-26 20:09:01,687 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-10-26 20:09:01,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2018-10-26 20:09:01,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1133. [2018-10-26 20:09:01,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:09:01,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1735 transitions. [2018-10-26 20:09:01,767 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1735 transitions. Word has length 186 [2018-10-26 20:09:01,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:01,767 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1735 transitions. [2018-10-26 20:09:01,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:09:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1735 transitions. [2018-10-26 20:09:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:09:01,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:01,769 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, 1] [2018-10-26 20:09:01,769 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:01,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638188, now seen corresponding path program 1 times [2018-10-26 20:09:01,770 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:01,770 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:02,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:02,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:09:02,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:09:02,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:09:02,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:09:02,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:09:02,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:02,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:09:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:09:02,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:02,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:09:02,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:09:02,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:09:02,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:09:02,995 INFO L87 Difference]: Start difference. First operand 1133 states and 1735 transitions. Second operand 4 states. [2018-10-26 20:09:05,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:05,841 INFO L93 Difference]: Finished difference Result 2279 states and 3495 transitions. [2018-10-26 20:09:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:09:05,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-26 20:09:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:05,844 INFO L225 Difference]: With dead ends: 2279 [2018-10-26 20:09:05,844 INFO L226 Difference]: Without dead ends: 1197 [2018-10-26 20:09:05,845 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-10-26 20:09:05,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-10-26 20:09:05,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1133. [2018-10-26 20:09:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:09:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1733 transitions. [2018-10-26 20:09:05,922 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1733 transitions. Word has length 187 [2018-10-26 20:09:05,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:05,923 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1733 transitions. [2018-10-26 20:09:05,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:09:05,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1733 transitions. [2018-10-26 20:09:05,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-26 20:09:05,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:05,924 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, 1] [2018-10-26 20:09:05,924 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:05,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1642850165, now seen corresponding path program 1 times [2018-10-26 20:09:05,925 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:05,926 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:05,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:07,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:07,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:09:07,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:09:07,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:09:07,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-10-26 20:09:07,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 15 treesize of output 3 [2018-10-26 20:09:07,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:07,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:09:07,102 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:07,102 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:09:07,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:09:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:09:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:09:07,107 INFO L87 Difference]: Start difference. First operand 1133 states and 1733 transitions. Second operand 4 states. [2018-10-26 20:09:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:09,820 INFO L93 Difference]: Finished difference Result 2279 states and 3491 transitions. [2018-10-26 20:09:09,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:09:09,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-10-26 20:09:09,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:09,824 INFO L225 Difference]: With dead ends: 2279 [2018-10-26 20:09:09,824 INFO L226 Difference]: Without dead ends: 1197 [2018-10-26 20:09:09,825 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-10-26 20:09:09,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2018-10-26 20:09:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1133. [2018-10-26 20:09:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:09:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1731 transitions. [2018-10-26 20:09:09,907 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1731 transitions. Word has length 187 [2018-10-26 20:09:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:09,908 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1731 transitions. [2018-10-26 20:09:09,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:09:09,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1731 transitions. [2018-10-26 20:09:09,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-26 20:09:09,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:09,909 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, 1] [2018-10-26 20:09:09,910 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:09,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:09,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1575772539, now seen corresponding path program 1 times [2018-10-26 20:09:09,910 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:09,911 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:09,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:11,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09: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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:09:11,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:09:11,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-10-26 20:09:11,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:09:11,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:09:11,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:11,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-10-26 20:09:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:11,082 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:11,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:11,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-26 20:09:11,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-26 20:09:11,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-26 20:09:11,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-26 20:09:11,087 INFO L87 Difference]: Start difference. First operand 1133 states and 1731 transitions. Second operand 4 states. [2018-10-26 20:09:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:13,700 INFO L93 Difference]: Finished difference Result 2263 states and 3461 transitions. [2018-10-26 20:09:13,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-26 20:09:13,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-26 20:09:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:13,704 INFO L225 Difference]: With dead ends: 2263 [2018-10-26 20:09:13,704 INFO L226 Difference]: Without dead ends: 1181 [2018-10-26 20:09:13,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-26 20:09:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2018-10-26 20:09:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1133. [2018-10-26 20:09:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:09:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1729 transitions. [2018-10-26 20:09:13,799 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1729 transitions. Word has length 188 [2018-10-26 20:09:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:13,800 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1729 transitions. [2018-10-26 20:09:13,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-26 20:09:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1729 transitions. [2018-10-26 20:09:13,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-26 20:09:13,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:13,801 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, 1, 1] [2018-10-26 20:09:13,801 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:13,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:13,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1410391419, now seen corresponding path program 1 times [2018-10-26 20:09:13,809 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:13,809 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:13,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:16,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:16,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:09:16,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:09:16,253 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:16,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:16,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,266 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,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-10-26 20:09:16,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:09:16,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 17 treesize of output 13 [2018-10-26 20:09:16,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 13 treesize of output 5 [2018-10-26 20:09:16,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:09:16,337 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 230 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:16,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:09:16,360 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:09:16,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:16,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:09:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:09:16,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:09:16,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:09:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:09:16,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:09:16,387 INFO L87 Difference]: Start difference. First operand 1133 states and 1729 transitions. Second operand 9 states. [2018-10-26 20:09:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:20,236 INFO L93 Difference]: Finished difference Result 2619 states and 3964 transitions. [2018-10-26 20:09:20,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:09:20,239 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2018-10-26 20:09:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:20,240 INFO L225 Difference]: With dead ends: 2619 [2018-10-26 20:09:20,241 INFO L226 Difference]: Without dead ends: 1537 [2018-10-26 20:09:20,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 377 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-10-26 20:09:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2018-10-26 20:09:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1133. [2018-10-26 20:09:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2018-10-26 20:09:20,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1721 transitions. [2018-10-26 20:09:20,326 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1721 transitions. Word has length 191 [2018-10-26 20:09:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:20,327 INFO L481 AbstractCegarLoop]: Abstraction has 1133 states and 1721 transitions. [2018-10-26 20:09:20,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:09:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1721 transitions. [2018-10-26 20:09:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:09:20,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:20,328 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, 1, 1] [2018-10-26 20:09:20,328 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:20,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:20,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1178506176, now seen corresponding path program 1 times [2018-10-26 20:09:20,329 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:20,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:22,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:22,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 18 treesize of output 15 [2018-10-26 20:09:22,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:09:22,867 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:22,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:22,871 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,883 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,898 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:09:22,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:09:22,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:09:22,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:22,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:09:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-10-26 20:09:22,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:22,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:22,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:09:22,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:09:22,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:09:22,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:09:22,974 INFO L87 Difference]: Start difference. First operand 1133 states and 1721 transitions. Second operand 7 states. [2018-10-26 20:09:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:24,113 INFO L93 Difference]: Finished difference Result 2411 states and 3669 transitions. [2018-10-26 20:09:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:09:24,114 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2018-10-26 20:09:24,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:24,116 INFO L225 Difference]: With dead ends: 2411 [2018-10-26 20:09:24,116 INFO L226 Difference]: Without dead ends: 1329 [2018-10-26 20:09:24,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:09:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2018-10-26 20:09:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1157. [2018-10-26 20:09:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-10-26 20:09:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1755 transitions. [2018-10-26 20:09:24,205 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1755 transitions. Word has length 192 [2018-10-26 20:09:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:24,205 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1755 transitions. [2018-10-26 20:09:24,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:09:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1755 transitions. [2018-10-26 20:09:24,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:09:24,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:24,206 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, 1, 1] [2018-10-26 20:09:24,206 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:24,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:24,207 INFO L82 PathProgramCache]: Analyzing trace with hash 533707476, now seen corresponding path program 1 times [2018-10-26 20:09:24,208 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:24,208 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:24,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:26,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:26,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:09:26,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:09:26,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:09:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:26,759 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:26,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:26,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:26,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:26,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:26,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:26,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:26,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 20:09:26,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 11 treesize of output 3 [2018-10-26 20:09:26,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:26,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-10-26 20:09:26,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-10-26 20:09:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-10-26 20:09:26,867 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:26,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:26,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:09:26,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:09:26,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:09:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:09:26,873 INFO L87 Difference]: Start difference. First operand 1157 states and 1755 transitions. Second operand 8 states. [2018-10-26 20:09:27,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:27,913 INFO L93 Difference]: Finished difference Result 2283 states and 3473 transitions. [2018-10-26 20:09:27,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:09:27,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2018-10-26 20:09:27,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:27,916 INFO L225 Difference]: With dead ends: 2283 [2018-10-26 20:09:27,916 INFO L226 Difference]: Without dead ends: 1177 [2018-10-26 20:09:27,917 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-10-26 20:09:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-10-26 20:09:28,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2018-10-26 20:09:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-10-26 20:09:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1777 transitions. [2018-10-26 20:09:28,003 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1777 transitions. Word has length 192 [2018-10-26 20:09:28,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:28,004 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1777 transitions. [2018-10-26 20:09:28,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:09:28,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1777 transitions. [2018-10-26 20:09:28,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-26 20:09:28,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:28,005 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, 1, 1] [2018-10-26 20:09:28,005 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:28,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash -915851685, now seen corresponding path program 1 times [2018-10-26 20:09:28,006 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:28,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:30,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:30,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:09:30,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:09:30,407 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:30,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:30,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,435 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:09:30,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:09:30,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:09:30,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:09:30,505 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 233 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:30,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:09:30,532 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:09:30,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:30,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-10-26 20:09:30,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:09:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:30,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:09:30,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:09:30,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:09:30,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:09:30,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:09:30,559 INFO L87 Difference]: Start difference. First operand 1175 states and 1777 transitions. Second operand 9 states. [2018-10-26 20:09:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:34,396 INFO L93 Difference]: Finished difference Result 2691 states and 4038 transitions. [2018-10-26 20:09:34,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:09:34,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 192 [2018-10-26 20:09:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:34,400 INFO L225 Difference]: With dead ends: 2691 [2018-10-26 20:09:34,400 INFO L226 Difference]: Without dead ends: 1567 [2018-10-26 20:09:34,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 379 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-10-26 20:09:34,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2018-10-26 20:09:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1175. [2018-10-26 20:09:34,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-10-26 20:09:34,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-10-26 20:09:34,493 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 192 [2018-10-26 20:09:34,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:34,494 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-10-26 20:09:34,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:09:34,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-10-26 20:09:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-26 20:09:34,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:34,495 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, 1, 1] [2018-10-26 20:09:34,495 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:34,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 5421140, now seen corresponding path program 1 times [2018-10-26 20:09:34,497 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:34,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:37,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:37,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:09:37,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:09:37,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:09:37,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:37,166 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:37,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:37,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,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-10-26 20:09:37,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:37,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:37,197 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:37,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:37,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:37,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-10-26 20:09:37,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:09:37,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:37,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-10-26 20:09:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-10-26 20:09:37,363 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:37,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:37,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:09:37,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:09:37,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:09:37,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:09:37,369 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-10-26 20:09:42,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:42,376 INFO L93 Difference]: Finished difference Result 2319 states and 3501 transitions. [2018-10-26 20:09:42,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:09:42,378 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2018-10-26 20:09:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:42,380 INFO L225 Difference]: With dead ends: 2319 [2018-10-26 20:09:42,380 INFO L226 Difference]: Without dead ends: 1195 [2018-10-26 20:09:42,381 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-10-26 20:09:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-10-26 20:09:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1175. [2018-10-26 20:09:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-10-26 20:09:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-10-26 20:09:42,500 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 193 [2018-10-26 20:09:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:42,500 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-10-26 20:09:42,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:09:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-10-26 20:09:42,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-26 20:09:42,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:42,506 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, 1, 1] [2018-10-26 20:09:42,506 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:42,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:42,506 INFO L82 PathProgramCache]: Analyzing trace with hash 251926169, now seen corresponding path program 1 times [2018-10-26 20:09:42,507 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:42,507 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:42,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:44,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:44,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 11 treesize of output 8 [2018-10-26 20:09:44,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:09:44,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:09:44,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:44,845 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:44,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:44,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:44,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 23 treesize of output 18 [2018-10-26 20:09:44,882 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:44,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:44,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:44,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 20:09:44,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-26 20:09:44,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:44,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2018-10-26 20:09:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-10-26 20:09:44,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:44,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:09:44,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:09:44,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:09:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:09:44,945 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-10-26 20:09:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:45,896 INFO L93 Difference]: Finished difference Result 2319 states and 3501 transitions. [2018-10-26 20:09:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:09:45,899 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 194 [2018-10-26 20:09:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:45,900 INFO L225 Difference]: With dead ends: 2319 [2018-10-26 20:09:45,900 INFO L226 Difference]: Without dead ends: 1195 [2018-10-26 20:09:45,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:09:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-10-26 20:09:45,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1175. [2018-10-26 20:09:45,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2018-10-26 20:09:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1769 transitions. [2018-10-26 20:09:45,991 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1769 transitions. Word has length 194 [2018-10-26 20:09:45,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:45,992 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1769 transitions. [2018-10-26 20:09:45,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:09:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1769 transitions. [2018-10-26 20:09:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:09:45,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:45,993 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, 1, 1] [2018-10-26 20:09:45,993 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:45,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1252840263, now seen corresponding path program 1 times [2018-10-26 20:09:45,994 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:45,994 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:46,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:48,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:48,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-26 20:09:48,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-26 20:09:48,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-10-26 20:09:48,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:48,531 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:48,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:48,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:48,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:09:48,571 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:48,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-10-26 20:09:48,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:09:48,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-10-26 20:09:48,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:09:48,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:48,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-10-26 20:09:48,643 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-10-26 20:09:48,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:09:48,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:09:48,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-26 20:09:48,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-26 20:09:48,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-26 20:09:48,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-26 20:09:48,650 INFO L87 Difference]: Start difference. First operand 1175 states and 1769 transitions. Second operand 8 states. [2018-10-26 20:09:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:51,890 INFO L93 Difference]: Finished difference Result 2301 states and 3477 transitions. [2018-10-26 20:09:51,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-26 20:09:51,894 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2018-10-26 20:09:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:51,895 INFO L225 Difference]: With dead ends: 2301 [2018-10-26 20:09:51,896 INFO L226 Difference]: Without dead ends: 1177 [2018-10-26 20:09:51,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-26 20:09:51,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2018-10-26 20:09:51,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1157. [2018-10-26 20:09:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1157 states. [2018-10-26 20:09:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1745 transitions. [2018-10-26 20:09:51,987 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1745 transitions. Word has length 195 [2018-10-26 20:09:51,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:51,987 INFO L481 AbstractCegarLoop]: Abstraction has 1157 states and 1745 transitions. [2018-10-26 20:09:51,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-26 20:09:51,987 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1745 transitions. [2018-10-26 20:09:51,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:09:51,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:51,989 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, 1, 1] [2018-10-26 20:09:51,989 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:51,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:51,989 INFO L82 PathProgramCache]: Analyzing trace with hash -124361320, now seen corresponding path program 1 times [2018-10-26 20:09:51,990 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:51,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:52,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:54,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:09:54,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:09:54,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:09:54,250 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:09:54,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:09:54,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,306 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:09:54,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:09:54,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:09:54,323 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:09:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 224 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:54,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:09:54,395 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:09:54,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:09:54,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-10-26 20:09:54,445 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:09:54,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:09:54,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:09:54,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:09:54,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:09:54,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:09:54,452 INFO L87 Difference]: Start difference. First operand 1157 states and 1745 transitions. Second operand 9 states. [2018-10-26 20:09:57,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:09:57,923 INFO L93 Difference]: Finished difference Result 2701 states and 4058 transitions. [2018-10-26 20:09:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:09:57,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-10-26 20:09:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:09:57,928 INFO L225 Difference]: With dead ends: 2701 [2018-10-26 20:09:57,928 INFO L226 Difference]: Without dead ends: 1595 [2018-10-26 20:09:57,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-10-26 20:09:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-10-26 20:09:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1215. [2018-10-26 20:09:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:09:58,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1835 transitions. [2018-10-26 20:09:58,016 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1835 transitions. Word has length 195 [2018-10-26 20:09:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:09:58,016 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1835 transitions. [2018-10-26 20:09:58,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:09:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1835 transitions. [2018-10-26 20:09:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-26 20:09:58,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:09:58,018 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, 1] [2018-10-26 20:09:58,018 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:09:58,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:09:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash 114462316, now seen corresponding path program 1 times [2018-10-26 20:09:58,019 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:09:58,019 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:09:58,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:09:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:09:59,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:00,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:10:00,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:10:00,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,041 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:10:00,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:10:00,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:00,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:00,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:10:00,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:00,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:00,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:00,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 20:10:00,130 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:10:00,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:10:00,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:10:00,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:10:00,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:10:00,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:10:00,137 INFO L87 Difference]: Start difference. First operand 1215 states and 1835 transitions. Second operand 7 states. [2018-10-26 20:10:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:01,066 INFO L93 Difference]: Finished difference Result 2427 states and 3668 transitions. [2018-10-26 20:10:01,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:10:01,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-10-26 20:10:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:01,070 INFO L225 Difference]: With dead ends: 2427 [2018-10-26 20:10:01,070 INFO L226 Difference]: Without dead ends: 1263 [2018-10-26 20:10:01,071 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-10-26 20:10:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2018-10-26 20:10:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1215. [2018-10-26 20:10:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1833 transitions. [2018-10-26 20:10:01,170 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1833 transitions. Word has length 195 [2018-10-26 20:10:01,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:01,171 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1833 transitions. [2018-10-26 20:10:01,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:10:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1833 transitions. [2018-10-26 20:10:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 20:10:01,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:01,172 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, 1] [2018-10-26 20:10:01,172 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:01,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:01,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1289564213, now seen corresponding path program 1 times [2018-10-26 20:10:01,173 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:01,173 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:10:01,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:03,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:03,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:10:03,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:10:03,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,244 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-10-26 20:10:03,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-10-26 20:10:03,263 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:03,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:03,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-10-26 20:10:03,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:03,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:03,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:03,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-26 20:10:03,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:10:03,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:10:03,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:10:03,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:10:03,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:10:03,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:10:03,329 INFO L87 Difference]: Start difference. First operand 1215 states and 1833 transitions. Second operand 7 states. [2018-10-26 20:10:06,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:06,280 INFO L93 Difference]: Finished difference Result 2415 states and 3648 transitions. [2018-10-26 20:10:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:10:06,283 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-10-26 20:10:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:06,284 INFO L225 Difference]: With dead ends: 2415 [2018-10-26 20:10:06,284 INFO L226 Difference]: Without dead ends: 1251 [2018-10-26 20:10:06,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 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-10-26 20:10:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2018-10-26 20:10:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1215. [2018-10-26 20:10:06,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1831 transitions. [2018-10-26 20:10:06,391 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1831 transitions. Word has length 196 [2018-10-26 20:10:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:06,391 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1831 transitions. [2018-10-26 20:10:06,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:10:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1831 transitions. [2018-10-26 20:10:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-26 20:10:06,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:06,393 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, 1, 1] [2018-10-26 20:10:06,393 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:06,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1747258600, now seen corresponding path program 1 times [2018-10-26 20:10:06,394 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:06,394 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:10:06,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:09,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:09,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:10:09,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:10:09,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:09,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:09,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,107 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,123 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:10:09,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:09,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:09,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 227 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:10:09,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:10:09,210 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:10:09,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:09,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-10-26 20:10:09,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:10:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-10-26 20:10:09,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:10:09,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:10:09,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:10:09,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:10:09,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:10:09,241 INFO L87 Difference]: Start difference. First operand 1215 states and 1831 transitions. Second operand 9 states. [2018-10-26 20:10:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:13,160 INFO L93 Difference]: Finished difference Result 2719 states and 4068 transitions. [2018-10-26 20:10:13,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:10:13,163 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 196 [2018-10-26 20:10:13,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:13,165 INFO L225 Difference]: With dead ends: 2719 [2018-10-26 20:10:13,165 INFO L226 Difference]: Without dead ends: 1555 [2018-10-26 20:10:13,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 387 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-10-26 20:10:13,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-10-26 20:10:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1215. [2018-10-26 20:10:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:13,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1821 transitions. [2018-10-26 20:10:13,267 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1821 transitions. Word has length 196 [2018-10-26 20:10:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:13,267 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1821 transitions. [2018-10-26 20:10:13,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:10:13,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1821 transitions. [2018-10-26 20:10:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-26 20:10:13,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:13,269 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, 1] [2018-10-26 20:10:13,269 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:13,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:13,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1978896832, now seen corresponding path program 1 times [2018-10-26 20:10:13,270 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:13,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:10:13,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:16,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:16,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:10:16,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:10:16,550 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:16,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:16,554 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,565 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,582 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:10:16,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-26 20:10:16,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-10-26 20:10:16,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:16,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-10-26 20:10:16,651 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-10-26 20:10:16,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-10-26 20:10:16,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:10:16,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-26 20:10:16,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-26 20:10:16,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-26 20:10:16,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-26 20:10:16,658 INFO L87 Difference]: Start difference. First operand 1215 states and 1821 transitions. Second operand 7 states. [2018-10-26 20:10:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:20,041 INFO L93 Difference]: Finished difference Result 2513 states and 3759 transitions. [2018-10-26 20:10:20,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-26 20:10:20,043 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2018-10-26 20:10:20,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:20,045 INFO L225 Difference]: With dead ends: 2513 [2018-10-26 20:10:20,045 INFO L226 Difference]: Without dead ends: 1349 [2018-10-26 20:10:20,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-10-26 20:10:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2018-10-26 20:10:20,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1215. [2018-10-26 20:10:20,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:20,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1819 transitions. [2018-10-26 20:10:20,157 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1819 transitions. Word has length 201 [2018-10-26 20:10:20,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:20,158 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1819 transitions. [2018-10-26 20:10:20,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-26 20:10:20,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1819 transitions. [2018-10-26 20:10:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-26 20:10:20,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:20,159 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, 1, 1] [2018-10-26 20:10:20,160 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -600736135, now seen corresponding path program 1 times [2018-10-26 20:10:20,161 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:20,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:10:20,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:22,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:22,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:10:22,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:10:22,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:22,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:22,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:10:22,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-10-26 20:10:22,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 13 treesize of output 5 [2018-10-26 20:10:22,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:10:22,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:10:22,873 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:10:22,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:22,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:10:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:10:22,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:10:22,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:10:22,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:10:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:10:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:10:22,905 INFO L87 Difference]: Start difference. First operand 1215 states and 1819 transitions. Second operand 9 states. [2018-10-26 20:10:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:26,530 INFO L93 Difference]: Finished difference Result 2719 states and 4042 transitions. [2018-10-26 20:10:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:10:26,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2018-10-26 20:10:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:26,536 INFO L225 Difference]: With dead ends: 2719 [2018-10-26 20:10:26,536 INFO L226 Difference]: Without dead ends: 1555 [2018-10-26 20:10:26,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 401 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-10-26 20:10:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2018-10-26 20:10:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1215. [2018-10-26 20:10:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1813 transitions. [2018-10-26 20:10:26,636 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1813 transitions. Word has length 203 [2018-10-26 20:10:26,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:26,636 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1813 transitions. [2018-10-26 20:10:26,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:10:26,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1813 transitions. [2018-10-26 20:10:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:10:26,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:26,637 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, 1, 1] [2018-10-26 20:10:26,638 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:26,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:26,638 INFO L82 PathProgramCache]: Analyzing trace with hash -717622946, now seen corresponding path program 1 times [2018-10-26 20:10:26,639 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:26,639 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/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-10-26 20:10:26,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:29,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:29,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-10-26 20:10:29,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-10-26 20:10:29,079 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:29,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-26 20:10:29,083 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-10-26 20:10:29,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:29,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:29,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:29,174 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:10:29,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:10:29,200 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-26 20:10:29,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:29,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-10-26 20:10:29,239 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-10-26 20:10:29,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-26 20:10:29,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-10-26 20:10:29,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-26 20:10:29,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-26 20:10:29,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-26 20:10:29,246 INFO L87 Difference]: Start difference. First operand 1215 states and 1813 transitions. Second operand 9 states. [2018-10-26 20:10:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:10:32,924 INFO L93 Difference]: Finished difference Result 2713 states and 4021 transitions. [2018-10-26 20:10:32,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-26 20:10:32,927 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 204 [2018-10-26 20:10:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:10:32,929 INFO L225 Difference]: With dead ends: 2713 [2018-10-26 20:10:32,929 INFO L226 Difference]: Without dead ends: 1549 [2018-10-26 20:10:32,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 403 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-10-26 20:10:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2018-10-26 20:10:33,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 1215. [2018-10-26 20:10:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2018-10-26 20:10:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1807 transitions. [2018-10-26 20:10:33,041 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1807 transitions. Word has length 204 [2018-10-26 20:10:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:10:33,041 INFO L481 AbstractCegarLoop]: Abstraction has 1215 states and 1807 transitions. [2018-10-26 20:10:33,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-26 20:10:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1807 transitions. [2018-10-26 20:10:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-26 20:10:33,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:10:33,042 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-10-26 20:10:33,043 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:10:33,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:10:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1096033176, now seen corresponding path program 1 times [2018-10-26 20:10:33,044 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:10:33,044 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 124 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 124 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:10:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:38,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:38,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:10:38,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:38,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:10:38,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-10-26 20:10:38,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,006 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:10:39,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:10:39,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:10:39,060 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:10:39,075 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,092 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,113 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,137 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-10-26 20:10:39,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:10:39,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:10:39,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,225 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-10-26 20:10:39,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:10:39,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,271 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,284 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-10-26 20:10:39,341 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-10-26 20:10:39,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:10:39,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:39,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:39,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:39,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:39,529 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-10-26 20:10:39,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-26 20:10:39,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-10-26 20:10:39,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:10:39,662 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-10-26 20:10:39,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-10-26 20:10:39,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-10-26 20:10:39,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, 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-10-26 20:10:39,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-10-26 20:10:39,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:39,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:39,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:10:39,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:10:39,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:10:39,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:10:39,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:39,949 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:39,958 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-10-26 20:10:40,021 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:40,088 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-10-26 20:10:40,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 20:10:40,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-10-26 20:10:40,125 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:40,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:40,129 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-10-26 20:10:40,129 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,136 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,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 37 treesize of output 29 [2018-10-26 20:10:40,142 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-10-26 20:10:40,142 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,146 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,156 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,176 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-10-26 20:10:40,305 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:10:40,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:10:40,313 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:10:40,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:10:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:10:40,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:10:40,844 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-26 20:10:40,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:10:40,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:10:40,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:10:40,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:40,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:10:40,934 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:40,937 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:40,942 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:40,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:10:40,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:40,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,026 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:10:41,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:10:41,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:10:41,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,094 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:10:41,108 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,123 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,133 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,144 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,173 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-10-26 20:10:41,173 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-10-26 20:10:41,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:10:41,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:10:41,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,397 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,416 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-10-26 20:10:41,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:10:41,420 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,438 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-10-26 20:10:41,504 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-10-26 20:10:41,504 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:10:41,527 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:41,546 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:41,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:41,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:10:41,600 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-10-26 20:10:41,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 20:10:41,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 20:10:41,698 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:10:41,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:41,722 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-10-26 20:10:41,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,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 41 treesize of output 35 [2018-10-26 20:10:41,745 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:41,746 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-10-26 20:10:41,746 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:10:41,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-26 20:10:41,765 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-10-26 20:10:41,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 17 treesize of output 9 [2018-10-26 20:10:41,767 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,773 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,780 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-10-26 20:10:41,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:10:41,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:10:41,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,793 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:10:41,911 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:10:41,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:10:41,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:10:41,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:10:41,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:41,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:10:41,963 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-10-26 20:10:42,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:42,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 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-10-26 20:10:42,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 20:10:42,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-26 20:10:42,177 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-10-26 20:10:42,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,182 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:10:42,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:42,191 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:10:42,192 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-10-26 20:10:42,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,209 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:10:42,229 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-10-26 20:10:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:10:42,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:10:42,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-10-26 20:10:42,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 20:10:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 20:10:42,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:10:42,321 INFO L87 Difference]: Start difference. First operand 1215 states and 1807 transitions. Second operand 19 states. [2018-10-26 20:11:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:11:15,573 INFO L93 Difference]: Finished difference Result 7439 states and 10992 transitions. [2018-10-26 20:11:15,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-26 20:11:15,575 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 204 [2018-10-26 20:11:15,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:11:15,581 INFO L225 Difference]: With dead ends: 7439 [2018-10-26 20:11:15,581 INFO L226 Difference]: Without dead ends: 6275 [2018-10-26 20:11:15,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 797 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-10-26 20:11:15,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2018-10-26 20:11:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 1369. [2018-10-26 20:11:15,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1369 states. [2018-10-26 20:11:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2071 transitions. [2018-10-26 20:11:15,704 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2071 transitions. Word has length 204 [2018-10-26 20:11:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:11:15,704 INFO L481 AbstractCegarLoop]: Abstraction has 1369 states and 2071 transitions. [2018-10-26 20:11:15,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 20:11:15,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2071 transitions. [2018-10-26 20:11:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-26 20:11:15,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:11:15,706 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, 1] [2018-10-26 20:11:15,706 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:11:15,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:11:15,707 INFO L82 PathProgramCache]: Analyzing trace with hash -622982657, now seen corresponding path program 1 times [2018-10-26 20:11:15,707 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:11:15,707 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 126 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 126 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:11:15,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:11:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:11:21,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:11:21,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:11:21,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-10-26 20:11:21,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:11:21,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:11:21,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:11:21,915 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:21,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:11:21,923 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:21,926 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:21,928 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:21,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:11:21,936 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,951 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,961 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:21,993 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-10-26 20:11:22,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:11:22,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:11:22,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,076 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:22,097 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-10-26 20:11:22,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:11:22,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,121 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:22,133 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-10-26 20:11:22,181 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-10-26 20:11:22,181 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:11:22,208 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:22,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:22,260 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:22,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:22,307 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-10-26 20:11:22,479 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 23 [2018-10-26 20:11:22,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-10-26 20:11:22,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 28 treesize of output 27 [2018-10-26 20:11:22,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:22,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 33 treesize of output 9 [2018-10-26 20:11:22,520 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-10-26 20:11:22,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:22,570 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-10-26 20:11:22,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,580 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,581 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-10-26 20:11:22,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:11:22,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:11:22,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:11:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:11:22,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:11:22,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:11:22,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:11:22,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:22,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:22,839 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-10-26 20:11:22,926 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:22,987 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-10-26 20:11:22,987 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 20:11:23,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:23,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:23,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:23,036 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-10-26 20:11:23,036 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:23,050 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-10-26 20:11:23,050 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,056 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,091 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-10-26 20:11:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:11:23,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-26 20:11:23,243 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/z3 Starting monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-26 20:11:23,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:11:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:11:23,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-26 20:11:23,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-10-26 20:11:23,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:11:23,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-10-26 20:11:23,729 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:11:23,761 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,766 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,768 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:11:23,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,823 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-10-26 20:11:23,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:11:23,940 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-10-26 20:11:23,951 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,954 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,957 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:23,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-10-26 20:11:23,967 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:23,988 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,000 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,013 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,047 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-10-26 20:11:24,047 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-10-26 20:11:24,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:11:24,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-10-26 20:11:24,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,204 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:24,224 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-10-26 20:11:24,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-10-26 20:11:24,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,245 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:24,255 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-10-26 20:11:24,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, 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-10-26 20:11:24,335 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,355 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,429 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-10-26 20:11:24,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-26 20:11:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10-26 20:11:24,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:24,547 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-10-26 20:11:24,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:24,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:24,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10-26 20:11:24,574 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,584 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-10-26 20:11:24,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-26 20:11:24,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-26 20:11:24,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-10-26 20:11:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:11:24,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-26 20:11:24,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10-26 20:11:24,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-10-26 20:11:24,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,802 INFO L700 Elim1Store]: detected not equals via solver [2018-10-26 20:11:24,811 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-10-26 20:11:24,884 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:24,939 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-10-26 20:11:24,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-26 20:11:24,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-10-26 20:11:24,984 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:24,986 INFO L682 Elim1Store]: detected equality via solver [2018-10-26 20:11:24,987 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-10-26 20:11:24,987 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:24,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 37 treesize of output 29 [2018-10-26 20:11:25,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 14 treesize of output 1 [2018-10-26 20:11:25,002 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-26 20:11:25,006 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:25,019 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:25,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:25,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-26 20:11:25,040 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-10-26 20:11:25,129 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-10-26 20:11:25,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-10-26 20:11:25,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-10-26 20:11:25,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-26 20:11:25,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-26 20:11:25,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-10-26 20:11:25,151 INFO L87 Difference]: Start difference. First operand 1369 states and 2071 transitions. Second operand 19 states. [2018-10-26 20:11:41,941 WARN L179 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-10-26 20:11:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:11:43,771 INFO L93 Difference]: Finished difference Result 7037 states and 10522 transitions. [2018-10-26 20:11:43,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-26 20:11:43,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2018-10-26 20:11:43,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:11:43,781 INFO L225 Difference]: With dead ends: 7037 [2018-10-26 20:11:43,781 INFO L226 Difference]: Without dead ends: 5719 [2018-10-26 20:11:43,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 829 GetRequests, 799 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-10-26 20:11:43,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5719 states. [2018-10-26 20:11:43,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 1363. [2018-10-26 20:11:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1363 states. [2018-10-26 20:11:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 2061 transitions. [2018-10-26 20:11:43,935 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 2061 transitions. Word has length 205 [2018-10-26 20:11:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:11:43,935 INFO L481 AbstractCegarLoop]: Abstraction has 1363 states and 2061 transitions. [2018-10-26 20:11:43,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-26 20:11:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 2061 transitions. [2018-10-26 20:11:43,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-26 20:11:43,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:11:43,937 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, 1, 1, 1] [2018-10-26 20:11:43,937 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:11:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:11:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2143906995, now seen corresponding path program 1 times [2018-10-26 20:11:43,939 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-10-26 20:11:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/cvc4nyu Starting monitored process 128 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 128 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-10-26 20:11:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:11:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:11:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-26 20:11:56,475 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-26 20:11:56,506 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,507 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,512 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,513 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:11:56 BoogieIcfgContainer [2018-10-26 20:11:56,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:11:56,621 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:11:56,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:11:56,621 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:11:56,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:02:22" (3/4) ... [2018-10-26 20:11:56,624 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-10-26 20:11:56,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,641 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,642 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,649 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,649 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-10-26 20:11:56,762 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_132ad91e-74b1-40db-a1cb-70b18c6d2484/bin-2019/utaipan/witness.graphml [2018-10-26 20:11:56,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:11:56,768 INFO L168 Benchmark]: Toolchain (without parser) took 580088.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 947.8 MB in the beginning and 927.0 MB in the end (delta: 20.9 MB). Peak memory consumption was 182.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,768 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:11:56,768 INFO L168 Benchmark]: CACSL2BoogieTranslator took 859.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 780.1 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 206.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 780.1 MB in the beginning and 1.2 GB in the end (delta: -383.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,769 INFO L168 Benchmark]: Boogie Preprocessor took 127.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,769 INFO L168 Benchmark]: RCFGBuilder took 4252.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 986.7 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,769 INFO L168 Benchmark]: TraceAbstraction took 574493.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -15.7 MB). Free memory was 986.7 MB in the beginning and 946.3 MB in the end (delta: 40.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,769 INFO L168 Benchmark]: Witness Printer took 141.20 ms. Allocated memory is still 1.2 GB. Free memory was 946.3 MB in the beginning and 927.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-10-26 20:11:56,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 859.34 ms. Allocated memory is still 1.0 GB. Free memory was 947.8 MB in the beginning and 780.1 MB in the end (delta: 167.8 MB). Peak memory consumption was 167.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 206.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 177.2 MB). Free memory was 780.1 MB in the beginning and 1.2 GB in the end (delta: -383.2 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 127.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4252.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 986.7 MB in the end (delta: 170.5 MB). Peak memory consumption was 170.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 574493.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -15.7 MB). Free memory was 986.7 MB in the beginning and 946.3 MB in the end (delta: 40.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Witness Printer took 141.20 ms. Allocated memory is still 1.2 GB. Free memory was 946.3 MB in the beginning and 927.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 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: 1750]: 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={1471789951: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={1471789951: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={1471789951: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={1471789951: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951: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={1471789951: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951: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 [L1594] CALL, EXPR s->session [L1594] RET, EXPR s->session [L1594] CALL, EXPR s->s3 [L1594] RET, EXPR s->s3 [L1594] CALL, EXPR (s->s3)->tmp.new_cipher [L1594] RET, EXPR (s->s3)->tmp.new_cipher [L1594] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1594] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1611] COND FALSE !(ret <= 0) [L1616] CALL s->state = 8672 [L1616] RET s->state = 8672 [L1617] CALL s->init_num = 0 [L1617] RET s->init_num = 0 [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951: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 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1637] COND FALSE !(ret <= 0) [L1642] CALL s->state = 8448 [L1642] RET s->state = 8448 [L1643] CALL s->hit [L1643] RET s->hit [L1643] COND TRUE s->hit [L1644] CALL, EXPR s->s3 [L1644] RET, EXPR s->s3 [L1644] CALL (s->s3)->tmp.next_state = 8640 [L1644] RET (s->s3)->tmp.next_state = 8640 [L1648] CALL s->init_num = 0 [L1648] RET s->init_num = 0 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951: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={1471789951: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 [L1709] CALL, EXPR s->s3 [L1709] RET, EXPR s->s3 [L1709] CALL, EXPR (s->s3)->tmp.reuse_message [L1709] RET, EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={1471789951:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={1471789951: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={1471789951:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={1471789951:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={1471789951:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 1 error locations. UNSAFE Result, 574.4s OverallTime, 124 OverallIterations, 8 TraceHistogramMax, 385.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23289 SDtfs, 47261 SDslu, 59083 SDs, 0 SdLazy, 51787 SolverSat, 4585 SolverUnsat, 124 SolverUnknown, 0 SolverNotchecked, 352.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 19441 GetRequests, 18610 SyntacticMatches, 5 SemanticMatches, 826 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 782 ImplicationChecksByTransitivity, 12.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1369occurred in iteration=122, 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: 5.8s AutomataMinimizationTime, 123 MinimizatonAttempts, 20858 StatesRemovedByMinimization, 121 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 5.6s SsaConstructionTime, 108.3s SatisfiabilityAnalysisTime, 57.0s InterpolantComputationTime, 16143 NumberOfCodeBlocks, 16143 NumberOfCodeBlocksAsserted, 127 NumberOfCheckSat, 19077 ConstructedInterpolants, 168 QuantifiedInterpolants, 14661527 SizeOfPredicates, 2154 NumberOfNonLiveVariables, 98512 ConjunctsInSsa, 2356 ConjunctsInUnsatCore, 145 InterpolantComputations, 120 PerfectInterpolantSequences, 19266/21315 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...