./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_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_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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 0a7396ffb12cf754f13107d729c5350f83c5ce55 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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 0a7396ffb12cf754f13107d729c5350f83c5ce55 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:39:02,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:39:02,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:39:02,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:39:02,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:39:02,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:39:02,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:39:02,037 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:39:02,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:39:02,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:39:02,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:39:02,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:39:02,040 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:39:02,041 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:39:02,042 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:39:02,042 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:39:02,043 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:39:02,044 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:39:02,046 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:39:02,047 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:39:02,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:39:02,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:39:02,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:39:02,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:39:02,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:39:02,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:39:02,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:39:02,050 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:39:02,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:39:02,051 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:39:02,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:39:02,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:39:02,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:39:02,052 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:39:02,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:39:02,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:39:02,053 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 10:39:02,061 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:39:02,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:39:02,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:39:02,062 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:39:02,062 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:39:02,062 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:39:02,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 10:39:02,063 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:39:02,063 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 10:39:02,063 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 10:39:02,063 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:39:02,064 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:39:02,064 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:39:02,064 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:39:02,064 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:39:02,064 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:39:02,065 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:39:02,065 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:39:02,066 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:39:02,066 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:39:02,066 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:39:02,066 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:39:02,066 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:39:02,066 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:39:02,067 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:39:02,067 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 10:39:02,067 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:39:02,067 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 10:39:02,067 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 10:39:02,067 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_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-11-10 10:39:02,091 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:39:02,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:39:02,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:39:02,105 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:39:02,105 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:39:02,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:39:02,152 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/186e02d2b/d3f33ab8ee784fd6bdb2a9ce0ccd0b03/FLAG286e887c4 [2018-11-10 10:39:02,557 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:39:02,558 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:39:02,570 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/186e02d2b/d3f33ab8ee784fd6bdb2a9ce0ccd0b03/FLAG286e887c4 [2018-11-10 10:39:02,580 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/186e02d2b/d3f33ab8ee784fd6bdb2a9ce0ccd0b03 [2018-11-10 10:39:02,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:39:02,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:39:02,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:39:02,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:39:02,586 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:39:02,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:02" (1/1) ... [2018-11-10 10:39:02,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31bdc75e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:02, skipping insertion in model container [2018-11-10 10:39:02,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:39:02" (1/1) ... [2018-11-10 10:39:02,594 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:39:02,634 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:39:03,037 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:39:03,045 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:39:03,326 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:39:03,341 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:39:03,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03 WrapperNode [2018-11-10 10:39:03,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:39:03,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:39:03,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:39:03,342 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:39:03,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,366 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:39:03,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:39:03,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:39:03,409 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:39:03,417 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,428 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... [2018-11-10 10:39:03,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:39:03,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:39:03,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:39:03,479 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:39:03,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:39:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:39:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:39:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 10:39:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 10:39:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:39:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:39:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:39:03,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:39:03,916 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:39:03,917 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:39:04,790 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:39:04,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:39:04 BoogieIcfgContainer [2018-11-10 10:39:04,790 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:39:04,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:39:04,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:39:04,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:39:04,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:39:02" (1/3) ... [2018-11-10 10:39:04,794 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b756913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:04, skipping insertion in model container [2018-11-10 10:39:04,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:39:03" (2/3) ... [2018-11-10 10:39:04,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b756913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:39:04, skipping insertion in model container [2018-11-10 10:39:04,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:39:04" (3/3) ... [2018-11-10 10:39:04,796 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:39:04,803 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:39:04,809 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:39:04,819 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:39:04,848 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:39:04,849 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:39:04,849 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:39:04,849 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:39:04,849 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:39:04,850 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:39:04,850 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:39:04,851 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:39:04,869 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2018-11-10 10:39:04,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:39:04,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:04,878 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, 1] [2018-11-10 10:39:04,881 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:04,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:04,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1614206060, now seen corresponding path program 1 times [2018-11-10 10:39:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:04,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:04,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:04,926 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:05,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:05,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:05,223 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:05,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:05,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:05,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:05,240 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 4 states. [2018-11-10 10:39:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:05,582 INFO L93 Difference]: Finished difference Result 352 states and 593 transitions. [2018-11-10 10:39:05,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:05,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-10 10:39:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:05,592 INFO L225 Difference]: With dead ends: 352 [2018-11-10 10:39:05,592 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 10:39:05,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:05,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 10:39:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2018-11-10 10:39:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 10:39:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions. [2018-11-10 10:39:05,631 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 50 [2018-11-10 10:39:05,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:05,631 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 250 transitions. [2018-11-10 10:39:05,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:05,631 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions. [2018-11-10 10:39:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 10:39:05,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:05,633 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, 1] [2018-11-10 10:39:05,633 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:05,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:05,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1709759664, now seen corresponding path program 1 times [2018-11-10 10:39:05,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:05,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:05,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:05,635 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:05,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:05,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:05,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:05,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:05,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:05,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:05,772 INFO L87 Difference]: Start difference. First operand 162 states and 250 transitions. Second operand 4 states. [2018-11-10 10:39:06,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:06,115 INFO L93 Difference]: Finished difference Result 372 states and 579 transitions. [2018-11-10 10:39:06,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:06,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-11-10 10:39:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:06,117 INFO L225 Difference]: With dead ends: 372 [2018-11-10 10:39:06,118 INFO L226 Difference]: Without dead ends: 236 [2018-11-10 10:39:06,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-11-10 10:39:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 195. [2018-11-10 10:39:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-10 10:39:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 309 transitions. [2018-11-10 10:39:06,131 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 309 transitions. Word has length 64 [2018-11-10 10:39:06,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:06,132 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 309 transitions. [2018-11-10 10:39:06,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 309 transitions. [2018-11-10 10:39:06,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:39:06,133 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:06,134 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-11-10 10:39:06,134 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:06,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1854016997, now seen corresponding path program 1 times [2018-11-10 10:39:06,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:06,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:06,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:06,136 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:06,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:06,235 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:06,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:06,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:06,235 INFO L87 Difference]: Start difference. First operand 195 states and 309 transitions. Second operand 4 states. [2018-11-10 10:39:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:06,582 INFO L93 Difference]: Finished difference Result 496 states and 789 transitions. [2018-11-10 10:39:06,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:06,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 10:39:06,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:06,585 INFO L225 Difference]: With dead ends: 496 [2018-11-10 10:39:06,585 INFO L226 Difference]: Without dead ends: 327 [2018-11-10 10:39:06,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:06,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-11-10 10:39:06,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 236. [2018-11-10 10:39:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-10 10:39:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 383 transitions. [2018-11-10 10:39:06,603 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 383 transitions. Word has length 65 [2018-11-10 10:39:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:06,603 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 383 transitions. [2018-11-10 10:39:06,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 383 transitions. [2018-11-10 10:39:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:39:06,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:06,605 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, 1] [2018-11-10 10:39:06,605 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:06,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash -498371912, now seen corresponding path program 1 times [2018-11-10 10:39:06,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:06,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:06,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:06,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:06,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:06,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:06,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:06,690 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:06,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:06,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:06,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:06,691 INFO L87 Difference]: Start difference. First operand 236 states and 383 transitions. Second operand 4 states. [2018-11-10 10:39:06,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:06,993 INFO L93 Difference]: Finished difference Result 577 states and 936 transitions. [2018-11-10 10:39:06,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:06,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-10 10:39:06,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:06,995 INFO L225 Difference]: With dead ends: 577 [2018-11-10 10:39:06,995 INFO L226 Difference]: Without dead ends: 367 [2018-11-10 10:39:06,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:06,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-11-10 10:39:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 277. [2018-11-10 10:39:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-10 10:39:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 458 transitions. [2018-11-10 10:39:07,021 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 458 transitions. Word has length 66 [2018-11-10 10:39:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:07,022 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 458 transitions. [2018-11-10 10:39:07,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 458 transitions. [2018-11-10 10:39:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:39:07,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:07,025 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, 1] [2018-11-10 10:39:07,025 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:07,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash 598138745, now seen corresponding path program 1 times [2018-11-10 10:39:07,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:07,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,027 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:07,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:07,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:07,107 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:07,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:07,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:07,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:07,107 INFO L87 Difference]: Start difference. First operand 277 states and 458 transitions. Second operand 4 states. [2018-11-10 10:39:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:07,306 INFO L93 Difference]: Finished difference Result 545 states and 900 transitions. [2018-11-10 10:39:07,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:07,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 10:39:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:07,308 INFO L225 Difference]: With dead ends: 545 [2018-11-10 10:39:07,309 INFO L226 Difference]: Without dead ends: 294 [2018-11-10 10:39:07,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-10 10:39:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 277. [2018-11-10 10:39:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-11-10 10:39:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 457 transitions. [2018-11-10 10:39:07,319 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 457 transitions. Word has length 94 [2018-11-10 10:39:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:07,319 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 457 transitions. [2018-11-10 10:39:07,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 457 transitions. [2018-11-10 10:39:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:39:07,321 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:07,321 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, 1] [2018-11-10 10:39:07,321 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:07,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1974994684, now seen corresponding path program 1 times [2018-11-10 10:39:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:07,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:07,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,323 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:07,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:07,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:07,414 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:07,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:07,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:07,417 INFO L87 Difference]: Start difference. First operand 277 states and 457 transitions. Second operand 4 states. [2018-11-10 10:39:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:07,746 INFO L93 Difference]: Finished difference Result 696 states and 1153 transitions. [2018-11-10 10:39:07,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:07,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:39:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:07,748 INFO L225 Difference]: With dead ends: 696 [2018-11-10 10:39:07,748 INFO L226 Difference]: Without dead ends: 445 [2018-11-10 10:39:07,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2018-11-10 10:39:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 343. [2018-11-10 10:39:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-11-10 10:39:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 575 transitions. [2018-11-10 10:39:07,757 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 575 transitions. Word has length 95 [2018-11-10 10:39:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:07,758 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 575 transitions. [2018-11-10 10:39:07,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 575 transitions. [2018-11-10 10:39:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:39:07,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:07,759 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, 1] [2018-11-10 10:39:07,760 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:07,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1958523801, now seen corresponding path program 1 times [2018-11-10 10:39:07,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:07,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:07,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:07,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:07,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:07,826 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:07,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:07,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:07,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:07,827 INFO L87 Difference]: Start difference. First operand 343 states and 575 transitions. Second operand 4 states. [2018-11-10 10:39:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:08,113 INFO L93 Difference]: Finished difference Result 675 states and 1133 transitions. [2018-11-10 10:39:08,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:08,114 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:39:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:08,116 INFO L225 Difference]: With dead ends: 675 [2018-11-10 10:39:08,116 INFO L226 Difference]: Without dead ends: 358 [2018-11-10 10:39:08,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:08,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-11-10 10:39:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 343. [2018-11-10 10:39:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-11-10 10:39:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 574 transitions. [2018-11-10 10:39:08,128 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 574 transitions. Word has length 95 [2018-11-10 10:39:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:08,128 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 574 transitions. [2018-11-10 10:39:08,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 574 transitions. [2018-11-10 10:39:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 10:39:08,130 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:08,130 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, 1] [2018-11-10 10:39:08,130 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:08,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash 107611930, now seen corresponding path program 1 times [2018-11-10 10:39:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:08,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,132 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 10:39:08,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:08,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:39:08,203 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:08,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:39:08,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:39:08,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:39:08,203 INFO L87 Difference]: Start difference. First operand 343 states and 574 transitions. Second operand 3 states. [2018-11-10 10:39:08,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:08,276 INFO L93 Difference]: Finished difference Result 973 states and 1647 transitions. [2018-11-10 10:39:08,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:39:08,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-11-10 10:39:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:08,279 INFO L225 Difference]: With dead ends: 973 [2018-11-10 10:39:08,279 INFO L226 Difference]: Without dead ends: 656 [2018-11-10 10:39:08,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:39:08,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-11-10 10:39:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2018-11-10 10:39:08,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-11-10 10:39:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 1089 transitions. [2018-11-10 10:39:08,296 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 1089 transitions. Word has length 101 [2018-11-10 10:39:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:08,296 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 1089 transitions. [2018-11-10 10:39:08,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:39:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 1089 transitions. [2018-11-10 10:39:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 10:39:08,299 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:08,299 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, 1] [2018-11-10 10:39:08,299 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:08,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash 355758424, now seen corresponding path program 1 times [2018-11-10 10:39:08,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:08,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,301 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:08,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:08,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:08,400 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:08,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:08,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:08,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:08,401 INFO L87 Difference]: Start difference. First operand 654 states and 1089 transitions. Second operand 4 states. [2018-11-10 10:39:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:08,821 INFO L93 Difference]: Finished difference Result 1539 states and 2528 transitions. [2018-11-10 10:39:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:08,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 10:39:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:08,825 INFO L225 Difference]: With dead ends: 1539 [2018-11-10 10:39:08,825 INFO L226 Difference]: Without dead ends: 911 [2018-11-10 10:39:08,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2018-11-10 10:39:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 730. [2018-11-10 10:39:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-10 10:39:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1223 transitions. [2018-11-10 10:39:08,847 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1223 transitions. Word has length 101 [2018-11-10 10:39:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:08,848 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 1223 transitions. [2018-11-10 10:39:08,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1223 transitions. [2018-11-10 10:39:08,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:39:08,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:08,850 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, 1] [2018-11-10 10:39:08,850 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:08,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:08,850 INFO L82 PathProgramCache]: Analyzing trace with hash 468546581, now seen corresponding path program 1 times [2018-11-10 10:39:08,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:08,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:08,852 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:08,927 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:08,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:08,928 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:08,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:08,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:08,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:08,928 INFO L87 Difference]: Start difference. First operand 730 states and 1223 transitions. Second operand 4 states. [2018-11-10 10:39:09,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:09,334 INFO L93 Difference]: Finished difference Result 1609 states and 2650 transitions. [2018-11-10 10:39:09,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:09,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-10 10:39:09,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:09,338 INFO L225 Difference]: With dead ends: 1609 [2018-11-10 10:39:09,338 INFO L226 Difference]: Without dead ends: 905 [2018-11-10 10:39:09,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-11-10 10:39:09,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 730. [2018-11-10 10:39:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-10 10:39:09,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1219 transitions. [2018-11-10 10:39:09,359 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1219 transitions. Word has length 102 [2018-11-10 10:39:09,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:09,359 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 1219 transitions. [2018-11-10 10:39:09,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:09,360 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1219 transitions. [2018-11-10 10:39:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:39:09,361 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:09,361 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, 1] [2018-11-10 10:39:09,362 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:09,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1336184152, now seen corresponding path program 1 times [2018-11-10 10:39:09,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:09,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:09,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:09,363 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:09,442 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 10:39:09,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:09,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:09,442 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:09,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:09,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:09,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:09,443 INFO L87 Difference]: Start difference. First operand 730 states and 1219 transitions. Second operand 4 states. [2018-11-10 10:39:09,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:09,778 INFO L93 Difference]: Finished difference Result 1448 states and 2420 transitions. [2018-11-10 10:39:09,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:09,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 10:39:09,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:09,781 INFO L225 Difference]: With dead ends: 1448 [2018-11-10 10:39:09,781 INFO L226 Difference]: Without dead ends: 744 [2018-11-10 10:39:09,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-11-10 10:39:09,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 730. [2018-11-10 10:39:09,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-11-10 10:39:09,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 1218 transitions. [2018-11-10 10:39:09,801 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 1218 transitions. Word has length 109 [2018-11-10 10:39:09,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:09,801 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 1218 transitions. [2018-11-10 10:39:09,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 1218 transitions. [2018-11-10 10:39:09,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:39:09,803 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:09,803 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, 1] [2018-11-10 10:39:09,804 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:09,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:09,804 INFO L82 PathProgramCache]: Analyzing trace with hash 202831508, now seen corresponding path program 1 times [2018-11-10 10:39:09,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:09,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:09,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:09,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:09,805 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:09,890 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-10 10:39:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 10:39:09,891 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:09,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 10:39:09,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 10:39:09,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:09,892 INFO L87 Difference]: Start difference. First operand 730 states and 1218 transitions. Second operand 5 states. [2018-11-10 10:39:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:10,220 INFO L93 Difference]: Finished difference Result 1454 states and 2428 transitions. [2018-11-10 10:39:10,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:39:10,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2018-11-10 10:39:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:10,222 INFO L225 Difference]: With dead ends: 1454 [2018-11-10 10:39:10,222 INFO L226 Difference]: Without dead ends: 750 [2018-11-10 10:39:10,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:39:10,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-11-10 10:39:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 748. [2018-11-10 10:39:10,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-11-10 10:39:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1228 transitions. [2018-11-10 10:39:10,235 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1228 transitions. Word has length 109 [2018-11-10 10:39:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:10,235 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 1228 transitions. [2018-11-10 10:39:10,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 10:39:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1228 transitions. [2018-11-10 10:39:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:39:10,236 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:10,236 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, 1] [2018-11-10 10:39:10,237 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:10,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:10,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1741871068, now seen corresponding path program 1 times [2018-11-10 10:39:10,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:10,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:10,278 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:10,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:10,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:10,279 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:10,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:10,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:10,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:10,279 INFO L87 Difference]: Start difference. First operand 748 states and 1228 transitions. Second operand 4 states. [2018-11-10 10:39:10,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:10,632 INFO L93 Difference]: Finished difference Result 1725 states and 2797 transitions. [2018-11-10 10:39:10,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:10,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 10:39:10,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:10,636 INFO L225 Difference]: With dead ends: 1725 [2018-11-10 10:39:10,636 INFO L226 Difference]: Without dead ends: 1003 [2018-11-10 10:39:10,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:10,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2018-11-10 10:39:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 782. [2018-11-10 10:39:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-11-10 10:39:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1270 transitions. [2018-11-10 10:39:10,660 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1270 transitions. Word has length 109 [2018-11-10 10:39:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:10,660 INFO L481 AbstractCegarLoop]: Abstraction has 782 states and 1270 transitions. [2018-11-10 10:39:10,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1270 transitions. [2018-11-10 10:39:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:39:10,662 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:10,663 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, 1] [2018-11-10 10:39:10,663 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:10,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:10,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1240479850, now seen corresponding path program 1 times [2018-11-10 10:39:10,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:10,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:10,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:10,664 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:10,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:10,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:10,716 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:10,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:10,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:10,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:10,717 INFO L87 Difference]: Start difference. First operand 782 states and 1270 transitions. Second operand 4 states. [2018-11-10 10:39:11,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:11,125 INFO L93 Difference]: Finished difference Result 1711 states and 2741 transitions. [2018-11-10 10:39:11,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:11,126 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 10:39:11,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:11,129 INFO L225 Difference]: With dead ends: 1711 [2018-11-10 10:39:11,130 INFO L226 Difference]: Without dead ends: 955 [2018-11-10 10:39:11,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-10 10:39:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 782. [2018-11-10 10:39:11,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2018-11-10 10:39:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1258 transitions. [2018-11-10 10:39:11,155 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1258 transitions. Word has length 110 [2018-11-10 10:39:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:11,155 INFO L481 AbstractCegarLoop]: Abstraction has 782 states and 1258 transitions. [2018-11-10 10:39:11,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1258 transitions. [2018-11-10 10:39:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:39:11,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:11,157 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, 1] [2018-11-10 10:39:11,157 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:11,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 349283122, now seen corresponding path program 1 times [2018-11-10 10:39:11,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:11,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:11,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:11,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:11,159 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:11,227 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:11,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:11,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:11,227 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:11,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:11,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:11,228 INFO L87 Difference]: Start difference. First operand 782 states and 1258 transitions. Second operand 4 states. [2018-11-10 10:39:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:11,543 INFO L93 Difference]: Finished difference Result 1793 states and 2853 transitions. [2018-11-10 10:39:11,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:11,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-10 10:39:11,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:11,548 INFO L225 Difference]: With dead ends: 1793 [2018-11-10 10:39:11,548 INFO L226 Difference]: Without dead ends: 1037 [2018-11-10 10:39:11,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-11-10 10:39:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 870. [2018-11-10 10:39:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 870 states. [2018-11-10 10:39:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1404 transitions. [2018-11-10 10:39:11,580 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1404 transitions. Word has length 111 [2018-11-10 10:39:11,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:11,581 INFO L481 AbstractCegarLoop]: Abstraction has 870 states and 1404 transitions. [2018-11-10 10:39:11,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1404 transitions. [2018-11-10 10:39:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 10:39:11,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:11,583 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, 1, 1] [2018-11-10 10:39:11,584 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:11,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:11,584 INFO L82 PathProgramCache]: Analyzing trace with hash -963850777, now seen corresponding path program 1 times [2018-11-10 10:39:11,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:11,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:11,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:11,585 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:39:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:11,668 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:11,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:11,669 INFO L87 Difference]: Start difference. First operand 870 states and 1404 transitions. Second operand 4 states. [2018-11-10 10:39:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:12,059 INFO L93 Difference]: Finished difference Result 1887 states and 3009 transitions. [2018-11-10 10:39:12,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:12,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-11-10 10:39:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:12,063 INFO L225 Difference]: With dead ends: 1887 [2018-11-10 10:39:12,063 INFO L226 Difference]: Without dead ends: 1039 [2018-11-10 10:39:12,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2018-11-10 10:39:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 874. [2018-11-10 10:39:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-11-10 10:39:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1410 transitions. [2018-11-10 10:39:12,089 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1410 transitions. Word has length 112 [2018-11-10 10:39:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:12,089 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 1410 transitions. [2018-11-10 10:39:12,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1410 transitions. [2018-11-10 10:39:12,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 10:39:12,091 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:12,091 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, 1] [2018-11-10 10:39:12,092 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:12,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:12,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1763279071, now seen corresponding path program 1 times [2018-11-10 10:39:12,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:12,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,093 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:12,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:12,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:12,182 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:12,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:12,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:12,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:12,182 INFO L87 Difference]: Start difference. First operand 874 states and 1410 transitions. Second operand 4 states. [2018-11-10 10:39:12,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:12,544 INFO L93 Difference]: Finished difference Result 1973 states and 3149 transitions. [2018-11-10 10:39:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:12,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-11-10 10:39:12,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:12,547 INFO L225 Difference]: With dead ends: 1973 [2018-11-10 10:39:12,547 INFO L226 Difference]: Without dead ends: 1125 [2018-11-10 10:39:12,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:12,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2018-11-10 10:39:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 936. [2018-11-10 10:39:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-11-10 10:39:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1502 transitions. [2018-11-10 10:39:12,564 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1502 transitions. Word has length 123 [2018-11-10 10:39:12,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:12,564 INFO L481 AbstractCegarLoop]: Abstraction has 936 states and 1502 transitions. [2018-11-10 10:39:12,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:12,565 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1502 transitions. [2018-11-10 10:39:12,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:39:12,566 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:12,566 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, 1] [2018-11-10 10:39:12,567 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:12,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:12,567 INFO L82 PathProgramCache]: Analyzing trace with hash -606257287, now seen corresponding path program 1 times [2018-11-10 10:39:12,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:12,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,568 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:12,617 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:12,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:12,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:12,617 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:12,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:12,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:12,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:12,618 INFO L87 Difference]: Start difference. First operand 936 states and 1502 transitions. Second operand 4 states. [2018-11-10 10:39:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:12,945 INFO L93 Difference]: Finished difference Result 2011 states and 3191 transitions. [2018-11-10 10:39:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:12,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-10 10:39:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:12,947 INFO L225 Difference]: With dead ends: 2011 [2018-11-10 10:39:12,947 INFO L226 Difference]: Without dead ends: 1101 [2018-11-10 10:39:12,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2018-11-10 10:39:12,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 936. [2018-11-10 10:39:12,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-11-10 10:39:12,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1488 transitions. [2018-11-10 10:39:12,976 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1488 transitions. Word has length 124 [2018-11-10 10:39:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:12,977 INFO L481 AbstractCegarLoop]: Abstraction has 936 states and 1488 transitions. [2018-11-10 10:39:12,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1488 transitions. [2018-11-10 10:39:12,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:39:12,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:12,979 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, 1] [2018-11-10 10:39:12,979 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:12,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:12,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1889203486, now seen corresponding path program 1 times [2018-11-10 10:39:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:12,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:12,981 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:13,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:13,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:13,045 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:13,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:13,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:13,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:13,046 INFO L87 Difference]: Start difference. First operand 936 states and 1488 transitions. Second operand 4 states. [2018-11-10 10:39:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:13,306 INFO L93 Difference]: Finished difference Result 2097 states and 3301 transitions. [2018-11-10 10:39:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:13,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-11-10 10:39:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:13,310 INFO L225 Difference]: With dead ends: 2097 [2018-11-10 10:39:13,310 INFO L226 Difference]: Without dead ends: 1187 [2018-11-10 10:39:13,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:13,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-11-10 10:39:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 994. [2018-11-10 10:39:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-11-10 10:39:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1570 transitions. [2018-11-10 10:39:13,356 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1570 transitions. Word has length 127 [2018-11-10 10:39:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:13,356 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1570 transitions. [2018-11-10 10:39:13,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1570 transitions. [2018-11-10 10:39:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:39:13,358 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:13,359 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, 1] [2018-11-10 10:39:13,359 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:13,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -444277796, now seen corresponding path program 1 times [2018-11-10 10:39:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:13,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:13,360 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-10 10:39:13,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:13,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:13,435 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:13,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:13,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:13,436 INFO L87 Difference]: Start difference. First operand 994 states and 1570 transitions. Second operand 4 states. [2018-11-10 10:39:13,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:13,767 INFO L93 Difference]: Finished difference Result 2127 states and 3327 transitions. [2018-11-10 10:39:13,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:13,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-11-10 10:39:13,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:13,769 INFO L225 Difference]: With dead ends: 2127 [2018-11-10 10:39:13,770 INFO L226 Difference]: Without dead ends: 1159 [2018-11-10 10:39:13,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2018-11-10 10:39:13,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 994. [2018-11-10 10:39:13,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2018-11-10 10:39:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1554 transitions. [2018-11-10 10:39:13,800 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1554 transitions. Word has length 128 [2018-11-10 10:39:13,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:13,800 INFO L481 AbstractCegarLoop]: Abstraction has 994 states and 1554 transitions. [2018-11-10 10:39:13,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1554 transitions. [2018-11-10 10:39:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 10:39:13,802 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:13,803 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, 1] [2018-11-10 10:39:13,803 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:13,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash -539274655, now seen corresponding path program 1 times [2018-11-10 10:39:13,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:13,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:13,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:13,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:13,804 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 10:39:13,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:13,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:13,879 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:13,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:13,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:13,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:13,880 INFO L87 Difference]: Start difference. First operand 994 states and 1554 transitions. Second operand 4 states. [2018-11-10 10:39:14,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:14,194 INFO L93 Difference]: Finished difference Result 2213 states and 3429 transitions. [2018-11-10 10:39:14,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:14,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2018-11-10 10:39:14,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:14,197 INFO L225 Difference]: With dead ends: 2213 [2018-11-10 10:39:14,197 INFO L226 Difference]: Without dead ends: 1245 [2018-11-10 10:39:14,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:14,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2018-11-10 10:39:14,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1066. [2018-11-10 10:39:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-11-10 10:39:14,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1662 transitions. [2018-11-10 10:39:14,229 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1662 transitions. Word has length 135 [2018-11-10 10:39:14,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:14,229 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1662 transitions. [2018-11-10 10:39:14,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:14,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1662 transitions. [2018-11-10 10:39:14,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 10:39:14,231 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:14,231 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, 1] [2018-11-10 10:39:14,231 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:14,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:14,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1321390230, now seen corresponding path program 1 times [2018-11-10 10:39:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,233 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:14,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-10 10:39:14,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:14,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:14,324 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:14,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:14,325 INFO L87 Difference]: Start difference. First operand 1066 states and 1662 transitions. Second operand 4 states. [2018-11-10 10:39:14,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:14,598 INFO L93 Difference]: Finished difference Result 2271 states and 3511 transitions. [2018-11-10 10:39:14,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:14,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-11-10 10:39:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:14,602 INFO L225 Difference]: With dead ends: 2271 [2018-11-10 10:39:14,602 INFO L226 Difference]: Without dead ends: 1231 [2018-11-10 10:39:14,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:14,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2018-11-10 10:39:14,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 1066. [2018-11-10 10:39:14,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-11-10 10:39:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1654 transitions. [2018-11-10 10:39:14,623 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1654 transitions. Word has length 136 [2018-11-10 10:39:14,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:14,623 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1654 transitions. [2018-11-10 10:39:14,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:14,623 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1654 transitions. [2018-11-10 10:39:14,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-10 10:39:14,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:14,625 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:39:14,625 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:14,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:14,625 INFO L82 PathProgramCache]: Analyzing trace with hash -606463229, now seen corresponding path program 1 times [2018-11-10 10:39:14,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:14,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:14,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:14,692 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-10 10:39:14,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:14,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:14,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:14,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:14,693 INFO L87 Difference]: Start difference. First operand 1066 states and 1654 transitions. Second operand 4 states. [2018-11-10 10:39:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:14,943 INFO L93 Difference]: Finished difference Result 1630 states and 2536 transitions. [2018-11-10 10:39:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:14,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-11-10 10:39:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:14,946 INFO L225 Difference]: With dead ends: 1630 [2018-11-10 10:39:14,946 INFO L226 Difference]: Without dead ends: 1107 [2018-11-10 10:39:14,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-11-10 10:39:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1089. [2018-11-10 10:39:14,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-11-10 10:39:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1690 transitions. [2018-11-10 10:39:14,993 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1690 transitions. Word has length 154 [2018-11-10 10:39:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:14,993 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1690 transitions. [2018-11-10 10:39:14,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1690 transitions. [2018-11-10 10:39:14,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-10 10:39:14,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:14,995 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, 1, 1, 1] [2018-11-10 10:39:14,995 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:14,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:14,995 INFO L82 PathProgramCache]: Analyzing trace with hash -731946343, now seen corresponding path program 1 times [2018-11-10 10:39:14,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:14,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:14,997 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 10:39:15,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:15,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:15,080 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:15,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:15,081 INFO L87 Difference]: Start difference. First operand 1089 states and 1690 transitions. Second operand 4 states. [2018-11-10 10:39:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:15,361 INFO L93 Difference]: Finished difference Result 2406 states and 3700 transitions. [2018-11-10 10:39:15,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:15,361 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-11-10 10:39:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:15,364 INFO L225 Difference]: With dead ends: 2406 [2018-11-10 10:39:15,364 INFO L226 Difference]: Without dead ends: 1343 [2018-11-10 10:39:15,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:15,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2018-11-10 10:39:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1176. [2018-11-10 10:39:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-10 10:39:15,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1817 transitions. [2018-11-10 10:39:15,385 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1817 transitions. Word has length 155 [2018-11-10 10:39:15,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:15,385 INFO L481 AbstractCegarLoop]: Abstraction has 1176 states and 1817 transitions. [2018-11-10 10:39:15,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:15,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1817 transitions. [2018-11-10 10:39:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 10:39:15,386 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:15,386 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, 1] [2018-11-10 10:39:15,386 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:15,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash 737301419, now seen corresponding path program 1 times [2018-11-10 10:39:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:15,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:15,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:15,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:15,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 10:39:15,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:15,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:15,465 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:15,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:15,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:15,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:15,466 INFO L87 Difference]: Start difference. First operand 1176 states and 1817 transitions. Second operand 4 states. [2018-11-10 10:39:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:15,730 INFO L93 Difference]: Finished difference Result 2577 states and 3949 transitions. [2018-11-10 10:39:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:15,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-10 10:39:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:15,733 INFO L225 Difference]: With dead ends: 2577 [2018-11-10 10:39:15,733 INFO L226 Difference]: Without dead ends: 1427 [2018-11-10 10:39:15,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:15,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2018-11-10 10:39:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1230. [2018-11-10 10:39:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2018-11-10 10:39:15,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1885 transitions. [2018-11-10 10:39:15,756 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1885 transitions. Word has length 156 [2018-11-10 10:39:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:15,756 INFO L481 AbstractCegarLoop]: Abstraction has 1230 states and 1885 transitions. [2018-11-10 10:39:15,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:15,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1885 transitions. [2018-11-10 10:39:15,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 10:39:15,757 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:15,757 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, 1, 1, 1] [2018-11-10 10:39:15,757 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:15,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:15,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1427338862, now seen corresponding path program 1 times [2018-11-10 10:39:15,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:15,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:15,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:15,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 10:39:15,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:15,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:15,817 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:15,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:15,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:15,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:15,817 INFO L87 Difference]: Start difference. First operand 1230 states and 1885 transitions. Second operand 4 states. [2018-11-10 10:39:16,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:16,138 INFO L93 Difference]: Finished difference Result 2599 states and 3957 transitions. [2018-11-10 10:39:16,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:16,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-10 10:39:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:16,141 INFO L225 Difference]: With dead ends: 2599 [2018-11-10 10:39:16,141 INFO L226 Difference]: Without dead ends: 1379 [2018-11-10 10:39:16,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-11-10 10:39:16,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1214. [2018-11-10 10:39:16,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-10 10:39:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1857 transitions. [2018-11-10 10:39:16,171 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1857 transitions. Word has length 156 [2018-11-10 10:39:16,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:16,172 INFO L481 AbstractCegarLoop]: Abstraction has 1214 states and 1857 transitions. [2018-11-10 10:39:16,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:16,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1857 transitions. [2018-11-10 10:39:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-11-10 10:39:16,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:16,173 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, 1] [2018-11-10 10:39:16,173 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:16,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 319635857, now seen corresponding path program 1 times [2018-11-10 10:39:16,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,175 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:16,229 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-11-10 10:39:16,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:16,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:16,229 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:16,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:16,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:16,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:16,230 INFO L87 Difference]: Start difference. First operand 1214 states and 1857 transitions. Second operand 4 states. [2018-11-10 10:39:16,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:16,496 INFO L93 Difference]: Finished difference Result 2567 states and 3901 transitions. [2018-11-10 10:39:16,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:16,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-11-10 10:39:16,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:16,499 INFO L225 Difference]: With dead ends: 2567 [2018-11-10 10:39:16,499 INFO L226 Difference]: Without dead ends: 1379 [2018-11-10 10:39:16,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2018-11-10 10:39:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1214. [2018-11-10 10:39:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-10 10:39:16,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1835 transitions. [2018-11-10 10:39:16,524 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1835 transitions. Word has length 157 [2018-11-10 10:39:16,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:16,524 INFO L481 AbstractCegarLoop]: Abstraction has 1214 states and 1835 transitions. [2018-11-10 10:39:16,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1835 transitions. [2018-11-10 10:39:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-11-10 10:39:16,525 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:16,525 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, 1] [2018-11-10 10:39:16,525 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:16,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:16,525 INFO L82 PathProgramCache]: Analyzing trace with hash 121342930, now seen corresponding path program 1 times [2018-11-10 10:39:16,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:16,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 10:39:16,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:16,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:16,596 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:16,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:16,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:16,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:16,597 INFO L87 Difference]: Start difference. First operand 1214 states and 1835 transitions. Second operand 4 states. [2018-11-10 10:39:16,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:16,946 INFO L93 Difference]: Finished difference Result 2637 states and 3965 transitions. [2018-11-10 10:39:16,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:16,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2018-11-10 10:39:16,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:16,950 INFO L225 Difference]: With dead ends: 2637 [2018-11-10 10:39:16,950 INFO L226 Difference]: Without dead ends: 1449 [2018-11-10 10:39:16,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:16,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2018-11-10 10:39:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1282. [2018-11-10 10:39:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-11-10 10:39:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1929 transitions. [2018-11-10 10:39:16,977 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1929 transitions. Word has length 170 [2018-11-10 10:39:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:16,977 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 1929 transitions. [2018-11-10 10:39:16,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1929 transitions. [2018-11-10 10:39:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 10:39:16,978 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:16,978 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, 1] [2018-11-10 10:39:16,979 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:16,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:16,979 INFO L82 PathProgramCache]: Analyzing trace with hash -135503651, now seen corresponding path program 1 times [2018-11-10 10:39:16,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:16,979 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-11-10 10:39:17,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:17,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:17,048 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:17,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:17,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:17,049 INFO L87 Difference]: Start difference. First operand 1282 states and 1929 transitions. Second operand 4 states. [2018-11-10 10:39:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:17,309 INFO L93 Difference]: Finished difference Result 2703 states and 4045 transitions. [2018-11-10 10:39:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:17,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2018-11-10 10:39:17,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:17,312 INFO L225 Difference]: With dead ends: 2703 [2018-11-10 10:39:17,312 INFO L226 Difference]: Without dead ends: 1429 [2018-11-10 10:39:17,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:17,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2018-11-10 10:39:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 1198. [2018-11-10 10:39:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2018-11-10 10:39:17,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1789 transitions. [2018-11-10 10:39:17,338 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1789 transitions. Word has length 171 [2018-11-10 10:39:17,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:17,338 INFO L481 AbstractCegarLoop]: Abstraction has 1198 states and 1789 transitions. [2018-11-10 10:39:17,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:17,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1789 transitions. [2018-11-10 10:39:17,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-10 10:39:17,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:17,339 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] [2018-11-10 10:39:17,339 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:17,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:17,340 INFO L82 PathProgramCache]: Analyzing trace with hash 395048669, now seen corresponding path program 1 times [2018-11-10 10:39:17,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:17,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:17,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:17,340 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-10 10:39:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:17,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:39:17,421 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:17,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:39:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:39:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:39:17,422 INFO L87 Difference]: Start difference. First operand 1198 states and 1789 transitions. Second operand 3 states. [2018-11-10 10:39:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:17,555 INFO L93 Difference]: Finished difference Result 2396 states and 3600 transitions. [2018-11-10 10:39:17,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:39:17,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2018-11-10 10:39:17,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:17,558 INFO L225 Difference]: With dead ends: 2396 [2018-11-10 10:39:17,558 INFO L226 Difference]: Without dead ends: 1795 [2018-11-10 10:39:17,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:39:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1795 states. [2018-11-10 10:39:17,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1795 to 1775. [2018-11-10 10:39:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-11-10 10:39:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2658 transitions. [2018-11-10 10:39:17,626 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2658 transitions. Word has length 177 [2018-11-10 10:39:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:17,626 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2658 transitions. [2018-11-10 10:39:17,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:39:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2658 transitions. [2018-11-10 10:39:17,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-11-10 10:39:17,629 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:17,629 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, 1, 1, 1] [2018-11-10 10:39:17,629 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:17,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:17,629 INFO L82 PathProgramCache]: Analyzing trace with hash -207267835, now seen corresponding path program 1 times [2018-11-10 10:39:17,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:17,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:17,631 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 10:39:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:17,737 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:17,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:17,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:17,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:17,738 INFO L87 Difference]: Start difference. First operand 1775 states and 2658 transitions. Second operand 4 states. [2018-11-10 10:39:18,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:18,141 INFO L93 Difference]: Finished difference Result 3766 states and 5602 transitions. [2018-11-10 10:39:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:18,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-11-10 10:39:18,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:18,144 INFO L225 Difference]: With dead ends: 3766 [2018-11-10 10:39:18,144 INFO L226 Difference]: Without dead ends: 2017 [2018-11-10 10:39:18,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2018-11-10 10:39:18,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 1775. [2018-11-10 10:39:18,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-11-10 10:39:18,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2622 transitions. [2018-11-10 10:39:18,186 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2622 transitions. Word has length 178 [2018-11-10 10:39:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:18,186 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2622 transitions. [2018-11-10 10:39:18,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2622 transitions. [2018-11-10 10:39:18,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 10:39:18,187 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:18,188 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, 1, 1, 1] [2018-11-10 10:39:18,188 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:18,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:18,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2114721451, now seen corresponding path program 1 times [2018-11-10 10:39:18,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:18,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:18,189 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:18,254 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 10:39:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:18,255 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:18,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:18,255 INFO L87 Difference]: Start difference. First operand 1775 states and 2622 transitions. Second operand 4 states. [2018-11-10 10:39:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:18,541 INFO L93 Difference]: Finished difference Result 3762 states and 5525 transitions. [2018-11-10 10:39:18,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:18,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-10 10:39:18,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:18,545 INFO L225 Difference]: With dead ends: 3762 [2018-11-10 10:39:18,545 INFO L226 Difference]: Without dead ends: 2013 [2018-11-10 10:39:18,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2013 states. [2018-11-10 10:39:18,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2013 to 1775. [2018-11-10 10:39:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2018-11-10 10:39:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2586 transitions. [2018-11-10 10:39:18,612 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2586 transitions. Word has length 179 [2018-11-10 10:39:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:18,612 INFO L481 AbstractCegarLoop]: Abstraction has 1775 states and 2586 transitions. [2018-11-10 10:39:18,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2586 transitions. [2018-11-10 10:39:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-11-10 10:39:18,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:18,614 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, 1] [2018-11-10 10:39:18,614 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:18,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:18,614 INFO L82 PathProgramCache]: Analyzing trace with hash 57029899, now seen corresponding path program 1 times [2018-11-10 10:39:18,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:18,615 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 10:39:18,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:18,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:18,701 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:18,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:18,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:18,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:18,702 INFO L87 Difference]: Start difference. First operand 1775 states and 2586 transitions. Second operand 4 states. [2018-11-10 10:39:18,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:18,983 INFO L93 Difference]: Finished difference Result 3840 states and 5573 transitions. [2018-11-10 10:39:18,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:18,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-11-10 10:39:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:18,986 INFO L225 Difference]: With dead ends: 3840 [2018-11-10 10:39:18,986 INFO L226 Difference]: Without dead ends: 2091 [2018-11-10 10:39:18,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:18,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2018-11-10 10:39:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1850. [2018-11-10 10:39:19,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1850 states. [2018-11-10 10:39:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2667 transitions. [2018-11-10 10:39:19,059 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2667 transitions. Word has length 179 [2018-11-10 10:39:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:19,059 INFO L481 AbstractCegarLoop]: Abstraction has 1850 states and 2667 transitions. [2018-11-10 10:39:19,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2667 transitions. [2018-11-10 10:39:19,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 10:39:19,061 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:19,061 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, 1] [2018-11-10 10:39:19,061 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:19,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -728607803, now seen corresponding path program 1 times [2018-11-10 10:39:19,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:19,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:19,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:19,062 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-11-10 10:39:19,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:39:19,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:39:19,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 10:39:19,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:39:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:39:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:39:19,163 INFO L87 Difference]: Start difference. First operand 1850 states and 2667 transitions. Second operand 4 states. [2018-11-10 10:39:19,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:19,441 INFO L93 Difference]: Finished difference Result 3301 states and 4747 transitions. [2018-11-10 10:39:19,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:39:19,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-10 10:39:19,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:19,443 INFO L225 Difference]: With dead ends: 3301 [2018-11-10 10:39:19,443 INFO L226 Difference]: Without dead ends: 1465 [2018-11-10 10:39:19,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:39:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2018-11-10 10:39:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1299. [2018-11-10 10:39:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1299 states. [2018-11-10 10:39:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1850 transitions. [2018-11-10 10:39:19,473 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1850 transitions. Word has length 180 [2018-11-10 10:39:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:19,473 INFO L481 AbstractCegarLoop]: Abstraction has 1299 states and 1850 transitions. [2018-11-10 10:39:19,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:39:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1850 transitions. [2018-11-10 10:39:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 10:39:19,474 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:19,474 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, 1, 1, 1] [2018-11-10 10:39:19,475 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:19,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1855463037, now seen corresponding path program 1 times [2018-11-10 10:39:19,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:19,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:19,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:19,852 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-10 10:39:19,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:39:19,852 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:39:19,852 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 182 with the following transitions: [2018-11-10 10:39:19,853 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], [530], [545], [550], [555], [560], [565], [571], [576], [578], [583], [588], [593], [599], [602], [606], [627], [661], [663], [675], [678], [679], [680], [682] [2018-11-10 10:39:19,896 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:39:19,896 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:39:20,394 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:39:55,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:39:55,916 INFO L272 AbstractInterpreter]: Visited 83 different actions 426 times. Merged at 69 different actions 328 times. Widened at 9 different actions 9 times. Found 18 fixpoints after 8 different actions. Largest state had 142 variables. [2018-11-10 10:39:55,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:55,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:39:55,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:39:55,929 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:39:55,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:55,936 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:39:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:56,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:39:56,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:39:56,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:39:56,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:39:56,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:39:56,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:39:56,277 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:56,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:39:56,294 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:56,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:56,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:56,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:39:56,298 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,308 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,312 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,326 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:51, output treesize:23 [2018-11-10 10:39:56,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 10:39:56,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 10:39:56,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 34 [2018-11-10 10:39:56,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-11-10 10:39:56,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:45, output treesize:14 [2018-11-10 10:39:56,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-11-10 10:39:56,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:39:56,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-10 10:39:56,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-11-10 10:39:56,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-11-10 10:39:56,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:56,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:39:56,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-10 10:39:56,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:39:56,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:13 [2018-11-10 10:39:56,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-10 10:39:56,647 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:39:56,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:39:56,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,657 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:13 [2018-11-10 10:39:56,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 15 treesize of output 11 [2018-11-10 10:39:56,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-10 10:39:56,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-10 10:39:56,785 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:39:56,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:39:56,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-10 10:39:56,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 11 treesize of output 10 [2018-11-10 10:39:56,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 10:39:56,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 10:39:56,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:39:56,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:10 [2018-11-10 10:39:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:39:57,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:39:57,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2018-11-10 10:39:57,277 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:39:57,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 10:39:57,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 10:39:57,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:39:57,278 INFO L87 Difference]: Start difference. First operand 1299 states and 1850 transitions. Second operand 17 states. [2018-11-10 10:39:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:39:58,875 INFO L93 Difference]: Finished difference Result 2569 states and 3657 transitions. [2018-11-10 10:39:58,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:39:58,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 181 [2018-11-10 10:39:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:39:58,878 INFO L225 Difference]: With dead ends: 2569 [2018-11-10 10:39:58,878 INFO L226 Difference]: Without dead ends: 1331 [2018-11-10 10:39:58,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 354 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:39:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2018-11-10 10:39:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1163. [2018-11-10 10:39:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-11-10 10:39:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1658 transitions. [2018-11-10 10:39:58,945 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1658 transitions. Word has length 181 [2018-11-10 10:39:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:39:58,946 INFO L481 AbstractCegarLoop]: Abstraction has 1163 states and 1658 transitions. [2018-11-10 10:39:58,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 10:39:58,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1658 transitions. [2018-11-10 10:39:58,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 10:39:58,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:39:58,948 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-11-10 10:39:58,949 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:39:58,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:39:58,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1285901395, now seen corresponding path program 1 times [2018-11-10 10:39:58,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:39:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:58,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:39:58,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:39:58,950 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:39:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:39:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:39:59,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:39:59,356 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 10:39:59,356 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 206 with the following transitions: [2018-11-10 10:39:59,357 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], [530], [627], [661], [663], [675], [678], [679], [680], [682] [2018-11-10 10:39:59,365 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 10:39:59,370 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 10:39:59,747 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 10:40:53,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 10:40:53,542 INFO L272 AbstractInterpreter]: Visited 87 different actions 618 times. Merged at 73 different actions 490 times. Widened at 13 different actions 37 times. Found 46 fixpoints after 20 different actions. Largest state had 153 variables. [2018-11-10 10:40:53,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:40:53,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 10:40:53,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:40:53,543 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:40:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:40:53,551 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 10:40:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:40:53,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:40:53,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:40:53,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:40:53,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:40:53,819 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:53,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:40:53,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:53,824 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:53,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:53,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:40:53,829 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,844 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,849 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:32, output treesize:10 [2018-11-10 10:40:53,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:40:53,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:40:53,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-10 10:40:53,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:40:53,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:53,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-10 10:40:53,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:40:53,912 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:40:53,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:40:53,938 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:40:53,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:40:53,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:40:53,962 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:74 [2018-11-10 10:40:53,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-11-10 10:40:53,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-10 10:40:53,995 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:40:54,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:40:54,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-11-10 10:40:54,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 22 treesize of output 21 [2018-11-10 10:40:54,012 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2018-11-10 10:40:54,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-10 10:40:54,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,028 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:63, output treesize:20 [2018-11-10 10:40:54,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 10:40:54,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2018-11-10 10:40:54,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:9 [2018-11-10 10:40:54,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:40:54,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 15 treesize of output 3 [2018-11-10 10:40:54,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,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-11-10 10:40:54,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:40:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:40:54,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:40:54,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 119 [2018-11-10 10:40:54,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 107 [2018-11-10 10:40:54,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:40:54,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:40:54,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 79 [2018-11-10 10:40:54,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:40:54,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,159 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:40:54,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 59 [2018-11-10 10:40:54,180 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:40:54,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 42 [2018-11-10 10:40:54,186 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:40:54,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 33 treesize of output 17 [2018-11-10 10:40:54,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:40:54,200 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:40:54,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2018-11-10 10:40:54,201 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,202 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-10 10:40:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 10:40:54,206 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,207 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:40:54,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-11-10 10:40:54,219 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:125, output treesize:10 [2018-11-10 10:40:54,279 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:40:54,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 10:40:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2018-11-10 10:40:54,298 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 10:40:54,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 10:40:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 10:40:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:40:54,298 INFO L87 Difference]: Start difference. First operand 1163 states and 1658 transitions. Second operand 13 states. [2018-11-10 10:40:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:40:56,099 INFO L93 Difference]: Finished difference Result 6376 states and 9132 transitions. [2018-11-10 10:40:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 10:40:56,099 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 205 [2018-11-10 10:40:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:40:56,107 INFO L225 Difference]: With dead ends: 6376 [2018-11-10 10:40:56,107 INFO L226 Difference]: Without dead ends: 5274 [2018-11-10 10:40:56,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 404 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-10 10:40:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5274 states. [2018-11-10 10:40:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5274 to 2239. [2018-11-10 10:40:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2239 states. [2018-11-10 10:40:56,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2239 states to 2239 states and 3261 transitions. [2018-11-10 10:40:56,256 INFO L78 Accepts]: Start accepts. Automaton has 2239 states and 3261 transitions. Word has length 205 [2018-11-10 10:40:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:40:56,257 INFO L481 AbstractCegarLoop]: Abstraction has 2239 states and 3261 transitions. [2018-11-10 10:40:56,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 10:40:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2239 states and 3261 transitions. [2018-11-10 10:40:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:40:56,259 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:40:56,260 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, 1, 1, 1] [2018-11-10 10:40:56,260 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:40:56,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:40:56,260 INFO L82 PathProgramCache]: Analyzing trace with hash 23711206, now seen corresponding path program 1 times [2018-11-10 10:40:56,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 10:40:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:40:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:40:56,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:40:56,261 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 10:40:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:40:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:40:56,541 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:40:56,561 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,562 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,563 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:40:56,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:40:56 BoogieIcfgContainer [2018-11-10 10:40:56,632 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:40:56,633 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:40:56,633 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:40:56,633 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:40:56,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:39:04" (3/4) ... [2018-11-10 10:40:56,638 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:40:56,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:40:56,639 INFO L168 Benchmark]: Toolchain (without parser) took 114056.69 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 955.0 MB in the beginning and 785.1 MB in the end (delta: 169.9 MB). Peak memory consumption was 4.2 GB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,640 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:40:56,640 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,640 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,641 INFO L168 Benchmark]: Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,641 INFO L168 Benchmark]: RCFGBuilder took 1312.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.3 MB in the end (delta: 163.4 MB). Peak memory consumption was 163.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,641 INFO L168 Benchmark]: TraceAbstraction took 111841.32 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 908.3 MB in the beginning and 785.1 MB in the end (delta: 123.2 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2018-11-10 10:40:56,641 INFO L168 Benchmark]: Witness Printer took 5.62 ms. Allocated memory is still 5.0 GB. Free memory is still 785.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:40:56,643 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -135.9 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1312.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 908.3 MB in the end (delta: 163.4 MB). Peak memory consumption was 163.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 111841.32 ms. Allocated memory was 1.1 GB in the beginning and 5.0 GB in the end (delta: 3.9 GB). Free memory was 908.3 MB in the beginning and 785.1 MB in the end (delta: 123.2 MB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 5.62 ms. Allocated memory is still 5.0 GB. Free memory is still 785.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1762]: 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={24584: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={24584: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={24584: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={24584: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={24584:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24584: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={24584: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={24584:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24584: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 [L1598] CALL, EXPR s->session [L1598] RET, EXPR s->session [L1598] CALL, EXPR s->s3 [L1598] RET, EXPR s->s3 [L1598] CALL, EXPR (s->s3)->tmp.new_cipher [L1598] RET, EXPR (s->s3)->tmp.new_cipher [L1598] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1598] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={24584:0}] [L1609] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={24584:0}] [L1612] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={24584:0}] [L1619] COND FALSE !(ret <= 0) [L1624] CALL s->state = 8672 [L1624] RET s->state = 8672 [L1625] CALL s->init_num = 0 [L1625] RET s->init_num = 0 [L1626] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={24584:0}] [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={24584:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24584: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 [L1635] ret = __VERIFIER_nondet_int() [L1636] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={24584:0}] [L1639] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={24584:0}] [L1642] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={24584:0}] [L1649] COND FALSE !(ret <= 0) [L1654] CALL s->state = 8448 [L1654] RET s->state = 8448 [L1655] CALL s->hit [L1655] RET s->hit [L1655] COND TRUE s->hit [L1656] CALL, EXPR s->s3 [L1656] RET, EXPR s->s3 [L1656] CALL (s->s3)->tmp.next_state = 8640 [L1656] RET (s->s3)->tmp.next_state = 8640 [L1660] CALL s->init_num = 0 [L1660] RET s->init_num = 0 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={24584:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24584: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={24584: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={24584:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={24584: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={24584:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={24584:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={24584:0}] [L1762] __VERIFIER_error() VAL [init=1, SSLv3_server_data={24584:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 1 error locations. UNSAFE Result, 111.7s OverallTime, 37 OverallIterations, 7 TraceHistogramMax, 14.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5996 SDtfs, 7475 SDslu, 12188 SDs, 0 SdLazy, 10708 SolverSat, 1856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 983 GetRequests, 835 SyntacticMatches, 5 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2239occurred in iteration=36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 90.2s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 7749 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 5261 NumberOfCodeBlocks, 5261 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 5396 ConstructedInterpolants, 84 QuantifiedInterpolants, 5059197 SizeOfPredicates, 107 NumberOfNonLiveVariables, 4099 ConjunctsInSsa, 171 ConjunctsInUnsatCore, 40 InterpolantComputations, 34 PerfectInterpolantSequences, 4528/5604 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:40:58,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:40:58,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:40:58,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:40:58,207 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:40:58,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:40:58,208 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:40:58,209 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:40:58,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:40:58,211 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:40:58,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:40:58,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:40:58,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:40:58,214 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:40:58,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:40:58,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:40:58,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:40:58,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:40:58,219 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:40:58,220 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:40:58,221 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:40:58,221 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:40:58,223 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:40:58,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:40:58,224 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:40:58,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:40:58,225 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:40:58,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:40:58,226 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:40:58,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:40:58,227 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:40:58,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:40:58,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:40:58,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:40:58,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:40:58,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:40:58,229 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-10 10:40:58,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:40:58,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:40:58,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 10:40:58,241 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 10:40:58,241 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 10:40:58,241 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 10:40:58,241 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 10:40:58,242 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 10:40:58,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:40:58,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 10:40:58,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 10:40:58,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:40:58,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:40:58,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 10:40:58,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:40:58,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 10:40:58,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 10:40:58,246 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-10 10:40:58,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 10:40:58,246 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-10 10:40:58,246 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-10 10:40:58,246 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_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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 -> 0a7396ffb12cf754f13107d729c5350f83c5ce55 [2018-11-10 10:40:58,277 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:40:58,286 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:40:58,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:40:58,290 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:40:58,290 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:40:58,291 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:40:58,332 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/0fb39741a/d55842cf8a8f40b78e3583cde8aa958f/FLAGd8045bc44 [2018-11-10 10:40:58,727 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:40:58,727 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/sv-benchmarks/c/ssh/s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:40:58,741 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/0fb39741a/d55842cf8a8f40b78e3583cde8aa958f/FLAGd8045bc44 [2018-11-10 10:40:58,754 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/data/0fb39741a/d55842cf8a8f40b78e3583cde8aa958f [2018-11-10 10:40:58,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:40:58,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:40:58,759 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:40:58,759 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:40:58,761 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:40:58,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:40:58" (1/1) ... [2018-11-10 10:40:58,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36796db6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:58, skipping insertion in model container [2018-11-10 10:40:58,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:40:58" (1/1) ... [2018-11-10 10:40:58,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:40:58,815 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:40:59,337 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:40:59,348 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:40:59,549 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:40:59,561 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:40:59,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59 WrapperNode [2018-11-10 10:40:59,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:40:59,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:40:59,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:40:59,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:40:59,630 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:40:59,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:40:59,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:40:59,701 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:40:59,710 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,769 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... [2018-11-10 10:40:59,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:40:59,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:40:59,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:40:59,777 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:40:59,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 10:40:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 10:40:59,827 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 10:40:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-11-10 10:40:59,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-11-10 10:40:59,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 10:40:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 10:40:59,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:40:59,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:41:02,236 WARN L667 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-11-10 10:41:02,236 WARN L632 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-11-10 10:41:03,185 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:41:03,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:41:03 BoogieIcfgContainer [2018-11-10 10:41:03,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:41:03,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 10:41:03,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 10:41:03,189 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 10:41:03,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:40:58" (1/3) ... [2018-11-10 10:41:03,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ac0265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:41:03, skipping insertion in model container [2018-11-10 10:41:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:40:59" (2/3) ... [2018-11-10 10:41:03,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76ac0265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:41:03, skipping insertion in model container [2018-11-10 10:41:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:41:03" (3/3) ... [2018-11-10 10:41:03,193 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16_false-unreach-call.i.cil.c [2018-11-10 10:41:03,201 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 10:41:03,208 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 10:41:03,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 10:41:03,245 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:41:03,245 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 10:41:03,246 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 10:41:03,246 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 10:41:03,246 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:41:03,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:41:03,246 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 10:41:03,247 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:41:03,247 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 10:41:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2018-11-10 10:41:03,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-10 10:41:03,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:03,268 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, 1] [2018-11-10 10:41:03,270 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:03,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1614206060, now seen corresponding path program 1 times [2018-11-10 10:41:03,277 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:03,278 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:03,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:03,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:03,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:03,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:03,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 23 treesize of output 18 [2018-11-10 10:41:03,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:03,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:03,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:03,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:03,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:03,996 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:04,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:04,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:04,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:04,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:04,020 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 6 states. [2018-11-10 10:41:06,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:06,703 INFO L93 Difference]: Finished difference Result 352 states and 593 transitions. [2018-11-10 10:41:06,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:06,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-10 10:41:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:06,716 INFO L225 Difference]: With dead ends: 352 [2018-11-10 10:41:06,716 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 10:41:06,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 10:41:06,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2018-11-10 10:41:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 10:41:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions. [2018-11-10 10:41:06,752 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 50 [2018-11-10 10:41:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:06,752 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 250 transitions. [2018-11-10 10:41:06,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions. [2018-11-10 10:41:06,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-10 10:41:06,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:06,754 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, 1] [2018-11-10 10:41:06,754 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:06,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:06,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1709759664, now seen corresponding path program 1 times [2018-11-10 10:41:06,755 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:06,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:06,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:07,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:07,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 13 treesize of output 10 [2018-11-10 10:41:07,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 10 treesize of output 9 [2018-11-10 10:41:07,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:07,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:07,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:07,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:07,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:07,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:41:07,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:41:07,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,392 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:07,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:41:07,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:07,406 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:07,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:07,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:07,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:07,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:07,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:07,411 INFO L87 Difference]: Start difference. First operand 162 states and 250 transitions. Second operand 6 states. [2018-11-10 10:41:10,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:10,011 INFO L93 Difference]: Finished difference Result 315 states and 484 transitions. [2018-11-10 10:41:10,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:10,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-11-10 10:41:10,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:10,013 INFO L225 Difference]: With dead ends: 315 [2018-11-10 10:41:10,013 INFO L226 Difference]: Without dead ends: 179 [2018-11-10 10:41:10,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-10 10:41:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 162. [2018-11-10 10:41:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-10 10:41:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 249 transitions. [2018-11-10 10:41:10,023 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 249 transitions. Word has length 64 [2018-11-10 10:41:10,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:10,023 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 249 transitions. [2018-11-10 10:41:10,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:10,023 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 249 transitions. [2018-11-10 10:41:10,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:41:10,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:10,025 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-11-10 10:41:10,025 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:10,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:10,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1854016997, now seen corresponding path program 1 times [2018-11-10 10:41:10,026 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:10,026 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:10,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:10,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:10,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:10,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:10,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:10,421 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:10,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:10,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:10,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:10,443 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:10,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:10,451 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:10,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:10,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:10,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:10,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:10,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:10,456 INFO L87 Difference]: Start difference. First operand 162 states and 249 transitions. Second operand 4 states. [2018-11-10 10:41:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:12,895 INFO L93 Difference]: Finished difference Result 328 states and 506 transitions. [2018-11-10 10:41:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:12,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 10:41:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:12,897 INFO L225 Difference]: With dead ends: 328 [2018-11-10 10:41:12,898 INFO L226 Difference]: Without dead ends: 192 [2018-11-10 10:41:12,898 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-11-10 10:41:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-10 10:41:12,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2018-11-10 10:41:12,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-11-10 10:41:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 276 transitions. [2018-11-10 10:41:12,908 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 276 transitions. Word has length 65 [2018-11-10 10:41:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:12,909 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 276 transitions. [2018-11-10 10:41:12,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:12,909 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 276 transitions. [2018-11-10 10:41:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:41:12,910 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:12,910 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-11-10 10:41:12,911 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:12,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:12,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1189718705, now seen corresponding path program 1 times [2018-11-10 10:41:12,912 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:12,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:13,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:13,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 13 treesize of output 10 [2018-11-10 10:41:13,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:13,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:13,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:13,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:13,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:13,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:13,283 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:13,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:13,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:13,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:13,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:13,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:13,286 INFO L87 Difference]: Start difference. First operand 179 states and 276 transitions. Second operand 4 states. [2018-11-10 10:41:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:15,857 INFO L93 Difference]: Finished difference Result 450 states and 701 transitions. [2018-11-10 10:41:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:15,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-11-10 10:41:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:15,859 INFO L225 Difference]: With dead ends: 450 [2018-11-10 10:41:15,859 INFO L226 Difference]: Without dead ends: 297 [2018-11-10 10:41:15,860 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-11-10 10:41:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-11-10 10:41:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 220. [2018-11-10 10:41:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 10:41:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 350 transitions. [2018-11-10 10:41:15,870 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 350 transitions. Word has length 65 [2018-11-10 10:41:15,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:15,870 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 350 transitions. [2018-11-10 10:41:15,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:15,870 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 350 transitions. [2018-11-10 10:41:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-10 10:41:15,871 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:15,871 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, 1] [2018-11-10 10:41:15,871 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:15,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:15,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1010888560, now seen corresponding path program 1 times [2018-11-10 10:41:15,872 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:15,872 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:15,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:16,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:16,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:16,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:16,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:16,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:16,418 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:16,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:16,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,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-11-10 10:41:16,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:16,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:41:16,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:41:16,441 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:16,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:41:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:16,454 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:16,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:16,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:16,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:16,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:16,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:16,459 INFO L87 Difference]: Start difference. First operand 220 states and 350 transitions. Second operand 6 states. [2018-11-10 10:41:18,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:18,934 INFO L93 Difference]: Finished difference Result 429 states and 683 transitions. [2018-11-10 10:41:18,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:18,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-11-10 10:41:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:18,936 INFO L225 Difference]: With dead ends: 429 [2018-11-10 10:41:18,936 INFO L226 Difference]: Without dead ends: 235 [2018-11-10 10:41:18,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-10 10:41:18,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 220. [2018-11-10 10:41:18,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-11-10 10:41:18,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 349 transitions. [2018-11-10 10:41:18,947 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 349 transitions. Word has length 65 [2018-11-10 10:41:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:18,948 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 349 transitions. [2018-11-10 10:41:18,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 349 transitions. [2018-11-10 10:41:18,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:41:18,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:18,949 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, 1] [2018-11-10 10:41:18,949 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash 266477503, now seen corresponding path program 1 times [2018-11-10 10:41:18,951 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:18,951 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:18,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:19,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:19,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-10 10:41:19,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-10 10:41:19,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,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-11-10 10:41:19,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-10 10:41:19,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:19,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:19,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:19,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:19,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:19,571 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:19,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:19,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:19,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:19,597 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:19,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-11-10 10:41:19,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:19,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-10 10:41:19,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:41:19,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:19,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:5 [2018-11-10 10:41:19,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:19,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:19,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:19,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-10 10:41:19,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-10 10:41:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-10 10:41:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:19,645 INFO L87 Difference]: Start difference. First operand 220 states and 349 transitions. Second operand 8 states. [2018-11-10 10:41:22,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:22,535 INFO L93 Difference]: Finished difference Result 423 states and 675 transitions. [2018-11-10 10:41:22,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 10:41:22,536 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2018-11-10 10:41:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:22,537 INFO L225 Difference]: With dead ends: 423 [2018-11-10 10:41:22,537 INFO L226 Difference]: Without dead ends: 229 [2018-11-10 10:41:22,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-10 10:41:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-10 10:41:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-11-10 10:41:22,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-10 10:41:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 360 transitions. [2018-11-10 10:41:22,552 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 360 transitions. Word has length 66 [2018-11-10 10:41:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:22,552 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 360 transitions. [2018-11-10 10:41:22,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-10 10:41:22,552 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 360 transitions. [2018-11-10 10:41:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:41:22,553 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:22,553 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, 1] [2018-11-10 10:41:22,554 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:22,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:22,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1104488275, now seen corresponding path program 1 times [2018-11-10 10:41:22,555 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:22,555 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:23,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:23,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:23,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:23,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:23,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:23,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:23,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:23,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,165 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:23,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:23,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:23,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:23,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:41:23,182 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:23,182 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:23,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:23,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:23,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:23,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:23,185 INFO L87 Difference]: Start difference. First operand 229 states and 360 transitions. Second operand 6 states. [2018-11-10 10:41:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:25,763 INFO L93 Difference]: Finished difference Result 456 states and 715 transitions. [2018-11-10 10:41:25,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:25,764 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-11-10 10:41:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:25,765 INFO L225 Difference]: With dead ends: 456 [2018-11-10 10:41:25,765 INFO L226 Difference]: Without dead ends: 253 [2018-11-10 10:41:25,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-10 10:41:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 229. [2018-11-10 10:41:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-11-10 10:41:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 359 transitions. [2018-11-10 10:41:25,773 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 359 transitions. Word has length 66 [2018-11-10 10:41:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:25,773 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 359 transitions. [2018-11-10 10:41:25,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 359 transitions. [2018-11-10 10:41:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-10 10:41:25,774 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:25,774 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, 1] [2018-11-10 10:41:25,774 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1379961340, now seen corresponding path program 1 times [2018-11-10 10:41:25,775 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:25,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:25,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:26,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:26,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:26,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:26,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:26,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 19 treesize of output 15 [2018-11-10 10:41:26,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:26,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:26,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:26,089 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:26,090 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:26,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:26,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:26,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:26,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:26,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:26,093 INFO L87 Difference]: Start difference. First operand 229 states and 359 transitions. Second operand 4 states. [2018-11-10 10:41:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:28,722 INFO L93 Difference]: Finished difference Result 510 states and 794 transitions. [2018-11-10 10:41:28,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:28,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-11-10 10:41:28,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:28,724 INFO L225 Difference]: With dead ends: 510 [2018-11-10 10:41:28,724 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 10:41:28,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:41:28,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 10:41:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 230. [2018-11-10 10:41:28,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 10:41:28,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 360 transitions. [2018-11-10 10:41:28,734 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 360 transitions. Word has length 66 [2018-11-10 10:41:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:28,734 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 360 transitions. [2018-11-10 10:41:28,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 360 transitions. [2018-11-10 10:41:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-10 10:41:28,735 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:28,735 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, 1] [2018-11-10 10:41:28,735 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:28,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash -269815245, now seen corresponding path program 1 times [2018-11-10 10:41:28,736 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:28,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:29,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:29,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:29,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:29,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:29,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:29,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:29,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:29,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:29,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:29,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-11-10 10:41:29,374 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:29,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-11-10 10:41:29,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:41:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:29,388 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:29,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:29,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:29,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:29,392 INFO L87 Difference]: Start difference. First operand 230 states and 360 transitions. Second operand 6 states. [2018-11-10 10:41:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:32,239 INFO L93 Difference]: Finished difference Result 458 states and 716 transitions. [2018-11-10 10:41:32,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:32,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-11-10 10:41:32,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:32,241 INFO L225 Difference]: With dead ends: 458 [2018-11-10 10:41:32,242 INFO L226 Difference]: Without dead ends: 254 [2018-11-10 10:41:32,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-11-10 10:41:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 230. [2018-11-10 10:41:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-10 10:41:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 359 transitions. [2018-11-10 10:41:32,252 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 359 transitions. Word has length 67 [2018-11-10 10:41:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:32,252 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 359 transitions. [2018-11-10 10:41:32,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 359 transitions. [2018-11-10 10:41:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 10:41:32,253 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:32,253 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, 1] [2018-11-10 10:41:32,253 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:32,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:32,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1866545881, now seen corresponding path program 1 times [2018-11-10 10:41:32,254 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:32,254 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:32,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:32,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:32,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 18 treesize of output 15 [2018-11-10 10:41:32,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:41:32,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:32,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:32,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:32,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:32,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:32,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:32,814 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:41:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:32,843 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:32,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:32,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:41:32,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:41:32,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:41:32,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:41:32,846 INFO L87 Difference]: Start difference. First operand 230 states and 359 transitions. Second operand 7 states. [2018-11-10 10:41:37,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:37,771 INFO L93 Difference]: Finished difference Result 487 states and 763 transitions. [2018-11-10 10:41:37,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:41:37,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-11-10 10:41:37,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:37,773 INFO L225 Difference]: With dead ends: 487 [2018-11-10 10:41:37,773 INFO L226 Difference]: Without dead ends: 283 [2018-11-10 10:41:37,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:41:37,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-11-10 10:41:37,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 253. [2018-11-10 10:41:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 398 transitions. [2018-11-10 10:41:37,783 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 398 transitions. Word has length 68 [2018-11-10 10:41:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:37,783 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 398 transitions. [2018-11-10 10:41:37,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:41:37,783 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 398 transitions. [2018-11-10 10:41:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-10 10:41:37,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:37,784 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, 1] [2018-11-10 10:41:37,784 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:37,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 37651800, now seen corresponding path program 1 times [2018-11-10 10:41:37,785 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:37,785 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:37,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:38,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:38,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:38,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:38,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:38,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:38,365 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:38,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:38,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:38,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 19 treesize of output 15 [2018-11-10 10:41:38,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 15 treesize of output 3 [2018-11-10 10:41:38,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:38,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:41:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:38,405 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:38,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:38,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:38,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:38,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:38,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:38,408 INFO L87 Difference]: Start difference. First operand 253 states and 398 transitions. Second operand 6 states. [2018-11-10 10:41:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:40,997 INFO L93 Difference]: Finished difference Result 504 states and 793 transitions. [2018-11-10 10:41:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:40,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-10 10:41:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:40,998 INFO L225 Difference]: With dead ends: 504 [2018-11-10 10:41:40,998 INFO L226 Difference]: Without dead ends: 277 [2018-11-10 10:41:40,999 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-11-10 10:41:40,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-11-10 10:41:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 253. [2018-11-10 10:41:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 397 transitions. [2018-11-10 10:41:41,008 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 397 transitions. Word has length 68 [2018-11-10 10:41:41,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:41,008 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 397 transitions. [2018-11-10 10:41:41,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:41,008 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 397 transitions. [2018-11-10 10:41:41,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-10 10:41:41,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:41,009 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, 1] [2018-11-10 10:41:41,009 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:41,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:41,009 INFO L82 PathProgramCache]: Analyzing trace with hash 940398808, now seen corresponding path program 1 times [2018-11-10 10:41:41,010 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:41,010 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:41,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:41,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:41,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:41,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:41,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:41,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:41:41,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:41,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:41,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:41,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:41,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:41,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:41,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:41:41,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:41,686 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:41,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:41,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:41,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:41,690 INFO L87 Difference]: Start difference. First operand 253 states and 397 transitions. Second operand 6 states. [2018-11-10 10:41:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:44,255 INFO L93 Difference]: Finished difference Result 494 states and 779 transitions. [2018-11-10 10:41:44,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:44,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-11-10 10:41:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:44,256 INFO L225 Difference]: With dead ends: 494 [2018-11-10 10:41:44,257 INFO L226 Difference]: Without dead ends: 267 [2018-11-10 10:41:44,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-10 10:41:44,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2018-11-10 10:41:44,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:44,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 396 transitions. [2018-11-10 10:41:44,266 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 396 transitions. Word has length 69 [2018-11-10 10:41:44,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:44,267 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 396 transitions. [2018-11-10 10:41:44,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:44,267 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 396 transitions. [2018-11-10 10:41:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:41:44,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:44,268 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, 1] [2018-11-10 10:41:44,268 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:44,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:44,268 INFO L82 PathProgramCache]: Analyzing trace with hash -886758721, now seen corresponding path program 1 times [2018-11-10 10:41:44,269 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:44,269 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:44,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:44,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:44,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:44,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:41:44,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 23 treesize of output 18 [2018-11-10 10:41:44,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:41:44,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:41:44,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:44,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:41:44,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:44,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-11-10 10:41:44,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:45,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:45,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-11-10 10:41:45,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:41:45,022 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:41:45,022 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:45,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:45,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 10:41:45,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 10:41:45,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 10:41:45,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 10:41:45,026 INFO L87 Difference]: Start difference. First operand 253 states and 396 transitions. Second operand 6 states. [2018-11-10 10:41:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:47,542 INFO L93 Difference]: Finished difference Result 484 states and 766 transitions. [2018-11-10 10:41:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 10:41:47,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-11-10 10:41:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:47,543 INFO L225 Difference]: With dead ends: 484 [2018-11-10 10:41:47,543 INFO L226 Difference]: Without dead ends: 257 [2018-11-10 10:41:47,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-10 10:41:47,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-11-10 10:41:47,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2018-11-10 10:41:47,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:47,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 395 transitions. [2018-11-10 10:41:47,550 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 395 transitions. Word has length 79 [2018-11-10 10:41:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:47,551 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 395 transitions. [2018-11-10 10:41:47,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 10:41:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 395 transitions. [2018-11-10 10:41:47,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-10 10:41:47,551 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:47,552 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, 1] [2018-11-10 10:41:47,552 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:47,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:47,552 INFO L82 PathProgramCache]: Analyzing trace with hash -479864077, now seen corresponding path program 1 times [2018-11-10 10:41:47,552 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:47,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:47,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:47,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:47,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:47,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:47,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:47,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:47,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:47,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:47,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:47,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:47,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:47,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:47,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:47,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:47,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:47,947 INFO L87 Difference]: Start difference. First operand 253 states and 395 transitions. Second operand 4 states. [2018-11-10 10:41:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:50,488 INFO L93 Difference]: Finished difference Result 557 states and 868 transitions. [2018-11-10 10:41:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:50,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-11-10 10:41:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:50,489 INFO L225 Difference]: With dead ends: 557 [2018-11-10 10:41:50,489 INFO L226 Difference]: Without dead ends: 330 [2018-11-10 10:41:50,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:41:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-11-10 10:41:50,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 253. [2018-11-10 10:41:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 394 transitions. [2018-11-10 10:41:50,496 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 394 transitions. Word has length 79 [2018-11-10 10:41:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:50,496 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 394 transitions. [2018-11-10 10:41:50,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 394 transitions. [2018-11-10 10:41:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-10 10:41:50,497 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:50,497 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, 1] [2018-11-10 10:41:50,497 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:50,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash 482946093, now seen corresponding path program 1 times [2018-11-10 10:41:50,498 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:50,498 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:50,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:50,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:50,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:50,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:50,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:50,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:50,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:50,854 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:50,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:50,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:50,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:50,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:50,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:50,868 INFO L87 Difference]: Start difference. First operand 253 states and 394 transitions. Second operand 4 states. [2018-11-10 10:41:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:53,421 INFO L93 Difference]: Finished difference Result 555 states and 864 transitions. [2018-11-10 10:41:53,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:53,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-11-10 10:41:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:53,423 INFO L225 Difference]: With dead ends: 555 [2018-11-10 10:41:53,423 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 10:41:53,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:41:53,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 10:41:53,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 253. [2018-11-10 10:41:53,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 393 transitions. [2018-11-10 10:41:53,431 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 393 transitions. Word has length 80 [2018-11-10 10:41:53,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:53,431 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 393 transitions. [2018-11-10 10:41:53,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:53,431 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 393 transitions. [2018-11-10 10:41:53,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-10 10:41:53,432 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:53,432 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, 1] [2018-11-10 10:41:53,432 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:53,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1918140982, now seen corresponding path program 1 times [2018-11-10 10:41:53,433 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:53,433 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:53,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:53,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:53,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:53,776 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:53,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:53,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 15 treesize of output 3 [2018-11-10 10:41:53,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:53,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:53,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:53,796 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:53,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:53,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:53,799 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:53,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:53,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:53,799 INFO L87 Difference]: Start difference. First operand 253 states and 393 transitions. Second operand 4 states. [2018-11-10 10:41:56,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:56,349 INFO L93 Difference]: Finished difference Result 555 states and 862 transitions. [2018-11-10 10:41:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:56,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-11-10 10:41:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:56,350 INFO L225 Difference]: With dead ends: 555 [2018-11-10 10:41:56,350 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 10:41:56,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:41:56,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 10:41:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 253. [2018-11-10 10:41:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:56,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 392 transitions. [2018-11-10 10:41:56,361 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 392 transitions. Word has length 81 [2018-11-10 10:41:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:56,362 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 392 transitions. [2018-11-10 10:41:56,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 392 transitions. [2018-11-10 10:41:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:41:56,362 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:56,363 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, 1] [2018-11-10 10:41:56,363 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:56,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:56,363 INFO L82 PathProgramCache]: Analyzing trace with hash -816385104, now seen corresponding path program 1 times [2018-11-10 10:41:56,363 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:56,364 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:56,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:56,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:41:56,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:41:56,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:41:56,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:41:56,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:41:56,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:41:56,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:41:56,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:41:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:41:56,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:41:56,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:41:56,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:41:56,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:41:56,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:41:56,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:41:56,748 INFO L87 Difference]: Start difference. First operand 253 states and 392 transitions. Second operand 4 states. [2018-11-10 10:41:59,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:41:59,331 INFO L93 Difference]: Finished difference Result 555 states and 860 transitions. [2018-11-10 10:41:59,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:41:59,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-11-10 10:41:59,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:41:59,332 INFO L225 Difference]: With dead ends: 555 [2018-11-10 10:41:59,332 INFO L226 Difference]: Without dead ends: 328 [2018-11-10 10:41:59,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:41:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-11-10 10:41:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 253. [2018-11-10 10:41:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-11-10 10:41:59,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 391 transitions. [2018-11-10 10:41:59,340 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 391 transitions. Word has length 82 [2018-11-10 10:41:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:41:59,340 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 391 transitions. [2018-11-10 10:41:59,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:41:59,341 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 391 transitions. [2018-11-10 10:41:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-10 10:41:59,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:41:59,341 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, 1] [2018-11-10 10:41:59,341 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:41:59,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:41:59,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1046693629, now seen corresponding path program 1 times [2018-11-10 10:41:59,342 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:41:59,342 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:41:59,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:41:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:41:59,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:00,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:00,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:42:00,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:00,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-11-10 10:42:00,040 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,045 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:00,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:42:00,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:42:00,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:42:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:00,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:42:00,107 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:42:00,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:00,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:42:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:00,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:42:00,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:42:00,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:42:00,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:42:00,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:42:00,118 INFO L87 Difference]: Start difference. First operand 253 states and 391 transitions. Second operand 9 states. [2018-11-10 10:42:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:05,133 INFO L93 Difference]: Finished difference Result 650 states and 1008 transitions. [2018-11-10 10:42:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:42:05,133 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2018-11-10 10:42:05,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:05,134 INFO L225 Difference]: With dead ends: 650 [2018-11-10 10:42:05,134 INFO L226 Difference]: Without dead ends: 423 [2018-11-10 10:42:05,135 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:42:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-11-10 10:42:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 270. [2018-11-10 10:42:05,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-10 10:42:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 417 transitions. [2018-11-10 10:42:05,148 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 417 transitions. Word has length 82 [2018-11-10 10:42:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:05,148 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 417 transitions. [2018-11-10 10:42:05,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:42:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 417 transitions. [2018-11-10 10:42:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:42:05,149 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:05,149 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, 1] [2018-11-10 10:42:05,149 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash 273855355, now seen corresponding path program 1 times [2018-11-10 10:42:05,150 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:05,150 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:05,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:05,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:05,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:05,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:05,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:05,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:05,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:05,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:05,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:05,536 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:05,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:05,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:05,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:05,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:05,539 INFO L87 Difference]: Start difference. First operand 270 states and 417 transitions. Second operand 4 states. [2018-11-10 10:42:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:08,139 INFO L93 Difference]: Finished difference Result 589 states and 910 transitions. [2018-11-10 10:42:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:08,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-11-10 10:42:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:08,141 INFO L225 Difference]: With dead ends: 589 [2018-11-10 10:42:08,141 INFO L226 Difference]: Without dead ends: 345 [2018-11-10 10:42:08,141 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-11-10 10:42:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-11-10 10:42:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 270. [2018-11-10 10:42:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-11-10 10:42:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 416 transitions. [2018-11-10 10:42:08,154 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 416 transitions. Word has length 83 [2018-11-10 10:42:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:08,154 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 416 transitions. [2018-11-10 10:42:08,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:08,155 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 416 transitions. [2018-11-10 10:42:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-10 10:42:08,155 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:08,155 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, 1] [2018-11-10 10:42:08,156 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:08,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 561594723, now seen corresponding path program 1 times [2018-11-10 10:42:08,156 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:08,156 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:08,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:08,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:08,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:08,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:42:08,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:08,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:08,835 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,840 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:08,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:42:08,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:42:08,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:42:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:08,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:42:08,909 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:42:08,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:08,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:42:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:08,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:42:08,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:42:08,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:42:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:42:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:42:08,923 INFO L87 Difference]: Start difference. First operand 270 states and 416 transitions. Second operand 9 states. [2018-11-10 10:42:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:11,921 INFO L93 Difference]: Finished difference Result 665 states and 1028 transitions. [2018-11-10 10:42:11,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:42:11,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 83 [2018-11-10 10:42:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:11,922 INFO L225 Difference]: With dead ends: 665 [2018-11-10 10:42:11,922 INFO L226 Difference]: Without dead ends: 421 [2018-11-10 10:42:11,923 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:42:11,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-11-10 10:42:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 271. [2018-11-10 10:42:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2018-11-10 10:42:11,933 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 416 transitions. Word has length 83 [2018-11-10 10:42:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:11,933 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 416 transitions. [2018-11-10 10:42:11,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:42:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2018-11-10 10:42:11,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:42:11,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:11,934 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, 1] [2018-11-10 10:42:11,934 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:11,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:11,934 INFO L82 PathProgramCache]: Analyzing trace with hash -327225579, now seen corresponding path program 1 times [2018-11-10 10:42:11,935 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:11,935 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:11,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:12,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:12,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:12,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:12,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:12,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-11-10 10:42:12,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:12,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:12,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:12,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:12,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:12,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:12,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:12,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:12,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:12,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:12,374 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand 4 states. [2018-11-10 10:42:14,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:14,916 INFO L93 Difference]: Finished difference Result 581 states and 895 transitions. [2018-11-10 10:42:14,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:14,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-11-10 10:42:14,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:14,917 INFO L225 Difference]: With dead ends: 581 [2018-11-10 10:42:14,917 INFO L226 Difference]: Without dead ends: 336 [2018-11-10 10:42:14,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:42:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-11-10 10:42:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 271. [2018-11-10 10:42:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 415 transitions. [2018-11-10 10:42:14,931 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 415 transitions. Word has length 84 [2018-11-10 10:42:14,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:14,932 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 415 transitions. [2018-11-10 10:42:14,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 415 transitions. [2018-11-10 10:42:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 10:42:14,932 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:14,933 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, 1] [2018-11-10 10:42:14,933 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash 61281216, now seen corresponding path program 1 times [2018-11-10 10:42:14,933 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:14,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:15,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:15,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:42:15,614 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:15,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:15,616 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:15,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:15,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:15,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:15,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:42:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:15,671 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:15,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:15,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:15,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:15,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:15,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:15,675 INFO L87 Difference]: Start difference. First operand 271 states and 415 transitions. Second operand 7 states. [2018-11-10 10:42:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:18,408 INFO L93 Difference]: Finished difference Result 544 states and 836 transitions. [2018-11-10 10:42:18,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:18,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-11-10 10:42:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:18,410 INFO L225 Difference]: With dead ends: 544 [2018-11-10 10:42:18,410 INFO L226 Difference]: Without dead ends: 299 [2018-11-10 10:42:18,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:42:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-10 10:42:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 271. [2018-11-10 10:42:18,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:18,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 414 transitions. [2018-11-10 10:42:18,425 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 414 transitions. Word has length 84 [2018-11-10 10:42:18,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:18,425 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 414 transitions. [2018-11-10 10:42:18,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 414 transitions. [2018-11-10 10:42:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-10 10:42:18,426 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:18,426 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, 1] [2018-11-10 10:42:18,426 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:18,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:18,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1750504294, now seen corresponding path program 1 times [2018-11-10 10:42:18,427 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:18,427 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:18,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:19,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:19,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:19,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:42:19,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:19,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:19,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,162 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:19,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:19,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:19,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:19,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-11-10 10:42:19,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:42:19,207 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:19,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:19,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:19,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:19,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:19,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:19,211 INFO L87 Difference]: Start difference. First operand 271 states and 414 transitions. Second operand 7 states. [2018-11-10 10:42:21,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:21,924 INFO L93 Difference]: Finished difference Result 544 states and 834 transitions. [2018-11-10 10:42:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:21,925 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 85 [2018-11-10 10:42:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:21,925 INFO L225 Difference]: With dead ends: 544 [2018-11-10 10:42:21,925 INFO L226 Difference]: Without dead ends: 299 [2018-11-10 10:42:21,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:42:21,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-10 10:42:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 271. [2018-11-10 10:42:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:21,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 413 transitions. [2018-11-10 10:42:21,934 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 413 transitions. Word has length 85 [2018-11-10 10:42:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:21,935 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 413 transitions. [2018-11-10 10:42:21,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:21,935 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 413 transitions. [2018-11-10 10:42:21,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-10 10:42:21,935 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:21,936 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, 1] [2018-11-10 10:42:21,936 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:21,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:21,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1756951931, now seen corresponding path program 1 times [2018-11-10 10:42:21,936 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:21,936 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:21,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:22,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:22,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:22,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:42:22,658 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:22,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:22,660 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:22,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:22,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:22,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:22,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:42:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:22,704 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:22,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:22,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:22,707 INFO L87 Difference]: Start difference. First operand 271 states and 413 transitions. Second operand 7 states. [2018-11-10 10:42:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:25,442 INFO L93 Difference]: Finished difference Result 544 states and 832 transitions. [2018-11-10 10:42:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:25,442 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2018-11-10 10:42:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:25,443 INFO L225 Difference]: With dead ends: 544 [2018-11-10 10:42:25,443 INFO L226 Difference]: Without dead ends: 299 [2018-11-10 10:42:25,444 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-11-10 10:42:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-10 10:42:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 271. [2018-11-10 10:42:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 412 transitions. [2018-11-10 10:42:25,452 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 412 transitions. Word has length 86 [2018-11-10 10:42:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:25,452 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 412 transitions. [2018-11-10 10:42:25,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 412 transitions. [2018-11-10 10:42:25,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-10 10:42:25,453 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:25,453 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, 1] [2018-11-10 10:42:25,453 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:25,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:25,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1142257995, now seen corresponding path program 1 times [2018-11-10 10:42:25,454 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:25,454 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:25,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:26,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:26,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:42:26,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-11-10 10:42:26,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:26,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:26,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,176 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:42:26,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:26,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:26,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:26,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:42:26,202 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:26,202 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:26,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:26,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:26,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:26,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:26,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:26,206 INFO L87 Difference]: Start difference. First operand 271 states and 412 transitions. Second operand 7 states. [2018-11-10 10:42:28,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:28,938 INFO L93 Difference]: Finished difference Result 534 states and 817 transitions. [2018-11-10 10:42:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:28,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 87 [2018-11-10 10:42:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:28,939 INFO L225 Difference]: With dead ends: 534 [2018-11-10 10:42:28,939 INFO L226 Difference]: Without dead ends: 289 [2018-11-10 10:42:28,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:42:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-11-10 10:42:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 271. [2018-11-10 10:42:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-11-10 10:42:28,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2018-11-10 10:42:28,947 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 87 [2018-11-10 10:42:28,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:28,947 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2018-11-10 10:42:28,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:28,948 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2018-11-10 10:42:28,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 10:42:28,948 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:28,948 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, 1] [2018-11-10 10:42:28,948 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:28,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1283537155, now seen corresponding path program 1 times [2018-11-10 10:42:28,949 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:28,949 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:28,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:29,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-10 10:42:29,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:29,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:29,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:42:29,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:42:29,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:42:29,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:42:29,055 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 3 states. [2018-11-10 10:42:29,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:29,116 INFO L93 Difference]: Finished difference Result 733 states and 1134 transitions. [2018-11-10 10:42:29,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:42:29,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-11-10 10:42:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:29,117 INFO L225 Difference]: With dead ends: 733 [2018-11-10 10:42:29,117 INFO L226 Difference]: Without dead ends: 488 [2018-11-10 10:42:29,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:42:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-11-10 10:42:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2018-11-10 10:42:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 734 transitions. [2018-11-10 10:42:29,133 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 734 transitions. Word has length 88 [2018-11-10 10:42:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:29,133 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 734 transitions. [2018-11-10 10:42:29,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:42:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 734 transitions. [2018-11-10 10:42:29,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 10:42:29,134 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:29,134 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, 1] [2018-11-10 10:42:29,134 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:29,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:29,135 INFO L82 PathProgramCache]: Analyzing trace with hash 962042299, now seen corresponding path program 1 times [2018-11-10 10:42:29,135 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:29,135 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:29,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:29,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:29,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-11-10 10:42:29,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:29,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:29,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:29,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:29,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:29,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:29,544 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:29,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:29,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:29,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:29,547 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:29,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:29,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:29,548 INFO L87 Difference]: Start difference. First operand 486 states and 734 transitions. Second operand 4 states. [2018-11-10 10:42:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:32,175 INFO L93 Difference]: Finished difference Result 1075 states and 1610 transitions. [2018-11-10 10:42:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:32,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-10 10:42:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:32,177 INFO L225 Difference]: With dead ends: 1075 [2018-11-10 10:42:32,177 INFO L226 Difference]: Without dead ends: 615 [2018-11-10 10:42:32,178 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-11-10 10:42:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-10 10:42:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 486. [2018-11-10 10:42:32,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 732 transitions. [2018-11-10 10:42:32,206 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 732 transitions. Word has length 88 [2018-11-10 10:42:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:32,206 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 732 transitions. [2018-11-10 10:42:32,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 732 transitions. [2018-11-10 10:42:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-10 10:42:32,207 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:32,207 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, 1] [2018-11-10 10:42:32,207 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:32,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:32,207 INFO L82 PathProgramCache]: Analyzing trace with hash -227553297, now seen corresponding path program 1 times [2018-11-10 10:42:32,208 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:32,208 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:32,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:32,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:32,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:32,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:32,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:32,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:32,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:32,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:32,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:32,608 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:32,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:32,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:32,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:32,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:32,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:32,611 INFO L87 Difference]: Start difference. First operand 486 states and 732 transitions. Second operand 4 states. [2018-11-10 10:42:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:35,171 INFO L93 Difference]: Finished difference Result 1075 states and 1606 transitions. [2018-11-10 10:42:35,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:35,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-11-10 10:42:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:35,173 INFO L225 Difference]: With dead ends: 1075 [2018-11-10 10:42:35,173 INFO L226 Difference]: Without dead ends: 615 [2018-11-10 10:42:35,174 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-11-10 10:42:35,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-11-10 10:42:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 486. [2018-11-10 10:42:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:35,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 730 transitions. [2018-11-10 10:42:35,202 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 730 transitions. Word has length 88 [2018-11-10 10:42:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:35,203 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 730 transitions. [2018-11-10 10:42:35,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:35,203 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 730 transitions. [2018-11-10 10:42:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:42:35,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:35,204 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, 1] [2018-11-10 10:42:35,204 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:35,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2010608671, now seen corresponding path program 1 times [2018-11-10 10:42:35,204 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:35,204 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:35,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:35,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:35,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:35,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:35,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:35,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:35,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:35,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:35,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:35,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:35,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:35,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:35,635 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:35,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:35,636 INFO L87 Difference]: Start difference. First operand 486 states and 730 transitions. Second operand 4 states. [2018-11-10 10:42:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:38,194 INFO L93 Difference]: Finished difference Result 1067 states and 1591 transitions. [2018-11-10 10:42:38,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:38,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-10 10:42:38,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:38,195 INFO L225 Difference]: With dead ends: 1067 [2018-11-10 10:42:38,195 INFO L226 Difference]: Without dead ends: 607 [2018-11-10 10:42:38,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:42:38,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-11-10 10:42:38,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 486. [2018-11-10 10:42:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 728 transitions. [2018-11-10 10:42:38,218 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 728 transitions. Word has length 89 [2018-11-10 10:42:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:38,218 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 728 transitions. [2018-11-10 10:42:38,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 728 transitions. [2018-11-10 10:42:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-10 10:42:38,219 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:38,219 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, 1] [2018-11-10 10:42:38,219 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:38,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash 352492917, now seen corresponding path program 1 times [2018-11-10 10:42:38,220 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:38,220 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:38,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:38,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:38,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:38,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:38,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:38,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:38,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-11-10 10:42:38,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:38,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:38,627 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:38,627 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:38,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:38,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:38,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:38,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:38,630 INFO L87 Difference]: Start difference. First operand 486 states and 728 transitions. Second operand 4 states. [2018-11-10 10:42:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:41,171 INFO L93 Difference]: Finished difference Result 1057 states and 1574 transitions. [2018-11-10 10:42:41,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:41,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2018-11-10 10:42:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:41,173 INFO L225 Difference]: With dead ends: 1057 [2018-11-10 10:42:41,173 INFO L226 Difference]: Without dead ends: 597 [2018-11-10 10:42:41,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:42:41,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-10 10:42:41,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 486. [2018-11-10 10:42:41,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 726 transitions. [2018-11-10 10:42:41,190 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 726 transitions. Word has length 89 [2018-11-10 10:42:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:41,190 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 726 transitions. [2018-11-10 10:42:41,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:41,190 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 726 transitions. [2018-11-10 10:42:41,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:42:41,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:41,191 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, 1] [2018-11-10 10:42:41,191 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:41,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:41,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1810138038, now seen corresponding path program 1 times [2018-11-10 10:42:41,192 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:41,192 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:41,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:41,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:41,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:41,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:41,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:41,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:41,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:41,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:41,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:41,605 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:41,605 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:41,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:41,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:41,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:41,608 INFO L87 Difference]: Start difference. First operand 486 states and 726 transitions. Second operand 4 states. [2018-11-10 10:42:44,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:44,150 INFO L93 Difference]: Finished difference Result 1057 states and 1570 transitions. [2018-11-10 10:42:44,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:44,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-11-10 10:42:44,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:44,153 INFO L225 Difference]: With dead ends: 1057 [2018-11-10 10:42:44,153 INFO L226 Difference]: Without dead ends: 597 [2018-11-10 10:42:44,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:42:44,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-11-10 10:42:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 486. [2018-11-10 10:42:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-11-10 10:42:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 724 transitions. [2018-11-10 10:42:44,172 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 724 transitions. Word has length 91 [2018-11-10 10:42:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:44,173 INFO L481 AbstractCegarLoop]: Abstraction has 486 states and 724 transitions. [2018-11-10 10:42:44,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:44,173 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 724 transitions. [2018-11-10 10:42:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:42:44,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:44,173 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-11-10 10:42:44,173 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:44,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:44,174 INFO L82 PathProgramCache]: Analyzing trace with hash -340179405, now seen corresponding path program 1 times [2018-11-10 10:42:44,174 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:44,174 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:44,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:44,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:44,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:44,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:44,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:42:44,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:42:44,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:44,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:44,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:42:44,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:42:44,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:42:44,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:44,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-11-10 10:42:44,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:42:44,918 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:42:44,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:44,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:44,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:44,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:44,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:44,922 INFO L87 Difference]: Start difference. First operand 486 states and 724 transitions. Second operand 7 states. [2018-11-10 10:42:47,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:47,914 INFO L93 Difference]: Finished difference Result 980 states and 1467 transitions. [2018-11-10 10:42:47,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:47,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 10:42:47,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:47,916 INFO L225 Difference]: With dead ends: 980 [2018-11-10 10:42:47,916 INFO L226 Difference]: Without dead ends: 731 [2018-11-10 10:42:47,917 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-11-10 10:42:47,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-11-10 10:42:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 568. [2018-11-10 10:42:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-11-10 10:42:47,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 868 transitions. [2018-11-10 10:42:47,948 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 868 transitions. Word has length 91 [2018-11-10 10:42:47,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:47,948 INFO L481 AbstractCegarLoop]: Abstraction has 568 states and 868 transitions. [2018-11-10 10:42:47,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:47,948 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 868 transitions. [2018-11-10 10:42:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-10 10:42:47,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:47,949 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-11-10 10:42:47,949 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:47,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:47,949 INFO L82 PathProgramCache]: Analyzing trace with hash -92032911, now seen corresponding path program 1 times [2018-11-10 10:42:47,950 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:47,950 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:48,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:48,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:48,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:48,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:42:48,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:42:48,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:48,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:48,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:48,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:42:48,715 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:42:48,716 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:48,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:48,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:48,719 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:48,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:48,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:48,719 INFO L87 Difference]: Start difference. First operand 568 states and 868 transitions. Second operand 7 states. [2018-11-10 10:42:51,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:51,378 INFO L93 Difference]: Finished difference Result 1225 states and 1872 transitions. [2018-11-10 10:42:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:51,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-11-10 10:42:51,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:51,380 INFO L225 Difference]: With dead ends: 1225 [2018-11-10 10:42:51,380 INFO L226 Difference]: Without dead ends: 683 [2018-11-10 10:42:51,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:42:51,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-11-10 10:42:51,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 618. [2018-11-10 10:42:51,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 10:42:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 950 transitions. [2018-11-10 10:42:51,401 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 950 transitions. Word has length 91 [2018-11-10 10:42:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:51,402 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 950 transitions. [2018-11-10 10:42:51,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 950 transitions. [2018-11-10 10:42:51,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 10:42:51,403 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:51,403 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, 1] [2018-11-10 10:42:51,403 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:51,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:51,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1294054992, now seen corresponding path program 1 times [2018-11-10 10:42:51,404 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:51,404 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:51,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:51,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:51,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:51,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-11-10 10:42:51,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:51,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:51,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:51,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:51,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:51,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:51,838 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:51,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:51,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:51,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:51,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:51,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:51,841 INFO L87 Difference]: Start difference. First operand 618 states and 950 transitions. Second operand 4 states. [2018-11-10 10:42:54,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:54,355 INFO L93 Difference]: Finished difference Result 1305 states and 1992 transitions. [2018-11-10 10:42:54,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:42:54,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-11-10 10:42:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:54,357 INFO L225 Difference]: With dead ends: 1305 [2018-11-10 10:42:54,357 INFO L226 Difference]: Without dead ends: 713 [2018-11-10 10:42:54,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:42:54,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-11-10 10:42:54,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 618. [2018-11-10 10:42:54,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-10 10:42:54,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 948 transitions. [2018-11-10 10:42:54,377 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 948 transitions. Word has length 92 [2018-11-10 10:42:54,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:54,377 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 948 transitions. [2018-11-10 10:42:54,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:42:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 948 transitions. [2018-11-10 10:42:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-10 10:42:54,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:54,378 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, 1] [2018-11-10 10:42:54,378 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:54,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:54,378 INFO L82 PathProgramCache]: Analyzing trace with hash -814046816, now seen corresponding path program 1 times [2018-11-10 10:42:54,379 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:54,379 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:54,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:55,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:55,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:55,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:55,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:42:55,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:42:55,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:42:55,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:42:55,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:42:55,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:42:55,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-11-10 10:42:55,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:55,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:42:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:42:55,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:55,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:55,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:42:55,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:42:55,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:42:55,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:42:55,152 INFO L87 Difference]: Start difference. First operand 618 states and 948 transitions. Second operand 7 states. [2018-11-10 10:42:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:42:58,197 INFO L93 Difference]: Finished difference Result 1084 states and 1642 transitions. [2018-11-10 10:42:58,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:42:58,197 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2018-11-10 10:42:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:42:58,199 INFO L225 Difference]: With dead ends: 1084 [2018-11-10 10:42:58,199 INFO L226 Difference]: Without dead ends: 769 [2018-11-10 10:42:58,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:42:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-11-10 10:42:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 598. [2018-11-10 10:42:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-11-10 10:42:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 910 transitions. [2018-11-10 10:42:58,222 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 910 transitions. Word has length 92 [2018-11-10 10:42:58,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:42:58,222 INFO L481 AbstractCegarLoop]: Abstraction has 598 states and 910 transitions. [2018-11-10 10:42:58,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:42:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 910 transitions. [2018-11-10 10:42:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-10 10:42:58,223 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:42:58,223 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, 1] [2018-11-10 10:42:58,223 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:42:58,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:42:58,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1999641398, now seen corresponding path program 1 times [2018-11-10 10:42:58,224 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:42:58,224 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:42:58,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:42:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:42:58,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:42:58,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:42:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:42:58,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,674 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:42:58,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:42:58,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:42:58,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:42:58,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:42:58,712 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:42:58,712 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:42:58,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:42:58,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:42:58,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:42:58,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:42:58,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:42:58,716 INFO L87 Difference]: Start difference. First operand 598 states and 910 transitions. Second operand 4 states. [2018-11-10 10:43:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:01,276 INFO L93 Difference]: Finished difference Result 1287 states and 1952 transitions. [2018-11-10 10:43:01,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:01,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2018-11-10 10:43:01,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:01,279 INFO L225 Difference]: With dead ends: 1287 [2018-11-10 10:43:01,279 INFO L226 Difference]: Without dead ends: 715 [2018-11-10 10:43:01,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2018-11-10 10:43:01,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 600. [2018-11-10 10:43:01,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 10:43:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 912 transitions. [2018-11-10 10:43:01,301 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 912 transitions. Word has length 93 [2018-11-10 10:43:01,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:01,301 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 912 transitions. [2018-11-10 10:43:01,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:01,301 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 912 transitions. [2018-11-10 10:43:01,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:43:01,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:01,302 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, 1] [2018-11-10 10:43:01,302 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:01,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:01,303 INFO L82 PathProgramCache]: Analyzing trace with hash -510537540, now seen corresponding path program 1 times [2018-11-10 10:43:01,303 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:01,303 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:01,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:01,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:01,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:01,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:01,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:01,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 19 treesize of output 15 [2018-11-10 10:43:01,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:01,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:01,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:01,745 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:01,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:01,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:01,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:01,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:01,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:01,748 INFO L87 Difference]: Start difference. First operand 600 states and 912 transitions. Second operand 4 states. [2018-11-10 10:43:04,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:04,241 INFO L93 Difference]: Finished difference Result 1269 states and 1928 transitions. [2018-11-10 10:43:04,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:04,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 10:43:04,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:04,242 INFO L225 Difference]: With dead ends: 1269 [2018-11-10 10:43:04,243 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 10:43:04,243 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-11-10 10:43:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 10:43:04,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 600. [2018-11-10 10:43:04,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 10:43:04,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 910 transitions. [2018-11-10 10:43:04,265 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 910 transitions. Word has length 94 [2018-11-10 10:43:04,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:04,265 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 910 transitions. [2018-11-10 10:43:04,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:04,265 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 910 transitions. [2018-11-10 10:43:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:43:04,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:04,265 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, 1] [2018-11-10 10:43:04,266 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:04,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2062723112, now seen corresponding path program 1 times [2018-11-10 10:43:04,266 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:04,266 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:04,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:04,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:04,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:04,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,686 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:04,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:04,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:04,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:04,695 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:04,703 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:04,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:04,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:04,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:04,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:04,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:04,706 INFO L87 Difference]: Start difference. First operand 600 states and 910 transitions. Second operand 4 states. [2018-11-10 10:43:07,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:07,202 INFO L93 Difference]: Finished difference Result 1269 states and 1924 transitions. [2018-11-10 10:43:07,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:07,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 10:43:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:07,204 INFO L225 Difference]: With dead ends: 1269 [2018-11-10 10:43:07,204 INFO L226 Difference]: Without dead ends: 695 [2018-11-10 10:43:07,205 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-11-10 10:43:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2018-11-10 10:43:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 600. [2018-11-10 10:43:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-10 10:43:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 908 transitions. [2018-11-10 10:43:07,228 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 908 transitions. Word has length 94 [2018-11-10 10:43:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:07,228 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 908 transitions. [2018-11-10 10:43:07,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 908 transitions. [2018-11-10 10:43:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-10 10:43:07,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:07,229 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, 1] [2018-11-10 10:43:07,229 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:07,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash 800424784, now seen corresponding path program 1 times [2018-11-10 10:43:07,230 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:07,230 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:07,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:07,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:07,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:07,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 13 treesize of output 10 [2018-11-10 10:43:07,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 10 treesize of output 9 [2018-11-10 10:43:07,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:07,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:07,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:07,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:07,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:07,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:07,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:07,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:07,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:07,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:07,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:07,673 INFO L87 Difference]: Start difference. First operand 600 states and 908 transitions. Second operand 4 states. [2018-11-10 10:43:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:10,140 INFO L93 Difference]: Finished difference Result 1265 states and 1916 transitions. [2018-11-10 10:43:10,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:10,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-11-10 10:43:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:10,141 INFO L225 Difference]: With dead ends: 1265 [2018-11-10 10:43:10,142 INFO L226 Difference]: Without dead ends: 691 [2018-11-10 10:43:10,142 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-11-10 10:43:10,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2018-11-10 10:43:10,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 602. [2018-11-10 10:43:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 10:43:10,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 910 transitions. [2018-11-10 10:43:10,164 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 910 transitions. Word has length 94 [2018-11-10 10:43:10,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:10,164 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 910 transitions. [2018-11-10 10:43:10,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 910 transitions. [2018-11-10 10:43:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:43:10,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:10,165 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, 1] [2018-11-10 10:43:10,165 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:10,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:10,165 INFO L82 PathProgramCache]: Analyzing trace with hash 515544126, now seen corresponding path program 1 times [2018-11-10 10:43:10,165 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:10,165 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:10,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:10,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:10,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:10,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:10,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:10,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:10,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:10,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:10,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:10,614 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:10,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:10,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:10,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:10,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:10,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:10,617 INFO L87 Difference]: Start difference. First operand 602 states and 910 transitions. Second operand 4 states. [2018-11-10 10:43:13,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:13,082 INFO L93 Difference]: Finished difference Result 1263 states and 1910 transitions. [2018-11-10 10:43:13,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:13,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:43:13,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:13,084 INFO L225 Difference]: With dead ends: 1263 [2018-11-10 10:43:13,084 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 10:43:13,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:13,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 10:43:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 602. [2018-11-10 10:43:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2018-11-10 10:43:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 908 transitions. [2018-11-10 10:43:13,107 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 908 transitions. Word has length 95 [2018-11-10 10:43:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:13,107 INFO L481 AbstractCegarLoop]: Abstraction has 602 states and 908 transitions. [2018-11-10 10:43:13,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 908 transitions. [2018-11-10 10:43:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-11-10 10:43:13,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:13,108 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, 1] [2018-11-10 10:43:13,108 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:13,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1667643080, now seen corresponding path program 1 times [2018-11-10 10:43:13,108 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:13,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:13,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:13,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:13,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:13,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-11-10 10:43:13,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:13,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-11-10 10:43:13,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:13,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:13,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:13,562 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:13,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:13,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:13,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:13,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:13,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:13,566 INFO L87 Difference]: Start difference. First operand 602 states and 908 transitions. Second operand 4 states. [2018-11-10 10:43:16,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:16,023 INFO L93 Difference]: Finished difference Result 1257 states and 1898 transitions. [2018-11-10 10:43:16,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:16,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2018-11-10 10:43:16,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:16,025 INFO L225 Difference]: With dead ends: 1257 [2018-11-10 10:43:16,025 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 10:43:16,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:16,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 10:43:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 604. [2018-11-10 10:43:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-10 10:43:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 910 transitions. [2018-11-10 10:43:16,048 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 910 transitions. Word has length 95 [2018-11-10 10:43:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:16,048 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 910 transitions. [2018-11-10 10:43:16,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 910 transitions. [2018-11-10 10:43:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-10 10:43:16,049 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:16,049 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, 1] [2018-11-10 10:43:16,049 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:16,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:16,049 INFO L82 PathProgramCache]: Analyzing trace with hash -431911054, now seen corresponding path program 1 times [2018-11-10 10:43:16,050 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:16,050 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:16,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:16,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:16,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:43:16,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:43:16,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:16,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:16,933 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,938 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,950 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:43:16,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:16,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:16,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:16,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:16,975 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:16,976 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:16,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:16,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:16,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:16,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:16,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:16,979 INFO L87 Difference]: Start difference. First operand 604 states and 910 transitions. Second operand 7 states. [2018-11-10 10:43:19,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:19,679 INFO L93 Difference]: Finished difference Result 916 states and 1390 transitions. [2018-11-10 10:43:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:19,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-11-10 10:43:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:19,682 INFO L225 Difference]: With dead ends: 916 [2018-11-10 10:43:19,682 INFO L226 Difference]: Without dead ends: 612 [2018-11-10 10:43:19,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-11-10 10:43:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 604. [2018-11-10 10:43:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-11-10 10:43:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 909 transitions. [2018-11-10 10:43:19,705 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 909 transitions. Word has length 97 [2018-11-10 10:43:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:19,706 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 909 transitions. [2018-11-10 10:43:19,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 909 transitions. [2018-11-10 10:43:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-11-10 10:43:19,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:19,707 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, 1] [2018-11-10 10:43:19,707 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:19,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1446521016, now seen corresponding path program 1 times [2018-11-10 10:43:19,708 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:19,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:19,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:20,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:20,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:20,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:20,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:20,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:20,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:20,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:20,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:20,137 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:20,137 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:20,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:20,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:20,141 INFO L87 Difference]: Start difference. First operand 604 states and 909 transitions. Second operand 4 states. [2018-11-10 10:43:22,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:22,595 INFO L93 Difference]: Finished difference Result 1259 states and 1896 transitions. [2018-11-10 10:43:22,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:22,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-11-10 10:43:22,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:22,597 INFO L225 Difference]: With dead ends: 1259 [2018-11-10 10:43:22,597 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 10:43:22,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 10:43:22,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 606. [2018-11-10 10:43:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2018-11-10 10:43:22,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 911 transitions. [2018-11-10 10:43:22,632 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 911 transitions. Word has length 98 [2018-11-10 10:43:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:22,632 INFO L481 AbstractCegarLoop]: Abstraction has 606 states and 911 transitions. [2018-11-10 10:43:22,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 911 transitions. [2018-11-10 10:43:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 10:43:22,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:22,633 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, 1] [2018-11-10 10:43:22,633 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:22,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:22,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1123151677, now seen corresponding path program 1 times [2018-11-10 10:43:22,634 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:22,634 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:22,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:23,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43: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 13 treesize of output 10 [2018-11-10 10:43:23,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:23,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:23,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:23,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:23,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:23,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:23,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:23,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:23,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:23,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:23,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:23,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:23,080 INFO L87 Difference]: Start difference. First operand 606 states and 911 transitions. Second operand 4 states. [2018-11-10 10:43:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:25,526 INFO L93 Difference]: Finished difference Result 1249 states and 1880 transitions. [2018-11-10 10:43:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:25,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 10:43:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:25,528 INFO L225 Difference]: With dead ends: 1249 [2018-11-10 10:43:25,528 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 10:43:25,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 10:43:25,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 608. [2018-11-10 10:43:25,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2018-11-10 10:43:25,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 913 transitions. [2018-11-10 10:43:25,551 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 913 transitions. Word has length 99 [2018-11-10 10:43:25,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:25,551 INFO L481 AbstractCegarLoop]: Abstraction has 608 states and 913 transitions. [2018-11-10 10:43:25,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:25,551 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 913 transitions. [2018-11-10 10:43:25,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-10 10:43:25,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:25,552 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, 1] [2018-11-10 10:43:25,552 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:25,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1230578596, now seen corresponding path program 1 times [2018-11-10 10:43:25,552 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:25,553 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:25,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:25,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:25,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:25,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:25,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:25,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:25,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:25,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:25,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:25,984 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:25,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:25,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:25,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:25,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:25,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:25,987 INFO L87 Difference]: Start difference. First operand 608 states and 913 transitions. Second operand 4 states. [2018-11-10 10:43:28,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:28,446 INFO L93 Difference]: Finished difference Result 1251 states and 1880 transitions. [2018-11-10 10:43:28,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:28,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-11-10 10:43:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:28,447 INFO L225 Difference]: With dead ends: 1251 [2018-11-10 10:43:28,448 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 10:43:28,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 10:43:28,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 610. [2018-11-10 10:43:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-11-10 10:43:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 915 transitions. [2018-11-10 10:43:28,472 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 915 transitions. Word has length 99 [2018-11-10 10:43:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:28,472 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 915 transitions. [2018-11-10 10:43:28,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:28,472 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 915 transitions. [2018-11-10 10:43:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-10 10:43:28,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:28,473 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, 1] [2018-11-10 10:43:28,473 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:28,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:28,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1862133671, now seen corresponding path program 1 times [2018-11-10 10:43:28,474 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:28,474 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:28,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:28,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:28,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:28,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:28,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:28,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:28,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:28,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:28,950 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:28,950 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:28,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:28,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:28,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:28,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:28,954 INFO L87 Difference]: Start difference. First operand 610 states and 915 transitions. Second operand 4 states. [2018-11-10 10:43:31,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:31,402 INFO L93 Difference]: Finished difference Result 1247 states and 1873 transitions. [2018-11-10 10:43:31,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:31,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-11-10 10:43:31,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:31,404 INFO L225 Difference]: With dead ends: 1247 [2018-11-10 10:43:31,404 INFO L226 Difference]: Without dead ends: 663 [2018-11-10 10:43:31,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-10 10:43:31,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 612. [2018-11-10 10:43:31,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-11-10 10:43:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 917 transitions. [2018-11-10 10:43:31,429 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 917 transitions. Word has length 100 [2018-11-10 10:43:31,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:31,430 INFO L481 AbstractCegarLoop]: Abstraction has 612 states and 917 transitions. [2018-11-10 10:43:31,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 917 transitions. [2018-11-10 10:43:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-10 10:43:31,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:31,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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:43:31,430 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:31,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 900614796, now seen corresponding path program 1 times [2018-11-10 10:43:31,431 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:31,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:31,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:31,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-11-10 10:43:31,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:31,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:31,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:31,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:31,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:31,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:31,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:31,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:31,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:31,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-11-10 10:43:31,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:31,899 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:31,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:31,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:31,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:31,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:31,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:31,902 INFO L87 Difference]: Start difference. First operand 612 states and 917 transitions. Second operand 4 states. [2018-11-10 10:43:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:34,350 INFO L93 Difference]: Finished difference Result 1249 states and 1873 transitions. [2018-11-10 10:43:34,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:34,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-11-10 10:43:34,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:34,352 INFO L225 Difference]: With dead ends: 1249 [2018-11-10 10:43:34,352 INFO L226 Difference]: Without dead ends: 663 [2018-11-10 10:43:34,353 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-11-10 10:43:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-11-10 10:43:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 614. [2018-11-10 10:43:34,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-11-10 10:43:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 919 transitions. [2018-11-10 10:43:34,381 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 919 transitions. Word has length 101 [2018-11-10 10:43:34,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:34,381 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 919 transitions. [2018-11-10 10:43:34,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 919 transitions. [2018-11-10 10:43:34,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-10 10:43:34,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:34,382 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, 1] [2018-11-10 10:43:34,382 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:34,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:34,382 INFO L82 PathProgramCache]: Analyzing trace with hash 179224929, now seen corresponding path program 1 times [2018-11-10 10:43:34,382 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:34,382 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:34,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:34,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:34,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:34,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:34,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:34,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:34,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:34,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:34,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:34,839 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:34,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:34,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:34,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:34,842 INFO L87 Difference]: Start difference. First operand 614 states and 919 transitions. Second operand 4 states. [2018-11-10 10:43:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:37,282 INFO L93 Difference]: Finished difference Result 1245 states and 1866 transitions. [2018-11-10 10:43:37,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:37,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-11-10 10:43:37,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:37,284 INFO L225 Difference]: With dead ends: 1245 [2018-11-10 10:43:37,284 INFO L226 Difference]: Without dead ends: 657 [2018-11-10 10:43:37,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:43:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-10 10:43:37,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 616. [2018-11-10 10:43:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:43:37,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 921 transitions. [2018-11-10 10:43:37,309 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 921 transitions. Word has length 102 [2018-11-10 10:43:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:37,310 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 921 transitions. [2018-11-10 10:43:37,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:37,310 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 921 transitions. [2018-11-10 10:43:37,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 10:43:37,310 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:37,311 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, 1] [2018-11-10 10:43:37,311 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:37,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:37,311 INFO L82 PathProgramCache]: Analyzing trace with hash 945892122, now seen corresponding path program 1 times [2018-11-10 10:43:37,311 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:37,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:38,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:38,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:38,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:38,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:38,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 23 treesize of output 18 [2018-11-10 10:43:38,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:38,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:38,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:38,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:38,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:38,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:38,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:38,244 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:38,244 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:38,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:38,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:38,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:38,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:38,248 INFO L87 Difference]: Start difference. First operand 616 states and 921 transitions. Second operand 7 states. [2018-11-10 10:43:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:39,093 INFO L93 Difference]: Finished difference Result 1359 states and 2014 transitions. [2018-11-10 10:43:39,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:39,093 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 10:43:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:39,095 INFO L225 Difference]: With dead ends: 1359 [2018-11-10 10:43:39,095 INFO L226 Difference]: Without dead ends: 769 [2018-11-10 10:43:39,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-11-10 10:43:39,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 616. [2018-11-10 10:43:39,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:43:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 919 transitions. [2018-11-10 10:43:39,121 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 919 transitions. Word has length 107 [2018-11-10 10:43:39,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:39,121 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 919 transitions. [2018-11-10 10:43:39,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:39,121 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 919 transitions. [2018-11-10 10:43:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-11-10 10:43:39,122 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:39,122 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, 1] [2018-11-10 10:43:39,122 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:39,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1379621208, now seen corresponding path program 1 times [2018-11-10 10:43:39,123 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:39,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:40,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:40,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:40,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:40,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:40,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:40,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:40,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:40,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:40,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:40,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:40,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:40,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:40,073 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:40,073 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:40,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:40,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:40,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:40,077 INFO L87 Difference]: Start difference. First operand 616 states and 919 transitions. Second operand 7 states. [2018-11-10 10:43:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:42,879 INFO L93 Difference]: Finished difference Result 1271 states and 1890 transitions. [2018-11-10 10:43:42,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:42,879 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 107 [2018-11-10 10:43:42,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:42,881 INFO L225 Difference]: With dead ends: 1271 [2018-11-10 10:43:42,881 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 10:43:42,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:42,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 10:43:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 616. [2018-11-10 10:43:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:43:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 917 transitions. [2018-11-10 10:43:42,907 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 917 transitions. Word has length 107 [2018-11-10 10:43:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:42,907 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 917 transitions. [2018-11-10 10:43:42,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:42,908 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 917 transitions. [2018-11-10 10:43:42,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 10:43:42,908 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:42,908 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, 1] [2018-11-10 10:43:42,909 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:42,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:42,909 INFO L82 PathProgramCache]: Analyzing trace with hash -891328692, now seen corresponding path program 1 times [2018-11-10 10:43:42,909 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:42,909 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:42,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:43,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:43,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:43,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:43,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:43,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:43,827 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:43,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:43,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:43,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:43,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:43,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:43,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:43,860 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:43,861 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:43,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:43,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:43,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:43,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:43,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:43,865 INFO L87 Difference]: Start difference. First operand 616 states and 917 transitions. Second operand 7 states. [2018-11-10 10:43:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:44,707 INFO L93 Difference]: Finished difference Result 1359 states and 2006 transitions. [2018-11-10 10:43:44,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:44,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 10:43:44,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:44,709 INFO L225 Difference]: With dead ends: 1359 [2018-11-10 10:43:44,709 INFO L226 Difference]: Without dead ends: 769 [2018-11-10 10:43:44,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-11-10 10:43:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 616. [2018-11-10 10:43:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:43:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 915 transitions. [2018-11-10 10:43:44,737 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 915 transitions. Word has length 108 [2018-11-10 10:43:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:44,737 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 915 transitions. [2018-11-10 10:43:44,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 915 transitions. [2018-11-10 10:43:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-10 10:43:44,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:44,738 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, 1] [2018-11-10 10:43:44,738 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:44,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:44,738 INFO L82 PathProgramCache]: Analyzing trace with hash -330628914, now seen corresponding path program 1 times [2018-11-10 10:43:44,739 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:44,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:45,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:45,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 13 treesize of output 10 [2018-11-10 10:43:45,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:45,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:45,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:45,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:45,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:45,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:45,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-11-10 10:43:45,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:45,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:45,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:45,685 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:45,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:45,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:45,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:45,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:45,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:45,688 INFO L87 Difference]: Start difference. First operand 616 states and 915 transitions. Second operand 7 states. [2018-11-10 10:43:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:46,463 INFO L93 Difference]: Finished difference Result 1271 states and 1882 transitions. [2018-11-10 10:43:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:46,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-11-10 10:43:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:46,465 INFO L225 Difference]: With dead ends: 1271 [2018-11-10 10:43:46,465 INFO L226 Difference]: Without dead ends: 681 [2018-11-10 10:43:46,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:43:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2018-11-10 10:43:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 616. [2018-11-10 10:43:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2018-11-10 10:43:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 913 transitions. [2018-11-10 10:43:46,491 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 913 transitions. Word has length 108 [2018-11-10 10:43:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:46,492 INFO L481 AbstractCegarLoop]: Abstraction has 616 states and 913 transitions. [2018-11-10 10:43:46,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 913 transitions. [2018-11-10 10:43:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:43:46,492 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:46,492 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-11-10 10:43:46,492 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:46,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1271947510, now seen corresponding path program 1 times [2018-11-10 10:43:46,493 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:46,493 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:46,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:46,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:46,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:46,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:46,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:46,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:46,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:46,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:47,008 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:47,008 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:47,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:47,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:47,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:47,012 INFO L87 Difference]: Start difference. First operand 616 states and 913 transitions. Second operand 4 states. [2018-11-10 10:43:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:49,451 INFO L93 Difference]: Finished difference Result 1247 states and 1850 transitions. [2018-11-10 10:43:49,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:49,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-11-10 10:43:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:49,453 INFO L225 Difference]: With dead ends: 1247 [2018-11-10 10:43:49,453 INFO L226 Difference]: Without dead ends: 657 [2018-11-10 10:43:49,454 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-11-10 10:43:49,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-10 10:43:49,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 622. [2018-11-10 10:43:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:43:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 919 transitions. [2018-11-10 10:43:49,480 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 919 transitions. Word has length 109 [2018-11-10 10:43:49,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:49,480 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 919 transitions. [2018-11-10 10:43:49,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:49,480 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 919 transitions. [2018-11-10 10:43:49,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:43:49,480 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:49,480 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, 1] [2018-11-10 10:43:49,480 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:49,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:49,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2049395873, now seen corresponding path program 1 times [2018-11-10 10:43:49,481 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:49,481 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:49,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:50,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:50,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:50,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:50,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,424 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:50,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:50,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:50,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:50,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:50,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-11-10 10:43:50,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-11-10 10:43:50,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:50,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:50,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:50,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:50,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:50,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:50,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:50,487 INFO L87 Difference]: Start difference. First operand 622 states and 919 transitions. Second operand 7 states. [2018-11-10 10:43:51,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:51,432 INFO L93 Difference]: Finished difference Result 1367 states and 2006 transitions. [2018-11-10 10:43:51,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:51,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 10:43:51,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:51,434 INFO L225 Difference]: With dead ends: 1367 [2018-11-10 10:43:51,434 INFO L226 Difference]: Without dead ends: 771 [2018-11-10 10:43:51,435 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-11-10 10:43:51,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2018-11-10 10:43:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 622. [2018-11-10 10:43:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:43:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 917 transitions. [2018-11-10 10:43:51,465 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 917 transitions. Word has length 109 [2018-11-10 10:43:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:51,465 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 917 transitions. [2018-11-10 10:43:51,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:51,465 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 917 transitions. [2018-11-10 10:43:51,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-10 10:43:51,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:51,466 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, 1] [2018-11-10 10:43:51,466 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:51,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:51,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1847571939, now seen corresponding path program 1 times [2018-11-10 10:43:51,466 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:51,466 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:51,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:52,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:52,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:52,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:52,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:52,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:52,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:52,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:52,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:52,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:52,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:52,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:52,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:52,572 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:52,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:52,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:52,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:52,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:52,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:52,577 INFO L87 Difference]: Start difference. First operand 622 states and 917 transitions. Second operand 7 states. [2018-11-10 10:43:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:55,457 INFO L93 Difference]: Finished difference Result 1283 states and 1886 transitions. [2018-11-10 10:43:55,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:43:55,458 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-11-10 10:43:55,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:55,459 INFO L225 Difference]: With dead ends: 1283 [2018-11-10 10:43:55,459 INFO L226 Difference]: Without dead ends: 687 [2018-11-10 10:43:55,459 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-11-10 10:43:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2018-11-10 10:43:55,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 622. [2018-11-10 10:43:55,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2018-11-10 10:43:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 915 transitions. [2018-11-10 10:43:55,487 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 915 transitions. Word has length 109 [2018-11-10 10:43:55,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:55,487 INFO L481 AbstractCegarLoop]: Abstraction has 622 states and 915 transitions. [2018-11-10 10:43:55,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:43:55,487 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 915 transitions. [2018-11-10 10:43:55,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:43:55,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:55,488 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-11-10 10:43:55,488 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:55,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:55,488 INFO L82 PathProgramCache]: Analyzing trace with hash 832057739, now seen corresponding path program 1 times [2018-11-10 10:43:55,489 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:55,489 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:55,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:56,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:56,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:56,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:56,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:43:56,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:56,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:56,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:56,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:43:56,045 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:43:56,045 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:56,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:56,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:43:56,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:43:56,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:43:56,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:43:56,049 INFO L87 Difference]: Start difference. First operand 622 states and 915 transitions. Second operand 4 states. [2018-11-10 10:43:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:43:58,525 INFO L93 Difference]: Finished difference Result 1241 states and 1831 transitions. [2018-11-10 10:43:58,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:43:58,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-11-10 10:43:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:43:58,526 INFO L225 Difference]: With dead ends: 1241 [2018-11-10 10:43:58,526 INFO L226 Difference]: Without dead ends: 645 [2018-11-10 10:43:58,527 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-11-10 10:43:58,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-10 10:43:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 624. [2018-11-10 10:43:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 10:43:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 917 transitions. [2018-11-10 10:43:58,554 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 917 transitions. Word has length 110 [2018-11-10 10:43:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:43:58,554 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 917 transitions. [2018-11-10 10:43:58,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:43:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 917 transitions. [2018-11-10 10:43:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:43:58,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:43:58,555 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, 1] [2018-11-10 10:43:58,555 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:43:58,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:43:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash 666430385, now seen corresponding path program 1 times [2018-11-10 10:43:58,556 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:43:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:43:58,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:43:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:43:59,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:43:59,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:43:59,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:43:59,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:43:59,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:43:59,605 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:43:59,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:43:59,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:43:59,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:43:59,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:43:59,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:43:59,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:43:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:43:59,642 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:43:59,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:43:59,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:43:59,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:43:59,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:43:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:43:59,646 INFO L87 Difference]: Start difference. First operand 624 states and 917 transitions. Second operand 7 states. [2018-11-10 10:44:02,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:02,617 INFO L93 Difference]: Finished difference Result 1351 states and 1976 transitions. [2018-11-10 10:44:02,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:02,617 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-10 10:44:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:02,618 INFO L225 Difference]: With dead ends: 1351 [2018-11-10 10:44:02,618 INFO L226 Difference]: Without dead ends: 753 [2018-11-10 10:44:02,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2018-11-10 10:44:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 624. [2018-11-10 10:44:02,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 10:44:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 915 transitions. [2018-11-10 10:44:02,649 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 915 transitions. Word has length 110 [2018-11-10 10:44:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:02,649 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 915 transitions. [2018-11-10 10:44:02,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 915 transitions. [2018-11-10 10:44:02,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-11-10 10:44:02,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:02,649 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, 1] [2018-11-10 10:44:02,650 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:02,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:02,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1666962253, now seen corresponding path program 1 times [2018-11-10 10:44:02,650 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:02,650 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:02,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:03,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:03,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:03,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:03,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:03,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 23 treesize of output 18 [2018-11-10 10:44:03,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:03,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-11-10 10:44:03,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:03,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:03,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:03,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:03,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:44:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:03,734 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:03,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:03,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:03,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:03,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:03,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:03,738 INFO L87 Difference]: Start difference. First operand 624 states and 915 transitions. Second operand 7 states. [2018-11-10 10:44:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:06,591 INFO L93 Difference]: Finished difference Result 1267 states and 1856 transitions. [2018-11-10 10:44:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:06,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 110 [2018-11-10 10:44:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:06,592 INFO L225 Difference]: With dead ends: 1267 [2018-11-10 10:44:06,593 INFO L226 Difference]: Without dead ends: 669 [2018-11-10 10:44:06,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-11-10 10:44:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 624. [2018-11-10 10:44:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-11-10 10:44:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 913 transitions. [2018-11-10 10:44:06,624 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 913 transitions. Word has length 110 [2018-11-10 10:44:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:06,624 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 913 transitions. [2018-11-10 10:44:06,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:06,624 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 913 transitions. [2018-11-10 10:44:06,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-10 10:44:06,625 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:06,625 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, 1] [2018-11-10 10:44:06,625 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:06,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 349283122, now seen corresponding path program 1 times [2018-11-10 10:44:06,626 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:06,626 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:06,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:07,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:07,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:07,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:07,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:44:07,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:07,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:07,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:07,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:44:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:07,195 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:07,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:07,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:44:07,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:44:07,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:44:07,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:44:07,200 INFO L87 Difference]: Start difference. First operand 624 states and 913 transitions. Second operand 4 states. [2018-11-10 10:44:09,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:09,684 INFO L93 Difference]: Finished difference Result 1243 states and 1823 transitions. [2018-11-10 10:44:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:44:09,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-11-10 10:44:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:09,685 INFO L225 Difference]: With dead ends: 1243 [2018-11-10 10:44:09,685 INFO L226 Difference]: Without dead ends: 645 [2018-11-10 10:44:09,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:44:09,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-11-10 10:44:09,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 626. [2018-11-10 10:44:09,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-11-10 10:44:09,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 915 transitions. [2018-11-10 10:44:09,716 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 915 transitions. Word has length 111 [2018-11-10 10:44:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:09,716 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 915 transitions. [2018-11-10 10:44:09,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:44:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 915 transitions. [2018-11-10 10:44:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-11-10 10:44:09,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:09,717 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, 1, 1] [2018-11-10 10:44:09,717 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:09,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:09,717 INFO L82 PathProgramCache]: Analyzing trace with hash -963850777, now seen corresponding path program 1 times [2018-11-10 10:44:09,717 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:09,717 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:09,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:10,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:10,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:10,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:10,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:44:10,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-11-10 10:44:10,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-11-10 10:44:10,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:10,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:44:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 10:44:10,285 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:10,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:10,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:44:10,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:44:10,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:44:10,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:44:10,288 INFO L87 Difference]: Start difference. First operand 626 states and 915 transitions. Second operand 4 states. [2018-11-10 10:44:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:12,761 INFO L93 Difference]: Finished difference Result 997 states and 1452 transitions. [2018-11-10 10:44:12,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:44:12,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-11-10 10:44:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:12,763 INFO L225 Difference]: With dead ends: 997 [2018-11-10 10:44:12,763 INFO L226 Difference]: Without dead ends: 351 [2018-11-10 10:44:12,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:44:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-10 10:44:12,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2018-11-10 10:44:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-11-10 10:44:12,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 511 transitions. [2018-11-10 10:44:12,783 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 511 transitions. Word has length 112 [2018-11-10 10:44:12,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:12,783 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 511 transitions. [2018-11-10 10:44:12,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:44:12,783 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 511 transitions. [2018-11-10 10:44:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 10:44:12,784 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:12,784 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:12,784 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:12,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:12,784 INFO L82 PathProgramCache]: Analyzing trace with hash -790487413, now seen corresponding path program 1 times [2018-11-10 10:44:12,785 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:12,785 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:12,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:13,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:13,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:13,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:13,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:13,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:13,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:13,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:13,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:13,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:13,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:13,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:13,860 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:13,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:13,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:13,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:13,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:13,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:13,877 INFO L87 Difference]: Start difference. First operand 344 states and 511 transitions. Second operand 7 states. [2018-11-10 10:44:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:14,732 INFO L93 Difference]: Finished difference Result 702 states and 1052 transitions. [2018-11-10 10:44:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:14,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2018-11-10 10:44:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:14,733 INFO L225 Difference]: With dead ends: 702 [2018-11-10 10:44:14,733 INFO L226 Difference]: Without dead ends: 409 [2018-11-10 10:44:14,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:14,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-10 10:44:14,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 344. [2018-11-10 10:44:14,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-11-10 10:44:14,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 510 transitions. [2018-11-10 10:44:14,754 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 510 transitions. Word has length 114 [2018-11-10 10:44:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:14,754 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 510 transitions. [2018-11-10 10:44:14,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 510 transitions. [2018-11-10 10:44:14,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-10 10:44:14,755 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:14,755 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:14,755 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:14,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:14,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1818300045, now seen corresponding path program 1 times [2018-11-10 10:44:14,756 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:14,756 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:14,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:15,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:15,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:44:15,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:44:15,780 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:15,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:15,782 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:15,788 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:15,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:15,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:15,801 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:44:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:44:15,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:15,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:15,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:15,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:15,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:15,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:15,842 INFO L87 Difference]: Start difference. First operand 344 states and 510 transitions. Second operand 7 states. [2018-11-10 10:44:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:16,610 INFO L93 Difference]: Finished difference Result 699 states and 1049 transitions. [2018-11-10 10:44:16,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:16,610 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2018-11-10 10:44:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:16,611 INFO L225 Difference]: With dead ends: 699 [2018-11-10 10:44:16,611 INFO L226 Difference]: Without dead ends: 406 [2018-11-10 10:44:16,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-11-10 10:44:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 371. [2018-11-10 10:44:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-10 10:44:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 555 transitions. [2018-11-10 10:44:16,629 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 555 transitions. Word has length 114 [2018-11-10 10:44:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:16,629 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 555 transitions. [2018-11-10 10:44:16,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 555 transitions. [2018-11-10 10:44:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-10 10:44:16,630 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:16,630 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] [2018-11-10 10:44:16,630 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:16,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1007788134, now seen corresponding path program 1 times [2018-11-10 10:44:16,631 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:16,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:16,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:17,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:17,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:17,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:17,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:44:17,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:17,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:17,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:17,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:44:17,271 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:44:17,271 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:17,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:17,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:44:17,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:44:17,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:44:17,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:44:17,275 INFO L87 Difference]: Start difference. First operand 371 states and 555 transitions. Second operand 4 states. [2018-11-10 10:44:19,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:19,882 INFO L93 Difference]: Finished difference Result 767 states and 1162 transitions. [2018-11-10 10:44:19,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:44:19,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-11-10 10:44:19,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:19,883 INFO L225 Difference]: With dead ends: 767 [2018-11-10 10:44:19,883 INFO L226 Difference]: Without dead ends: 447 [2018-11-10 10:44:19,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:44:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-11-10 10:44:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 402. [2018-11-10 10:44:19,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:19,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 608 transitions. [2018-11-10 10:44:19,905 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 608 transitions. Word has length 117 [2018-11-10 10:44:19,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:19,905 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 608 transitions. [2018-11-10 10:44:19,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:44:19,905 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 608 transitions. [2018-11-10 10:44:19,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-10 10:44:19,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:19,906 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, 1] [2018-11-10 10:44:19,906 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:19,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:19,906 INFO L82 PathProgramCache]: Analyzing trace with hash -198013414, now seen corresponding path program 1 times [2018-11-10 10:44:19,907 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:20,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:20,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:20,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:20,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:20,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:21,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:21,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:21,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:21,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:21,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:21,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-11-10 10:44:21,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:21,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:21,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:21,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:21,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:21,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:21,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:21,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:21,063 INFO L87 Difference]: Start difference. First operand 402 states and 608 transitions. Second operand 7 states. [2018-11-10 10:44:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:21,954 INFO L93 Difference]: Finished difference Result 818 states and 1246 transitions. [2018-11-10 10:44:21,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:21,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-10 10:44:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:21,956 INFO L225 Difference]: With dead ends: 818 [2018-11-10 10:44:21,956 INFO L226 Difference]: Without dead ends: 467 [2018-11-10 10:44:21,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:21,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-10 10:44:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 402. [2018-11-10 10:44:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:21,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 607 transitions. [2018-11-10 10:44:21,978 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 607 transitions. Word has length 119 [2018-11-10 10:44:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:21,978 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 607 transitions. [2018-11-10 10:44:21,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:21,978 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 607 transitions. [2018-11-10 10:44:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:44:21,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:21,979 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, 1] [2018-11-10 10:44:21,979 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:21,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:21,979 INFO L82 PathProgramCache]: Analyzing trace with hash 81640024, now seen corresponding path program 1 times [2018-11-10 10:44:21,980 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:21,980 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:21,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:23,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:23,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 13 treesize of output 10 [2018-11-10 10:44:23,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:23,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:23,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-11-10 10:44:23,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:23,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:23,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,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-11-10 10:44:23,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:23,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:23,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:23,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:23,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:44:23,304 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 10:44:23,304 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:23,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:23,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:23,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:23,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:23,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:23,310 INFO L87 Difference]: Start difference. First operand 402 states and 607 transitions. Second operand 7 states. [2018-11-10 10:44:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:24,237 INFO L93 Difference]: Finished difference Result 808 states and 1232 transitions. [2018-11-10 10:44:24,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:24,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 10:44:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:24,239 INFO L225 Difference]: With dead ends: 808 [2018-11-10 10:44:24,239 INFO L226 Difference]: Without dead ends: 457 [2018-11-10 10:44:24,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:24,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-10 10:44:24,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 402. [2018-11-10 10:44:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:24,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 606 transitions. [2018-11-10 10:44:24,261 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 606 transitions. Word has length 120 [2018-11-10 10:44:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:24,261 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 606 transitions. [2018-11-10 10:44:24,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:24,261 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 606 transitions. [2018-11-10 10:44:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:44:24,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:24,262 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, 1] [2018-11-10 10:44:24,262 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:24,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:24,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1470545548, now seen corresponding path program 1 times [2018-11-10 10:44:24,263 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:24,263 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:25,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:25,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:25,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:25,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:25,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:25,426 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:25,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:25,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:25,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:25,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:25,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:25,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:25,462 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:25,462 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:25,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:25,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:25,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:25,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:25,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:25,467 INFO L87 Difference]: Start difference. First operand 402 states and 606 transitions. Second operand 7 states. [2018-11-10 10:44:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:28,249 INFO L93 Difference]: Finished difference Result 808 states and 1230 transitions. [2018-11-10 10:44:28,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:28,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 10:44:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:28,250 INFO L225 Difference]: With dead ends: 808 [2018-11-10 10:44:28,250 INFO L226 Difference]: Without dead ends: 457 [2018-11-10 10:44:28,251 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-11-10 10:44:28,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-11-10 10:44:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 402. [2018-11-10 10:44:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 605 transitions. [2018-11-10 10:44:28,270 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 605 transitions. Word has length 120 [2018-11-10 10:44:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:28,270 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 605 transitions. [2018-11-10 10:44:28,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 605 transitions. [2018-11-10 10:44:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:44:28,270 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:28,270 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, 1] [2018-11-10 10:44:28,271 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:28,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:28,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1392602348, now seen corresponding path program 1 times [2018-11-10 10:44:28,271 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:28,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:28,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:28,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:29,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:29,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:29,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:29,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:29,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:29,275 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:29,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:29,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:29,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:29,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:29,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:29,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:29,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:29,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:29,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:29,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:29,314 INFO L87 Difference]: Start difference. First operand 402 states and 605 transitions. Second operand 7 states. [2018-11-10 10:44:30,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:30,085 INFO L93 Difference]: Finished difference Result 806 states and 1226 transitions. [2018-11-10 10:44:30,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:30,086 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 10:44:30,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:30,086 INFO L225 Difference]: With dead ends: 806 [2018-11-10 10:44:30,087 INFO L226 Difference]: Without dead ends: 455 [2018-11-10 10:44:30,087 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-11-10 10:44:30,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-11-10 10:44:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 402. [2018-11-10 10:44:30,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 604 transitions. [2018-11-10 10:44:30,106 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 604 transitions. Word has length 120 [2018-11-10 10:44:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:30,106 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 604 transitions. [2018-11-10 10:44:30,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 604 transitions. [2018-11-10 10:44:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-10 10:44:30,107 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:30,107 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, 1] [2018-11-10 10:44:30,107 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:30,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -885710630, now seen corresponding path program 1 times [2018-11-10 10:44:30,108 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:30,108 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:30,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:31,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:31,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:31,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:31,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:31,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:31,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:31,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:31,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,263 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,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-11-10 10:44:31,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:31,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:31,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:31,273 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:31,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:44:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-10 10:44:31,290 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:31,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:31,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:31,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:31,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:31,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:31,295 INFO L87 Difference]: Start difference. First operand 402 states and 604 transitions. Second operand 7 states. [2018-11-10 10:44:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:31,989 INFO L93 Difference]: Finished difference Result 766 states and 1163 transitions. [2018-11-10 10:44:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:31,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 120 [2018-11-10 10:44:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:31,990 INFO L225 Difference]: With dead ends: 766 [2018-11-10 10:44:31,991 INFO L226 Difference]: Without dead ends: 415 [2018-11-10 10:44:31,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-11-10 10:44:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 402. [2018-11-10 10:44:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 603 transitions. [2018-11-10 10:44:32,026 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 603 transitions. Word has length 120 [2018-11-10 10:44:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:32,026 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 603 transitions. [2018-11-10 10:44:32,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 603 transitions. [2018-11-10 10:44:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:44:32,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:32,027 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, 1] [2018-11-10 10:44:32,027 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:32,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:32,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1693179426, now seen corresponding path program 1 times [2018-11-10 10:44:32,028 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:32,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:33,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:33,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:33,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:33,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:33,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:33,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:33,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:33,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:33,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:33,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:33,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:33,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:33,184 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:33,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:33,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:33,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:33,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:33,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:33,188 INFO L87 Difference]: Start difference. First operand 402 states and 603 transitions. Second operand 7 states. [2018-11-10 10:44:33,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:33,953 INFO L93 Difference]: Finished difference Result 804 states and 1219 transitions. [2018-11-10 10:44:33,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:33,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:44:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:33,954 INFO L225 Difference]: With dead ends: 804 [2018-11-10 10:44:33,954 INFO L226 Difference]: Without dead ends: 453 [2018-11-10 10:44:33,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:33,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-11-10 10:44:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 402. [2018-11-10 10:44:33,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 602 transitions. [2018-11-10 10:44:33,989 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 602 transitions. Word has length 121 [2018-11-10 10:44:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:33,989 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 602 transitions. [2018-11-10 10:44:33,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 602 transitions. [2018-11-10 10:44:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-11-10 10:44:33,990 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:33,990 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, 1] [2018-11-10 10:44:33,990 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:33,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:33,991 INFO L82 PathProgramCache]: Analyzing trace with hash -490007780, now seen corresponding path program 1 times [2018-11-10 10:44:33,991 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:33,991 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:34,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:34,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:34,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:34,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:34,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:34,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:34,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:34,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-11-10 10:44:34,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:34,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:34,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 13 treesize of output 5 [2018-11-10 10:44:34,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:34,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:34,993 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:34,993 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:34,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:34,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:34,997 INFO L87 Difference]: Start difference. First operand 402 states and 602 transitions. Second operand 7 states. [2018-11-10 10:44:35,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:35,730 INFO L93 Difference]: Finished difference Result 801 states and 1213 transitions. [2018-11-10 10:44:35,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:35,730 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-11-10 10:44:35,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:35,731 INFO L225 Difference]: With dead ends: 801 [2018-11-10 10:44:35,731 INFO L226 Difference]: Without dead ends: 450 [2018-11-10 10:44:35,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-10 10:44:35,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 402. [2018-11-10 10:44:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-10 10:44:35,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 601 transitions. [2018-11-10 10:44:35,751 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 601 transitions. Word has length 121 [2018-11-10 10:44:35,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:35,751 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 601 transitions. [2018-11-10 10:44:35,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:35,751 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 601 transitions. [2018-11-10 10:44:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 10:44:35,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:35,752 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:35,752 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:35,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:35,752 INFO L82 PathProgramCache]: Analyzing trace with hash 357233439, now seen corresponding path program 1 times [2018-11-10 10:44:35,752 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:35,752 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:35,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:35,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:35,891 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:35,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:35,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:35,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:44:35,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:44:35,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:44:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:44:35,894 INFO L87 Difference]: Start difference. First operand 402 states and 601 transitions. Second operand 3 states. [2018-11-10 10:44:35,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:35,966 INFO L93 Difference]: Finished difference Result 1099 states and 1671 transitions. [2018-11-10 10:44:35,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:44:35,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2018-11-10 10:44:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:35,968 INFO L225 Difference]: With dead ends: 1099 [2018-11-10 10:44:35,968 INFO L226 Difference]: Without dead ends: 748 [2018-11-10 10:44:35,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:44:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-11-10 10:44:36,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2018-11-10 10:44:36,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-10 10:44:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1114 transitions. [2018-11-10 10:44:36,004 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1114 transitions. Word has length 123 [2018-11-10 10:44:36,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:36,004 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1114 transitions. [2018-11-10 10:44:36,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:44:36,005 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1114 transitions. [2018-11-10 10:44:36,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-10 10:44:36,015 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:36,015 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:36,016 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:36,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:36,016 INFO L82 PathProgramCache]: Analyzing trace with hash 605379933, now seen corresponding path program 1 times [2018-11-10 10:44:36,016 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:36,017 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:36,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:37,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:37,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:37,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:37,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:37,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:37,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:37,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:37,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,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-11-10 10:44:37,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:37,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:37,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 13 treesize of output 5 [2018-11-10 10:44:37,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:37,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:37,162 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:37,162 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:37,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:37,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:37,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:37,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:37,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:37,166 INFO L87 Difference]: Start difference. First operand 746 states and 1114 transitions. Second operand 7 states. [2018-11-10 10:44:39,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:39,954 INFO L93 Difference]: Finished difference Result 1536 states and 2295 transitions. [2018-11-10 10:44:39,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:39,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 123 [2018-11-10 10:44:39,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:39,955 INFO L225 Difference]: With dead ends: 1536 [2018-11-10 10:44:39,956 INFO L226 Difference]: Without dead ends: 841 [2018-11-10 10:44:39,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:39,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-11-10 10:44:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 746. [2018-11-10 10:44:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-10 10:44:39,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1112 transitions. [2018-11-10 10:44:39,993 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1112 transitions. Word has length 123 [2018-11-10 10:44:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:39,993 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1112 transitions. [2018-11-10 10:44:39,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1112 transitions. [2018-11-10 10:44:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:44:39,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:39,994 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, 1] [2018-11-10 10:44:39,994 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:39,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1132239503, now seen corresponding path program 1 times [2018-11-10 10:44:39,994 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:40,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:41,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:41,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:41,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:41,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:41,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:41,099 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:41,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:41,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,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-11-10 10:44:41,114 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:41,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:41,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:41,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:41,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:41,136 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:41,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:41,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:41,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:41,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:41,140 INFO L87 Difference]: Start difference. First operand 746 states and 1112 transitions. Second operand 7 states. [2018-11-10 10:44:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:41,967 INFO L93 Difference]: Finished difference Result 1520 states and 2265 transitions. [2018-11-10 10:44:41,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:41,967 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-11-10 10:44:41,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:41,968 INFO L225 Difference]: With dead ends: 1520 [2018-11-10 10:44:41,968 INFO L226 Difference]: Without dead ends: 825 [2018-11-10 10:44:41,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:41,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-11-10 10:44:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 746. [2018-11-10 10:44:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2018-11-10 10:44:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1110 transitions. [2018-11-10 10:44:42,030 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1110 transitions. Word has length 124 [2018-11-10 10:44:42,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:42,030 INFO L481 AbstractCegarLoop]: Abstraction has 746 states and 1110 transitions. [2018-11-10 10:44:42,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:42,031 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1110 transitions. [2018-11-10 10:44:42,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-11-10 10:44:42,031 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:42,032 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:44:42,032 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:42,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:42,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1208097708, now seen corresponding path program 1 times [2018-11-10 10:44:42,033 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:42,033 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:42,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:42,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:42,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-11-10 10:44:42,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:42,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,620 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:44:42,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:42,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:42,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:42,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:44:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:44:42,652 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:42,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:42,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:44:42,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:44:42,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:44:42,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:44:42,655 INFO L87 Difference]: Start difference. First operand 746 states and 1110 transitions. Second operand 4 states. [2018-11-10 10:44:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:45,144 INFO L93 Difference]: Finished difference Result 1533 states and 2288 transitions. [2018-11-10 10:44:45,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:44:45,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-11-10 10:44:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:45,146 INFO L225 Difference]: With dead ends: 1533 [2018-11-10 10:44:45,146 INFO L226 Difference]: Without dead ends: 838 [2018-11-10 10:44:45,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:44:45,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-11-10 10:44:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 778. [2018-11-10 10:44:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-10 10:44:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1162 transitions. [2018-11-10 10:44:45,185 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1162 transitions. Word has length 124 [2018-11-10 10:44:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:45,185 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1162 transitions. [2018-11-10 10:44:45,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:44:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1162 transitions. [2018-11-10 10:44:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-11-10 10:44:45,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:45,186 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, 1] [2018-11-10 10:44:45,186 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:45,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash 541776776, now seen corresponding path program 1 times [2018-11-10 10:44:45,187 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:45,187 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:45,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:46,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:46,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:46,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:46,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:46,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:46,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:46,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-11-10 10:44:46,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:46,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:46,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:46,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:46,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:46,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:46,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:46,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:46,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:46,363 INFO L87 Difference]: Start difference. First operand 778 states and 1162 transitions. Second operand 7 states. [2018-11-10 10:44:47,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:47,176 INFO L93 Difference]: Finished difference Result 1584 states and 2365 transitions. [2018-11-10 10:44:47,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:47,177 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-11-10 10:44:47,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:47,178 INFO L225 Difference]: With dead ends: 1584 [2018-11-10 10:44:47,178 INFO L226 Difference]: Without dead ends: 857 [2018-11-10 10:44:47,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:47,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2018-11-10 10:44:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 778. [2018-11-10 10:44:47,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-10 10:44:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1160 transitions. [2018-11-10 10:44:47,220 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1160 transitions. Word has length 125 [2018-11-10 10:44:47,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:47,220 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1160 transitions. [2018-11-10 10:44:47,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1160 transitions. [2018-11-10 10:44:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:44:47,221 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:47,221 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, 1] [2018-11-10 10:44:47,222 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:47,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1740153611, now seen corresponding path program 1 times [2018-11-10 10:44:47,222 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:47,222 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:47,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:48,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:48,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-11-10 10:44:48,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:48,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-11-10 10:44:48,360 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:48,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-11-10 10:44:48,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,368 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:48,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:48,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:48,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:48,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:48,399 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:48,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:48,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:48,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:48,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:48,403 INFO L87 Difference]: Start difference. First operand 778 states and 1160 transitions. Second operand 7 states. [2018-11-10 10:44:49,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:49,248 INFO L93 Difference]: Finished difference Result 1578 states and 2354 transitions. [2018-11-10 10:44:49,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:49,248 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2018-11-10 10:44:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:49,249 INFO L225 Difference]: With dead ends: 1578 [2018-11-10 10:44:49,249 INFO L226 Difference]: Without dead ends: 851 [2018-11-10 10:44:49,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:44:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 851 states. [2018-11-10 10:44:49,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 851 to 778. [2018-11-10 10:44:49,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-11-10 10:44:49,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1158 transitions. [2018-11-10 10:44:49,288 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1158 transitions. Word has length 126 [2018-11-10 10:44:49,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:49,289 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 1158 transitions. [2018-11-10 10:44:49,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1158 transitions. [2018-11-10 10:44:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-10 10:44:49,289 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:49,289 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, 1] [2018-11-10 10:44:49,289 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:49,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:49,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1012530148, now seen corresponding path program 1 times [2018-11-10 10:44:49,290 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:49,290 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:49,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:49,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:49,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:49,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:49,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:44:49,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:44:49,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:44:49,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:49,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:44:49,914 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:44:49,914 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:49,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:49,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:44:49,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:44:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:44:49,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:44:49,918 INFO L87 Difference]: Start difference. First operand 778 states and 1158 transitions. Second operand 4 states. [2018-11-10 10:44:52,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:52,587 INFO L93 Difference]: Finished difference Result 1690 states and 2530 transitions. [2018-11-10 10:44:52,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:44:52,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-11-10 10:44:52,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:52,589 INFO L225 Difference]: With dead ends: 1690 [2018-11-10 10:44:52,589 INFO L226 Difference]: Without dead ends: 963 [2018-11-10 10:44:52,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:44:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-11-10 10:44:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 850. [2018-11-10 10:44:52,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:44:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1284 transitions. [2018-11-10 10:44:52,630 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1284 transitions. Word has length 126 [2018-11-10 10:44:52,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:52,630 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1284 transitions. [2018-11-10 10:44:52,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:44:52,630 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1284 transitions. [2018-11-10 10:44:52,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-10 10:44:52,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:52,631 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, 1] [2018-11-10 10:44:52,631 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:52,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash 387029360, now seen corresponding path program 1 times [2018-11-10 10:44:52,631 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:52,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:53,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:53,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:53,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-11-10 10:44:53,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:53,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:53,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:53,790 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:53,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:53,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,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-11-10 10:44:53,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:53,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:44:53,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:53,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:53,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:53,840 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:53,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:53,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:53,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:53,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:53,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:53,845 INFO L87 Difference]: Start difference. First operand 850 states and 1284 transitions. Second operand 7 states. [2018-11-10 10:44:56,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:44:56,688 INFO L93 Difference]: Finished difference Result 1722 states and 2602 transitions. [2018-11-10 10:44:56,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:44:56,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-11-10 10:44:56,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:44:56,689 INFO L225 Difference]: With dead ends: 1722 [2018-11-10 10:44:56,689 INFO L226 Difference]: Without dead ends: 923 [2018-11-10 10:44:56,690 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-11-10 10:44:56,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2018-11-10 10:44:56,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 850. [2018-11-10 10:44:56,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:44:56,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1282 transitions. [2018-11-10 10:44:56,730 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1282 transitions. Word has length 127 [2018-11-10 10:44:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:44:56,730 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1282 transitions. [2018-11-10 10:44:56,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:44:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1282 transitions. [2018-11-10 10:44:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-10 10:44:56,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:44:56,731 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, 1] [2018-11-10 10:44:56,731 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:44:56,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:44:56,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1437945597, now seen corresponding path program 1 times [2018-11-10 10:44:56,732 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:44:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:44:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:44:57,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:44:57,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:44:57,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:44:57,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:44:57,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:44:57,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:44:57,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:44:57,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:44:57,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:44:57,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-11-10 10:44:57,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:44:57,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:44:57,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:44:57,941 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:44:57,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:44:57,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:44:57,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:44:57,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:44:57,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:44:57,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:44:57,946 INFO L87 Difference]: Start difference. First operand 850 states and 1282 transitions. Second operand 7 states. [2018-11-10 10:45:00,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:00,816 INFO L93 Difference]: Finished difference Result 1716 states and 2591 transitions. [2018-11-10 10:45:00,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:00,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2018-11-10 10:45:00,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:00,817 INFO L225 Difference]: With dead ends: 1716 [2018-11-10 10:45:00,817 INFO L226 Difference]: Without dead ends: 917 [2018-11-10 10:45:00,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:45:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2018-11-10 10:45:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 850. [2018-11-10 10:45:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:45:00,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1280 transitions. [2018-11-10 10:45:00,875 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1280 transitions. Word has length 128 [2018-11-10 10:45:00,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:00,885 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1280 transitions. [2018-11-10 10:45:00,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1280 transitions. [2018-11-10 10:45:00,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-10 10:45:00,886 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:00,887 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, 1] [2018-11-10 10:45:00,887 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:00,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:00,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1674510476, now seen corresponding path program 1 times [2018-11-10 10:45:00,888 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:00,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:02,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:02,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:02,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:02,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:02,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:02,072 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,081 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,092 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:02,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:02,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:45:02,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:02,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:45:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:02,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:02,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:02,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:02,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:02,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:02,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:02,127 INFO L87 Difference]: Start difference. First operand 850 states and 1280 transitions. Second operand 7 states. [2018-11-10 10:45:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:04,909 INFO L93 Difference]: Finished difference Result 1718 states and 2585 transitions. [2018-11-10 10:45:04,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:04,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2018-11-10 10:45:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:04,911 INFO L225 Difference]: With dead ends: 1718 [2018-11-10 10:45:04,911 INFO L226 Difference]: Without dead ends: 919 [2018-11-10 10:45:04,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:45:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-11-10 10:45:04,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 850. [2018-11-10 10:45:04,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:45:04,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1278 transitions. [2018-11-10 10:45:04,951 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1278 transitions. Word has length 130 [2018-11-10 10:45:04,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:04,951 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1278 transitions. [2018-11-10 10:45:04,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:04,951 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1278 transitions. [2018-11-10 10:45:04,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-10 10:45:04,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:04,952 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, 1] [2018-11-10 10:45:04,952 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:04,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:04,952 INFO L82 PathProgramCache]: Analyzing trace with hash -519430606, now seen corresponding path program 1 times [2018-11-10 10:45:04,953 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:04,953 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:04,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:06,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:06,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:06,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:06,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:06,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:06,141 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,158 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:06,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:06,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:45:06,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:06,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:45:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:06,190 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:06,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:06,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:06,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:06,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:06,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:06,195 INFO L87 Difference]: Start difference. First operand 850 states and 1278 transitions. Second operand 7 states. [2018-11-10 10:45:09,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:09,000 INFO L93 Difference]: Finished difference Result 1718 states and 2581 transitions. [2018-11-10 10:45:09,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:09,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2018-11-10 10:45:09,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:09,002 INFO L225 Difference]: With dead ends: 1718 [2018-11-10 10:45:09,002 INFO L226 Difference]: Without dead ends: 919 [2018-11-10 10:45:09,003 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-11-10 10:45:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-11-10 10:45:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 850. [2018-11-10 10:45:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:45:09,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1276 transitions. [2018-11-10 10:45:09,046 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1276 transitions. Word has length 131 [2018-11-10 10:45:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:09,046 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1276 transitions. [2018-11-10 10:45:09,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1276 transitions. [2018-11-10 10:45:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-10 10:45:09,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:09,047 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, 1] [2018-11-10 10:45:09,047 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:09,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 889510201, now seen corresponding path program 1 times [2018-11-10 10:45:09,048 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:10,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:10,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:10,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:10,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:10,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:10,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,240 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,248 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:10,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:10,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:45:10,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:10,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:45:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:10,280 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:10,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:10,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:10,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:10,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:10,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:10,285 INFO L87 Difference]: Start difference. First operand 850 states and 1276 transitions. Second operand 7 states. [2018-11-10 10:45:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:11,059 INFO L93 Difference]: Finished difference Result 1718 states and 2577 transitions. [2018-11-10 10:45:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:11,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-11-10 10:45:11,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:11,060 INFO L225 Difference]: With dead ends: 1718 [2018-11-10 10:45:11,061 INFO L226 Difference]: Without dead ends: 919 [2018-11-10 10:45:11,061 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-11-10 10:45:11,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2018-11-10 10:45:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 850. [2018-11-10 10:45:11,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:45:11,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1274 transitions. [2018-11-10 10:45:11,120 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1274 transitions. Word has length 132 [2018-11-10 10:45:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:11,120 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1274 transitions. [2018-11-10 10:45:11,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1274 transitions. [2018-11-10 10:45:11,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 10:45:11,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:11,120 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, 1] [2018-11-10 10:45:11,121 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:11,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1578205463, now seen corresponding path program 1 times [2018-11-10 10:45:11,121 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:11,121 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:11,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:12,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:12,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:12,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:12,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:12,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:12,333 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,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-11-10 10:45:12,350 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:12,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:12,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-11-10 10:45:12,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:12,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:45:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:12,382 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:12,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:12,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:12,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:12,387 INFO L87 Difference]: Start difference. First operand 850 states and 1274 transitions. Second operand 7 states. [2018-11-10 10:45:15,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:15,203 INFO L93 Difference]: Finished difference Result 1698 states and 2547 transitions. [2018-11-10 10:45:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:15,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 133 [2018-11-10 10:45:15,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:15,204 INFO L225 Difference]: With dead ends: 1698 [2018-11-10 10:45:15,204 INFO L226 Difference]: Without dead ends: 899 [2018-11-10 10:45:15,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:45:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2018-11-10 10:45:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 850. [2018-11-10 10:45:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 850 states. [2018-11-10 10:45:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 850 states to 850 states and 1272 transitions. [2018-11-10 10:45:15,249 INFO L78 Accepts]: Start accepts. Automaton has 850 states and 1272 transitions. Word has length 133 [2018-11-10 10:45:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:15,250 INFO L481 AbstractCegarLoop]: Abstraction has 850 states and 1272 transitions. [2018-11-10 10:45:15,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 850 states and 1272 transitions. [2018-11-10 10:45:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-11-10 10:45:15,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:15,251 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:45:15,251 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:15,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1620388207, now seen corresponding path program 1 times [2018-11-10 10:45:15,252 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:15,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:15,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-10 10:45:15,402 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:15,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:15,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 10:45:15,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 10:45:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 10:45:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:45:15,405 INFO L87 Difference]: Start difference. First operand 850 states and 1272 transitions. Second operand 3 states. [2018-11-10 10:45:15,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:15,477 INFO L93 Difference]: Finished difference Result 1700 states and 2551 transitions. [2018-11-10 10:45:15,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 10:45:15,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2018-11-10 10:45:15,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:15,478 INFO L225 Difference]: With dead ends: 1700 [2018-11-10 10:45:15,478 INFO L226 Difference]: Without dead ends: 901 [2018-11-10 10:45:15,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 10:45:15,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2018-11-10 10:45:15,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 901. [2018-11-10 10:45:15,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2018-11-10 10:45:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1340 transitions. [2018-11-10 10:45:15,523 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1340 transitions. Word has length 133 [2018-11-10 10:45:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:15,524 INFO L481 AbstractCegarLoop]: Abstraction has 901 states and 1340 transitions. [2018-11-10 10:45:15,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 10:45:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1340 transitions. [2018-11-10 10:45:15,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-10 10:45:15,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:15,524 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-11-10 10:45:15,524 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:15,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 16288730, now seen corresponding path program 1 times [2018-11-10 10:45:15,525 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:15,525 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:15,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:16,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:16,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:16,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:16,681 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:16,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:16,683 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,687 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,699 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:16,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:45:16,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:16,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,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-11-10 10:45:16,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:16,734 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 64 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:16,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:16,753 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:45:16,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:16,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:45:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:16,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:45:16,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:45:16,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:45:16,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:45:16,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:45:16,770 INFO L87 Difference]: Start difference. First operand 901 states and 1340 transitions. Second operand 9 states. [2018-11-10 10:45:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:20,131 INFO L93 Difference]: Finished difference Result 2273 states and 3391 transitions. [2018-11-10 10:45:20,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:45:20,132 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 135 [2018-11-10 10:45:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:20,133 INFO L225 Difference]: With dead ends: 2273 [2018-11-10 10:45:20,133 INFO L226 Difference]: Without dead ends: 1423 [2018-11-10 10:45:20,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:45:20,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2018-11-10 10:45:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 983. [2018-11-10 10:45:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-11-10 10:45:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 1484 transitions. [2018-11-10 10:45:20,184 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 1484 transitions. Word has length 135 [2018-11-10 10:45:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:20,184 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 1484 transitions. [2018-11-10 10:45:20,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:45:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 1484 transitions. [2018-11-10 10:45:20,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-11-10 10:45:20,185 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:20,185 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:45:20,185 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:20,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:20,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1646530777, now seen corresponding path program 1 times [2018-11-10 10:45:20,186 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:20,186 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:21,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:21,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:21,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:21,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:21,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:21,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,386 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:21,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 17 treesize of output 13 [2018-11-10 10:45:21,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:21,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:21,422 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:21,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:21,446 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:45:21,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:21,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:45:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:45:21,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:45:21,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:45:21,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:45:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:45:21,479 INFO L87 Difference]: Start difference. First operand 983 states and 1484 transitions. Second operand 9 states. [2018-11-10 10:45:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:25,318 INFO L93 Difference]: Finished difference Result 2387 states and 3604 transitions. [2018-11-10 10:45:25,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:45:25,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 136 [2018-11-10 10:45:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:25,320 INFO L225 Difference]: With dead ends: 2387 [2018-11-10 10:45:25,320 INFO L226 Difference]: Without dead ends: 1455 [2018-11-10 10:45:25,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:45:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2018-11-10 10:45:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1025. [2018-11-10 10:45:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2018-11-10 10:45:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1570 transitions. [2018-11-10 10:45:25,376 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1570 transitions. Word has length 136 [2018-11-10 10:45:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:25,376 INFO L481 AbstractCegarLoop]: Abstraction has 1025 states and 1570 transitions. [2018-11-10 10:45:25,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:45:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1570 transitions. [2018-11-10 10:45:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-11-10 10:45:25,377 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:25,377 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, 1, 1] [2018-11-10 10:45:25,377 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash 547005718, now seen corresponding path program 1 times [2018-11-10 10:45:25,377 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:25,377 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:25,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:26,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:26,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:26,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:45:26,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:45:26,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:45:26,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:26,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:26,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:26,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:45:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-10 10:45:26,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:26,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:26,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:26,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:26,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:26,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:26,786 INFO L87 Difference]: Start difference. First operand 1025 states and 1570 transitions. Second operand 7 states. [2018-11-10 10:45:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:29,599 INFO L93 Difference]: Finished difference Result 2055 states and 3149 transitions. [2018-11-10 10:45:29,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:29,600 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2018-11-10 10:45:29,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:29,601 INFO L225 Difference]: With dead ends: 2055 [2018-11-10 10:45:29,601 INFO L226 Difference]: Without dead ends: 1081 [2018-11-10 10:45:29,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:45:29,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2018-11-10 10:45:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1031. [2018-11-10 10:45:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-11-10 10:45:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1576 transitions. [2018-11-10 10:45:29,657 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1576 transitions. Word has length 137 [2018-11-10 10:45:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:29,657 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1576 transitions. [2018-11-10 10:45:29,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1576 transitions. [2018-11-10 10:45:29,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-10 10:45:29,658 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:29,659 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, 1] [2018-11-10 10:45:29,659 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:29,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:29,659 INFO L82 PathProgramCache]: Analyzing trace with hash -110275771, now seen corresponding path program 1 times [2018-11-10 10:45:29,659 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:29,660 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:29,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:30,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:30,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:30,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:45:30,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:45:30,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:30,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:45:30,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:30,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:45:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:30,487 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:30,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:30,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:45:30,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:45:30,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:45:30,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:45:30,491 INFO L87 Difference]: Start difference. First operand 1031 states and 1576 transitions. Second operand 4 states. [2018-11-10 10:45:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:33,184 INFO L93 Difference]: Finished difference Result 2119 states and 3231 transitions. [2018-11-10 10:45:33,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:45:33,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-11-10 10:45:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:33,186 INFO L225 Difference]: With dead ends: 2119 [2018-11-10 10:45:33,186 INFO L226 Difference]: Without dead ends: 1139 [2018-11-10 10:45:33,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:45:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2018-11-10 10:45:33,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 1031. [2018-11-10 10:45:33,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2018-11-10 10:45:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1574 transitions. [2018-11-10 10:45:33,239 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1574 transitions. Word has length 156 [2018-11-10 10:45:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:33,239 INFO L481 AbstractCegarLoop]: Abstraction has 1031 states and 1574 transitions. [2018-11-10 10:45:33,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:45:33,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1574 transitions. [2018-11-10 10:45:33,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-10 10:45:33,240 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:33,240 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, 1, 1] [2018-11-10 10:45:33,240 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:33,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:33,240 INFO L82 PathProgramCache]: Analyzing trace with hash -509724029, now seen corresponding path program 1 times [2018-11-10 10:45:33,241 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:33,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:34,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:35,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:35,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:35,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:35,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:35,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,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-11-10 10:45:35,046 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:35,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:45:35,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:35,062 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:35,086 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 150 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:35,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:35,106 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:45:35,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:35,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:45:35,122 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:35,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:45:35,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:45:35,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:45:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:45:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:45:35,127 INFO L87 Difference]: Start difference. First operand 1031 states and 1574 transitions. Second operand 9 states. [2018-11-10 10:45:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:38,622 INFO L93 Difference]: Finished difference Result 2587 states and 3962 transitions. [2018-11-10 10:45:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:45:38,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 165 [2018-11-10 10:45:38,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:38,624 INFO L225 Difference]: With dead ends: 2587 [2018-11-10 10:45:38,624 INFO L226 Difference]: Without dead ends: 1607 [2018-11-10 10:45:38,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:45:38,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2018-11-10 10:45:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1163. [2018-11-10 10:45:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-11-10 10:45:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1802 transitions. [2018-11-10 10:45:38,688 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1802 transitions. Word has length 165 [2018-11-10 10:45:38,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:38,688 INFO L481 AbstractCegarLoop]: Abstraction has 1163 states and 1802 transitions. [2018-11-10 10:45:38,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:45:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1802 transitions. [2018-11-10 10:45:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-10 10:45:38,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:38,689 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, 1, 1] [2018-11-10 10:45:38,689 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:38,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:38,689 INFO L82 PathProgramCache]: Analyzing trace with hash -951232617, now seen corresponding path program 1 times [2018-11-10 10:45:38,690 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:38,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:40,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:40,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:40,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:40,484 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:40,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:40,487 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,495 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,508 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:40,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:45:40,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 13 treesize of output 5 [2018-11-10 10:45:40,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:40,548 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 160 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:40,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:40,570 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:45:40,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:40,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:45:40,588 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:40,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:45:40,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:45:40,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:45:40,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:45:40,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:45:40,593 INFO L87 Difference]: Start difference. First operand 1163 states and 1802 transitions. Second operand 9 states. [2018-11-10 10:45:43,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:43,934 INFO L93 Difference]: Finished difference Result 2777 states and 4278 transitions. [2018-11-10 10:45:43,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:45:43,934 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 171 [2018-11-10 10:45:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:43,936 INFO L225 Difference]: With dead ends: 2777 [2018-11-10 10:45:43,936 INFO L226 Difference]: Without dead ends: 1665 [2018-11-10 10:45:43,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:45:43,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-11-10 10:45:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1239. [2018-11-10 10:45:44,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-11-10 10:45:44,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1932 transitions. [2018-11-10 10:45:44,001 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1932 transitions. Word has length 171 [2018-11-10 10:45:44,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:44,001 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1932 transitions. [2018-11-10 10:45:44,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:45:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1932 transitions. [2018-11-10 10:45:44,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-11-10 10:45:44,002 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:44,002 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, 1, 1] [2018-11-10 10:45:44,002 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:44,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1393470026, now seen corresponding path program 1 times [2018-11-10 10:45:44,003 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:44,003 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:44,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:45,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:45,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:45,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:45,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:45,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:45,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:45,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:45:45,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:45,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:45,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:45,556 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:45:45,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:45,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:45:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:45,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:45:45,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:45:45,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:45:45,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:45:45,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:45:45,580 INFO L87 Difference]: Start difference. First operand 1239 states and 1932 transitions. Second operand 9 states. [2018-11-10 10:45:51,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:51,095 INFO L93 Difference]: Finished difference Result 2841 states and 4387 transitions. [2018-11-10 10:45:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:45:51,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2018-11-10 10:45:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:51,097 INFO L225 Difference]: With dead ends: 2841 [2018-11-10 10:45:51,097 INFO L226 Difference]: Without dead ends: 1653 [2018-11-10 10:45:51,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:45:51,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1653 states. [2018-11-10 10:45:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1653 to 1239. [2018-11-10 10:45:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-11-10 10:45:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1928 transitions. [2018-11-10 10:45:51,156 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1928 transitions. Word has length 172 [2018-11-10 10:45:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:51,156 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1928 transitions. [2018-11-10 10:45:51,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:45:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1928 transitions. [2018-11-10 10:45:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-11-10 10:45:51,157 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:51,158 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, 1] [2018-11-10 10:45:51,158 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:51,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:51,158 INFO L82 PathProgramCache]: Analyzing trace with hash 612511719, now seen corresponding path program 1 times [2018-11-10 10:45:51,158 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:51,158 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:45:51,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:52,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:52,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:45:52,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:45:52,950 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:52,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:52,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,959 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,971 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:45:52,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:45:52,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:45:52,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:52,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:45:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:45:53,011 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:45:53,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:45:53,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:45:53,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:45:53,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:45:53,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:45:53,016 INFO L87 Difference]: Start difference. First operand 1239 states and 1928 transitions. Second operand 7 states. [2018-11-10 10:45:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:45:53,801 INFO L93 Difference]: Finished difference Result 2457 states and 3832 transitions. [2018-11-10 10:45:53,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:45:53,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2018-11-10 10:45:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:45:53,803 INFO L225 Difference]: With dead ends: 2457 [2018-11-10 10:45:53,803 INFO L226 Difference]: Without dead ends: 1269 [2018-11-10 10:45:53,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:45:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-11-10 10:45:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1239. [2018-11-10 10:45:53,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1239 states. [2018-11-10 10:45:53,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1239 states to 1239 states and 1926 transitions. [2018-11-10 10:45:53,866 INFO L78 Accepts]: Start accepts. Automaton has 1239 states and 1926 transitions. Word has length 173 [2018-11-10 10:45:53,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:45:53,866 INFO L481 AbstractCegarLoop]: Abstraction has 1239 states and 1926 transitions. [2018-11-10 10:45:53,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:45:53,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1239 states and 1926 transitions. [2018-11-10 10:45:53,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-11-10 10:45:53,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:45:53,868 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, 1, 1, 1] [2018-11-10 10:45:53,868 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:45:53,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:45:53,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1855463037, now seen corresponding path program 1 times [2018-11-10 10:45:53,869 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:45:53,869 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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-11-10 10:45:53,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:56,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:56,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:56,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 32 [2018-11-10 10:45:56,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-10 10:45:56,518 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,525 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2018-11-10 10:45:56,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:45:56,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:45:56,656 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:45:56,665 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:45:56,670 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,682 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,698 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:56,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:45:56,733 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,737 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,759 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:62, output treesize:65 [2018-11-10 10:45:56,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:56,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-11-10 10:45:56,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:45:56,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-11-10 10:45:56,902 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:45:56,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-11-10 10:45:56,903 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,909 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:46 [2018-11-10 10:45:56,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 10:45:56,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-10 10:45:56,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:46 [2018-11-10 10:45:56,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:56,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-11-10 10:45:56,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:56,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-10 10:45:57,035 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:57,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 10:45:57,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 14 treesize of output 13 [2018-11-10 10:45:57,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-10 10:45:57,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 24 treesize of output 1 [2018-11-10 10:45:57,100 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2018-11-10 10:45:57,130 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:45:57,131 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:57,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:57,132 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:45:57,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-10 10:45:57,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:45:57,146 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:45:57,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,155 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:111, output treesize:13 [2018-11-10 10:45:57,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 23 treesize of output 18 [2018-11-10 10:45:57,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:57,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:57,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:45:57,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 17 treesize of output 13 [2018-11-10 10:45:57,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:57,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:57,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:57,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-10 10:45:57,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2018-11-10 10:45:57,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-10 10:45:57,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:32 [2018-11-10 10:45:57,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-10 10:45:57,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:45:57,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 10:45:57,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 10:45:57,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,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-11-10 10:45:57,613 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 10:45:57,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:45:57,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-11-10 10:45:57,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:57,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:10 [2018-11-10 10:45:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:57,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:45:57,925 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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-11-10 10:45:57,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:45:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:45:58,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:45:58,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:45:58,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:58,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:45:58,343 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:45:58,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:45:58,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:45:58,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,387 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:45:58,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,409 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,418 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,426 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,443 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:48, output treesize:23 [2018-11-10 10:45:58,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 40 [2018-11-10 10:45:58,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-11-10 10:45:58,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 10:45:58,623 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:45:58,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-10 10:45:58,624 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,628 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:38, output treesize:12 [2018-11-10 10:45:58,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:45:58,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:45:58,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 10:45:58,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-11-10 10:45:58,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-11-10 10:45:58,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-10 10:45:58,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:45:58,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-10 10:45:58,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:45:58,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:45:58,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,759 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:13 [2018-11-10 10:45:58,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:45:58,765 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:45:58,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:45:58,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:45:58,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:45:58,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:45:58,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:45:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:58,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:45:58,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2018-11-10 10:45:58,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:45:58,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2018-11-10 10:45:58,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-11-10 10:45:58,990 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:45:58,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:59,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:59,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:45:59,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-11-10 10:45:59,314 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-11-10 10:45:59,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:45:59,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9] total 24 [2018-11-10 10:45:59,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-10 10:45:59,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-10 10:45:59,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2018-11-10 10:45:59,334 INFO L87 Difference]: Start difference. First operand 1239 states and 1926 transitions. Second operand 24 states. [2018-11-10 10:46:07,671 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2018-11-10 10:46:09,243 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 65 [2018-11-10 10:46:10,776 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-10 10:46:13,233 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2018-11-10 10:46:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:14,362 INFO L93 Difference]: Finished difference Result 2807 states and 4314 transitions. [2018-11-10 10:46:14,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:46:14,363 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 181 [2018-11-10 10:46:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:14,364 INFO L225 Difference]: With dead ends: 2807 [2018-11-10 10:46:14,364 INFO L226 Difference]: Without dead ends: 1619 [2018-11-10 10:46:14,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 697 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=182, Invalid=630, Unknown=0, NotChecked=0, Total=812 [2018-11-10 10:46:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2018-11-10 10:46:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1171. [2018-11-10 10:46:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:14,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1808 transitions. [2018-11-10 10:46:14,434 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1808 transitions. Word has length 181 [2018-11-10 10:46:14,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:14,434 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1808 transitions. [2018-11-10 10:46:14,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-10 10:46:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1808 transitions. [2018-11-10 10:46:14,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 10:46:14,435 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:14,436 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:46:14,436 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:14,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:14,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1131458112, now seen corresponding path program 1 times [2018-11-10 10:46:14,436 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 96 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:14,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:15,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:15,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:15,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:15,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:15,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:15,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 15 treesize of output 3 [2018-11-10 10:46:15,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:15,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:15,349 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:15,349 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:15,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:15,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:15,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:15,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:15,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:15,355 INFO L87 Difference]: Start difference. First operand 1171 states and 1808 transitions. Second operand 4 states. [2018-11-10 10:46:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:17,830 INFO L93 Difference]: Finished difference Result 2332 states and 3607 transitions. [2018-11-10 10:46:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:17,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 10:46:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:17,832 INFO L225 Difference]: With dead ends: 2332 [2018-11-10 10:46:17,832 INFO L226 Difference]: Without dead ends: 1212 [2018-11-10 10:46:17,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-11-10 10:46:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1171. [2018-11-10 10:46:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1806 transitions. [2018-11-10 10:46:17,905 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1806 transitions. Word has length 183 [2018-11-10 10:46:17,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:17,906 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1806 transitions. [2018-11-10 10:46:17,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1806 transitions. [2018-11-10 10:46:17,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-10 10:46:17,907 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:17,907 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:46:17,907 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:17,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:17,908 INFO L82 PathProgramCache]: Analyzing trace with hash 407557548, now seen corresponding path program 1 times [2018-11-10 10:46:17,908 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:17,908 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 97 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:17,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:18,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:18,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:18,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:18,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:18,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:18,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:18,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:18,781 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:18,795 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:18,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:18,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:18,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:18,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:18,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:18,801 INFO L87 Difference]: Start difference. First operand 1171 states and 1806 transitions. Second operand 4 states. [2018-11-10 10:46:21,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:21,260 INFO L93 Difference]: Finished difference Result 2332 states and 3603 transitions. [2018-11-10 10:46:21,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:21,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 183 [2018-11-10 10:46:21,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:21,261 INFO L225 Difference]: With dead ends: 2332 [2018-11-10 10:46:21,261 INFO L226 Difference]: Without dead ends: 1212 [2018-11-10 10:46:21,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-11-10 10:46:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1171. [2018-11-10 10:46:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1804 transitions. [2018-11-10 10:46:21,337 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1804 transitions. Word has length 183 [2018-11-10 10:46:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:21,337 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1804 transitions. [2018-11-10 10:46:21,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:21,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1804 transitions. [2018-11-10 10:46:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:46:21,338 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:21,338 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:46:21,338 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:21,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:21,338 INFO L82 PathProgramCache]: Analyzing trace with hash -685038692, now seen corresponding path program 1 times [2018-11-10 10:46:21,339 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:21,339 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 98 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:21,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:22,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:22,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:22,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:22,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:22,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:22,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:22,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:22,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:22,232 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:22,232 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:22,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:22,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:22,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:22,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:22,236 INFO L87 Difference]: Start difference. First operand 1171 states and 1804 transitions. Second operand 4 states. [2018-11-10 10:46:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:24,686 INFO L93 Difference]: Finished difference Result 2332 states and 3599 transitions. [2018-11-10 10:46:24,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:24,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 10:46:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:24,687 INFO L225 Difference]: With dead ends: 2332 [2018-11-10 10:46:24,687 INFO L226 Difference]: Without dead ends: 1212 [2018-11-10 10:46:24,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:24,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-11-10 10:46:24,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1171. [2018-11-10 10:46:24,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:24,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1802 transitions. [2018-11-10 10:46:24,756 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1802 transitions. Word has length 184 [2018-11-10 10:46:24,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:24,757 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1802 transitions. [2018-11-10 10:46:24,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:24,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1802 transitions. [2018-11-10 10:46:24,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-11-10 10:46:24,758 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:24,758 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, 1] [2018-11-10 10:46:24,758 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:24,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:24,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1168680300, now seen corresponding path program 1 times [2018-11-10 10:46:24,759 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:24,759 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 99 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:24,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:25,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:25,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 13 treesize of output 10 [2018-11-10 10:46:25,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:25,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:25,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:25,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:25,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:25,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 19 treesize of output 15 [2018-11-10 10:46:25,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:25,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:25,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:25,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-11-10 10:46:25,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:46:25,636 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:25,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:25,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:25,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:25,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:25,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:25,641 INFO L87 Difference]: Start difference. First operand 1171 states and 1802 transitions. Second operand 4 states. [2018-11-10 10:46:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:28,251 INFO L93 Difference]: Finished difference Result 2399 states and 3683 transitions. [2018-11-10 10:46:28,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:28,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2018-11-10 10:46:28,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:28,253 INFO L225 Difference]: With dead ends: 2399 [2018-11-10 10:46:28,253 INFO L226 Difference]: Without dead ends: 1279 [2018-11-10 10:46:28,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2018-11-10 10:46:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1171. [2018-11-10 10:46:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:28,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1800 transitions. [2018-11-10 10:46:28,323 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1800 transitions. Word has length 184 [2018-11-10 10:46:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:28,323 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1800 transitions. [2018-11-10 10:46:28,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1800 transitions. [2018-11-10 10:46:28,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:46:28,324 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:28,324 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:46:28,324 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:28,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -267034489, now seen corresponding path program 1 times [2018-11-10 10:46:28,325 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:28,325 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 100 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:28,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:29,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:29,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:29,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:29,171 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:29,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:29,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:29,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:29,187 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:29,199 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:29,200 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:29,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:29,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:29,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:29,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:29,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:29,204 INFO L87 Difference]: Start difference. First operand 1171 states and 1800 transitions. Second operand 4 states. [2018-11-10 10:46:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:31,665 INFO L93 Difference]: Finished difference Result 2332 states and 3591 transitions. [2018-11-10 10:46:31,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:31,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:46:31,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:31,666 INFO L225 Difference]: With dead ends: 2332 [2018-11-10 10:46:31,666 INFO L226 Difference]: Without dead ends: 1212 [2018-11-10 10:46:31,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2018-11-10 10:46:31,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1171. [2018-11-10 10:46:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1798 transitions. [2018-11-10 10:46:31,736 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1798 transitions. Word has length 185 [2018-11-10 10:46:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:31,737 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1798 transitions. [2018-11-10 10:46:31,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:31,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1798 transitions. [2018-11-10 10:46:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:46:31,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:31,738 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, 1] [2018-11-10 10:46:31,738 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:31,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:31,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1887352056, now seen corresponding path program 1 times [2018-11-10 10:46:31,738 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:31,738 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 101 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:31,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:32,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:32,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:32,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:32,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,590 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,596 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:32,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:32,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:32,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:32,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:32,619 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:32,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:32,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:32,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:32,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:32,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:32,623 INFO L87 Difference]: Start difference. First operand 1171 states and 1798 transitions. Second operand 4 states. [2018-11-10 10:46:35,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:35,229 INFO L93 Difference]: Finished difference Result 2379 states and 3651 transitions. [2018-11-10 10:46:35,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:35,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:46:35,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:35,231 INFO L225 Difference]: With dead ends: 2379 [2018-11-10 10:46:35,231 INFO L226 Difference]: Without dead ends: 1259 [2018-11-10 10:46:35,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:35,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2018-11-10 10:46:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1171. [2018-11-10 10:46:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1796 transitions. [2018-11-10 10:46:35,305 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1796 transitions. Word has length 185 [2018-11-10 10:46:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:35,306 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1796 transitions. [2018-11-10 10:46:35,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1796 transitions. [2018-11-10 10:46:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:46:35,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:35,307 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, 1] [2018-11-10 10:46:35,307 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:35,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:35,307 INFO L82 PathProgramCache]: Analyzing trace with hash -868599580, now seen corresponding path program 1 times [2018-11-10 10:46:35,308 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:35,308 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 102 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:35,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:36,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:36,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:36,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:36,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,164 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:36,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:36,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:36,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:36,200 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:36,214 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:36,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:36,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:36,218 INFO L87 Difference]: Start difference. First operand 1171 states and 1796 transitions. Second operand 4 states. [2018-11-10 10:46:38,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:38,825 INFO L93 Difference]: Finished difference Result 2379 states and 3647 transitions. [2018-11-10 10:46:38,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:38,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:46:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:38,827 INFO L225 Difference]: With dead ends: 2379 [2018-11-10 10:46:38,827 INFO L226 Difference]: Without dead ends: 1259 [2018-11-10 10:46:38,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2018-11-10 10:46:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1171. [2018-11-10 10:46:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:38,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1794 transitions. [2018-11-10 10:46:38,901 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1794 transitions. Word has length 185 [2018-11-10 10:46:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:38,901 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1794 transitions. [2018-11-10 10:46:38,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1794 transitions. [2018-11-10 10:46:38,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-11-10 10:46:38,903 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:38,903 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, 1] [2018-11-10 10:46:38,903 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:38,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1858950004, now seen corresponding path program 1 times [2018-11-10 10:46:38,904 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:38,904 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 103 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:38,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:39,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:39,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:39,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:39,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:39,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:39,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:39,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:39,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:39,814 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:46:39,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:39,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:39,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:39,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:39,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:39,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:39,818 INFO L87 Difference]: Start difference. First operand 1171 states and 1794 transitions. Second operand 4 states. [2018-11-10 10:46:42,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:42,429 INFO L93 Difference]: Finished difference Result 2375 states and 3639 transitions. [2018-11-10 10:46:42,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:42,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2018-11-10 10:46:42,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:42,431 INFO L225 Difference]: With dead ends: 2375 [2018-11-10 10:46:42,431 INFO L226 Difference]: Without dead ends: 1255 [2018-11-10 10:46:42,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:42,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2018-11-10 10:46:42,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1171. [2018-11-10 10:46:42,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:46:42,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1792 transitions. [2018-11-10 10:46:42,506 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1792 transitions. Word has length 185 [2018-11-10 10:46:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:42,506 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1792 transitions. [2018-11-10 10:46:42,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:42,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1792 transitions. [2018-11-10 10:46:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:46:42,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:42,508 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:46:42,508 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:42,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:42,508 INFO L82 PathProgramCache]: Analyzing trace with hash -265056809, now seen corresponding path program 1 times [2018-11-10 10:46:42,509 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:42,509 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 104 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:42,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:43,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:43,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:43,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:43,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:43,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:43,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:43,412 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:43,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:43,429 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:43,429 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:43,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:43,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:43,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:43,433 INFO L87 Difference]: Start difference. First operand 1171 states and 1792 transitions. Second operand 4 states. [2018-11-10 10:46:45,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:45,857 INFO L93 Difference]: Finished difference Result 2312 states and 3549 transitions. [2018-11-10 10:46:45,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:45,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:46:45,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:45,858 INFO L225 Difference]: With dead ends: 2312 [2018-11-10 10:46:45,858 INFO L226 Difference]: Without dead ends: 1192 [2018-11-10 10:46:45,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2018-11-10 10:46:45,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1139. [2018-11-10 10:46:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:46:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1748 transitions. [2018-11-10 10:46:45,946 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1748 transitions. Word has length 186 [2018-11-10 10:46:45,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:45,946 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1748 transitions. [2018-11-10 10:46:45,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1748 transitions. [2018-11-10 10:46:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-11-10 10:46:45,947 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:45,947 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, 1] [2018-11-10 10:46:45,947 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:45,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1591203996, now seen corresponding path program 1 times [2018-11-10 10:46:45,948 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:45,948 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 105 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:46,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:46,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:46,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:46,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:46,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:46,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:46,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:46,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:46,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:46,865 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:46,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:46,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:46,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:46,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:46,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:46,870 INFO L87 Difference]: Start difference. First operand 1139 states and 1748 transitions. Second operand 4 states. [2018-11-10 10:46:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:49,464 INFO L93 Difference]: Finished difference Result 2311 states and 3547 transitions. [2018-11-10 10:46:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:49,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2018-11-10 10:46:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:49,466 INFO L225 Difference]: With dead ends: 2311 [2018-11-10 10:46:49,466 INFO L226 Difference]: Without dead ends: 1223 [2018-11-10 10:46:49,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-11-10 10:46:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1139. [2018-11-10 10:46:49,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:46:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1746 transitions. [2018-11-10 10:46:49,547 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1746 transitions. Word has length 186 [2018-11-10 10:46:49,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:49,548 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1746 transitions. [2018-11-10 10:46:49,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1746 transitions. [2018-11-10 10:46:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 10:46:49,549 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:49,549 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, 1] [2018-11-10 10:46:49,549 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:49,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1706612159, now seen corresponding path program 1 times [2018-11-10 10:46:49,550 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:49,550 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 106 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:49,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:50,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:50,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:46:50,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:50,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:50,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:50,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:50,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:50,458 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:50,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:50,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:50,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:50,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:50,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:50,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:50,477 INFO L87 Difference]: Start difference. First operand 1139 states and 1746 transitions. Second operand 4 states. [2018-11-10 10:46:53,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:53,069 INFO L93 Difference]: Finished difference Result 2311 states and 3543 transitions. [2018-11-10 10:46:53,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:53,069 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2018-11-10 10:46:53,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:53,071 INFO L225 Difference]: With dead ends: 2311 [2018-11-10 10:46:53,071 INFO L226 Difference]: Without dead ends: 1223 [2018-11-10 10:46:53,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:46:53,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2018-11-10 10:46:53,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1139. [2018-11-10 10:46:53,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:46:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1744 transitions. [2018-11-10 10:46:53,146 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1744 transitions. Word has length 187 [2018-11-10 10:46:53,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:53,146 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1744 transitions. [2018-11-10 10:46:53,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:53,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1744 transitions. [2018-11-10 10:46:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 10:46:53,147 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:53,147 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, 1] [2018-11-10 10:46:53,148 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:53,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:53,148 INFO L82 PathProgramCache]: Analyzing trace with hash 788447135, now seen corresponding path program 1 times [2018-11-10 10:46:53,148 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:53,149 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 107 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:53,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:54,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:54,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 13 treesize of output 10 [2018-11-10 10:46:54,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:54,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:54,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:54,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:54,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:54,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:46:54,080 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:54,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:54,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:54,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:54,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:54,085 INFO L87 Difference]: Start difference. First operand 1139 states and 1744 transitions. Second operand 4 states. [2018-11-10 10:46:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:46:56,655 INFO L93 Difference]: Finished difference Result 2291 states and 3513 transitions. [2018-11-10 10:46:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:46:56,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-11-10 10:46:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:46:56,657 INFO L225 Difference]: With dead ends: 2291 [2018-11-10 10:46:56,657 INFO L226 Difference]: Without dead ends: 1203 [2018-11-10 10:46:56,658 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-11-10 10:46:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-11-10 10:46:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1139. [2018-11-10 10:46:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:46:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1742 transitions. [2018-11-10 10:46:56,733 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1742 transitions. Word has length 188 [2018-11-10 10:46:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:46:56,733 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1742 transitions. [2018-11-10 10:46:56,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:46:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1742 transitions. [2018-11-10 10:46:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-11-10 10:46:56,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:46:56,734 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, 1] [2018-11-10 10:46:56,734 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:46:56,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:46:56,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1887100689, now seen corresponding path program 1 times [2018-11-10 10:46:56,735 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:46:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 108 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:46:56,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:46:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:46:57,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:46:57,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-11-10 10:46:57,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:46:57,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:46:57,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:46:57,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:46:57,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:46:57,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:46:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:46:57,655 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:46:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:46:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:46:57,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:46:57,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:46:57,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:46:57,659 INFO L87 Difference]: Start difference. First operand 1139 states and 1742 transitions. Second operand 4 states. [2018-11-10 10:47:00,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:00,227 INFO L93 Difference]: Finished difference Result 2291 states and 3509 transitions. [2018-11-10 10:47:00,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:47:00,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-11-10 10:47:00,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:00,228 INFO L225 Difference]: With dead ends: 2291 [2018-11-10 10:47:00,228 INFO L226 Difference]: Without dead ends: 1203 [2018-11-10 10:47:00,229 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-11-10 10:47:00,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2018-11-10 10:47:00,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1139. [2018-11-10 10:47:00,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:47:00,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1740 transitions. [2018-11-10 10:47:00,300 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1740 transitions. Word has length 188 [2018-11-10 10:47:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:00,300 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1740 transitions. [2018-11-10 10:47:00,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:47:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1740 transitions. [2018-11-10 10:47:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-11-10 10:47:00,301 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:00,301 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, 1] [2018-11-10 10:47:00,301 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:00,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:00,301 INFO L82 PathProgramCache]: Analyzing trace with hash -379091089, now seen corresponding path program 1 times [2018-11-10 10:47:00,302 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:00,302 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 109 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:00,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:01,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:01,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:47:01,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:47:01,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-10 10:47:01,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 19 treesize of output 15 [2018-11-10 10:47:01,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 15 treesize of output 3 [2018-11-10 10:47:01,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:01,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-11-10 10:47:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:01,220 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 10:47:01,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 10:47:01,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 10:47:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 10:47:01,225 INFO L87 Difference]: Start difference. First operand 1139 states and 1740 transitions. Second operand 4 states. [2018-11-10 10:47:03,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:03,765 INFO L93 Difference]: Finished difference Result 2275 states and 3479 transitions. [2018-11-10 10:47:03,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 10:47:03,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2018-11-10 10:47:03,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:03,767 INFO L225 Difference]: With dead ends: 2275 [2018-11-10 10:47:03,767 INFO L226 Difference]: Without dead ends: 1187 [2018-11-10 10:47:03,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 10:47:03,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-11-10 10:47:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1139. [2018-11-10 10:47:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:47:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1738 transitions. [2018-11-10 10:47:03,848 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1738 transitions. Word has length 189 [2018-11-10 10:47:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:03,849 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1738 transitions. [2018-11-10 10:47:03,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 10:47:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1738 transitions. [2018-11-10 10:47:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-11-10 10:47:03,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:03,850 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, 1, 1] [2018-11-10 10:47:03,850 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:03,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:03,850 INFO L82 PathProgramCache]: Analyzing trace with hash 509764522, now seen corresponding path program 1 times [2018-11-10 10:47:03,850 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:03,850 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 110 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:05,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:05,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 18 treesize of output 15 [2018-11-10 10:47:05,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:05,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:05,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:05,659 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:05,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:47:05,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:47:05,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 230 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:05,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:47:05,734 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:47:05,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:05,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:47:05,749 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:05,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:47:05,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:47:05,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:47:05,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:47:05,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:47:05,755 INFO L87 Difference]: Start difference. First operand 1139 states and 1738 transitions. Second operand 9 states. [2018-11-10 10:47:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:11,043 INFO L93 Difference]: Finished difference Result 2641 states and 3997 transitions. [2018-11-10 10:47:11,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:47:11,043 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2018-11-10 10:47:11,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:11,045 INFO L225 Difference]: With dead ends: 2641 [2018-11-10 10:47:11,045 INFO L226 Difference]: Without dead ends: 1553 [2018-11-10 10:47:11,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:47:11,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2018-11-10 10:47:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1139. [2018-11-10 10:47:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2018-11-10 10:47:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1730 transitions. [2018-11-10 10:47:11,124 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1730 transitions. Word has length 193 [2018-11-10 10:47:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:11,124 INFO L481 AbstractCegarLoop]: Abstraction has 1139 states and 1730 transitions. [2018-11-10 10:47:11,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:47:11,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1730 transitions. [2018-11-10 10:47:11,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 10:47:11,126 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:11,126 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, 1, 1] [2018-11-10 10:47:11,126 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:11,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1359167878, now seen corresponding path program 1 times [2018-11-10 10:47:11,127 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:11,127 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 111 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:11,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:12,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:12,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:12,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:12,999 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:13,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:13,002 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,008 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,020 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:13,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:47:13,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:47:13,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:13,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:47:13,057 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:47:13,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:13,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:13,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:13,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:13,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:13,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:13,063 INFO L87 Difference]: Start difference. First operand 1139 states and 1730 transitions. Second operand 7 states. [2018-11-10 10:47:16,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:16,026 INFO L93 Difference]: Finished difference Result 2427 states and 3693 transitions. [2018-11-10 10:47:16,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:16,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2018-11-10 10:47:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:16,027 INFO L225 Difference]: With dead ends: 2427 [2018-11-10 10:47:16,027 INFO L226 Difference]: Without dead ends: 1339 [2018-11-10 10:47:16,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:16,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-10 10:47:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1163. [2018-11-10 10:47:16,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1163 states. [2018-11-10 10:47:16,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1764 transitions. [2018-11-10 10:47:16,103 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1764 transitions. Word has length 194 [2018-11-10 10:47:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:16,103 INFO L481 AbstractCegarLoop]: Abstraction has 1163 states and 1764 transitions. [2018-11-10 10:47:16,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1764 transitions. [2018-11-10 10:47:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 10:47:16,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:16,104 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, 1, 1] [2018-11-10 10:47:16,104 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:16,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:16,105 INFO L82 PathProgramCache]: Analyzing trace with hash 179847782, now seen corresponding path program 1 times [2018-11-10 10:47:16,105 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:16,106 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 112 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:16,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:17,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:17,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:17,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:17,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:17,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:17,978 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:17,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:17,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:17,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:17,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:18,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:47:18,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:47:18,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:18,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:18,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:18,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:47:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:47:18,034 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:18,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:18,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:18,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:18,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:18,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:18,040 INFO L87 Difference]: Start difference. First operand 1163 states and 1764 transitions. Second operand 7 states. [2018-11-10 10:47:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:18,953 INFO L93 Difference]: Finished difference Result 2451 states and 3725 transitions. [2018-11-10 10:47:18,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:18,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 194 [2018-11-10 10:47:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:18,954 INFO L225 Difference]: With dead ends: 2451 [2018-11-10 10:47:18,954 INFO L226 Difference]: Without dead ends: 1339 [2018-11-10 10:47:18,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-11-10 10:47:19,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1165. [2018-11-10 10:47:19,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 10:47:19,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1766 transitions. [2018-11-10 10:47:19,036 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1766 transitions. Word has length 194 [2018-11-10 10:47:19,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:19,036 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1766 transitions. [2018-11-10 10:47:19,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:19,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1766 transitions. [2018-11-10 10:47:19,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-11-10 10:47:19,037 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:19,037 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, 1, 1] [2018-11-10 10:47:19,037 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:19,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:19,038 INFO L82 PathProgramCache]: Analyzing trace with hash -810502642, now seen corresponding path program 1 times [2018-11-10 10:47:19,038 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:19,038 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 113 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:19,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:20,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:20,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:20,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:20,838 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:20,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:20,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,858 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:20,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:47:20,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 13 treesize of output 5 [2018-11-10 10:47:20,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 233 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:20,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:47:20,916 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:47:20,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:20,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:47:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:20,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:47:20,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:47:20,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:47:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:47:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:47:20,943 INFO L87 Difference]: Start difference. First operand 1165 states and 1766 transitions. Second operand 9 states. [2018-11-10 10:47:24,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:24,202 INFO L93 Difference]: Finished difference Result 2643 states and 3983 transitions. [2018-11-10 10:47:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:47:24,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 194 [2018-11-10 10:47:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:24,204 INFO L225 Difference]: With dead ends: 2643 [2018-11-10 10:47:24,204 INFO L226 Difference]: Without dead ends: 1529 [2018-11-10 10:47:24,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:47:24,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2018-11-10 10:47:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1165. [2018-11-10 10:47:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1165 states. [2018-11-10 10:47:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1758 transitions. [2018-11-10 10:47:24,293 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1758 transitions. Word has length 194 [2018-11-10 10:47:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:24,293 INFO L481 AbstractCegarLoop]: Abstraction has 1165 states and 1758 transitions. [2018-11-10 10:47:24,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:47:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1758 transitions. [2018-11-10 10:47:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-11-10 10:47:24,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:24,294 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, 1, 1] [2018-11-10 10:47:24,295 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:24,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 845893154, now seen corresponding path program 1 times [2018-11-10 10:47:24,296 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:24,296 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 114 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:24,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:26,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:26,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:26,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:26,224 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:26,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:26,226 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,232 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,250 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:26,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:47:26,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:47:26,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:26,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:47:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:47:26,290 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:26,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:26,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:26,296 INFO L87 Difference]: Start difference. First operand 1165 states and 1758 transitions. Second operand 7 states. [2018-11-10 10:47:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:27,251 INFO L93 Difference]: Finished difference Result 2449 states and 3703 transitions. [2018-11-10 10:47:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:27,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 195 [2018-11-10 10:47:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:27,252 INFO L225 Difference]: With dead ends: 2449 [2018-11-10 10:47:27,252 INFO L226 Difference]: Without dead ends: 1335 [2018-11-10 10:47:27,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:27,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-11-10 10:47:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1167. [2018-11-10 10:47:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-11-10 10:47:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1760 transitions. [2018-11-10 10:47:27,343 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1760 transitions. Word has length 195 [2018-11-10 10:47:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:27,343 INFO L481 AbstractCegarLoop]: Abstraction has 1167 states and 1760 transitions. [2018-11-10 10:47:27,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1760 transitions. [2018-11-10 10:47:27,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:47:27,345 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:27,345 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, 1, 1] [2018-11-10 10:47:27,345 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -52787519, now seen corresponding path program 1 times [2018-11-10 10:47:27,346 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 115 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:27,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:29,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:29,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:29,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:29,263 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:29,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:29,265 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:29,270 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:29,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:29,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-11-10 10:47:29,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:29,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 19 treesize of output 15 [2018-11-10 10:47:29,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:47:29,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:29,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:29,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-11-10 10:47:29,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:47:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:47:29,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:29,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:29,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:29,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:29,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:29,358 INFO L87 Difference]: Start difference. First operand 1167 states and 1760 transitions. Second operand 7 states. [2018-11-10 10:47:32,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:32,333 INFO L93 Difference]: Finished difference Result 2451 states and 3703 transitions. [2018-11-10 10:47:32,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:32,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-11-10 10:47:32,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:32,335 INFO L225 Difference]: With dead ends: 2451 [2018-11-10 10:47:32,335 INFO L226 Difference]: Without dead ends: 1335 [2018-11-10 10:47:32,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:32,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2018-11-10 10:47:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1169. [2018-11-10 10:47:32,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:47:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1762 transitions. [2018-11-10 10:47:32,421 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1762 transitions. Word has length 196 [2018-11-10 10:47:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:32,421 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1762 transitions. [2018-11-10 10:47:32,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1762 transitions. [2018-11-10 10:47:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-11-10 10:47:32,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:32,422 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, 1] [2018-11-10 10:47:32,423 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:32,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash 687803246, now seen corresponding path program 1 times [2018-11-10 10:47:32,423 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 116 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:34,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:34,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:47:34,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:47:34,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:47:34,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:47:34,178 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:34,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:34,183 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:47:34,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:47:34,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 13 treesize of output 5 [2018-11-10 10:47:34,201 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:34,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 10:47:34,228 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:34,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:34,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:34,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:34,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:34,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:34,233 INFO L87 Difference]: Start difference. First operand 1169 states and 1762 transitions. Second operand 7 states. [2018-11-10 10:47:37,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:37,020 INFO L93 Difference]: Finished difference Result 2337 states and 3525 transitions. [2018-11-10 10:47:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:37,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-11-10 10:47:37,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:37,022 INFO L225 Difference]: With dead ends: 2337 [2018-11-10 10:47:37,022 INFO L226 Difference]: Without dead ends: 1219 [2018-11-10 10:47:37,023 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-11-10 10:47:37,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2018-11-10 10:47:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1169. [2018-11-10 10:47:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:47:37,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1760 transitions. [2018-11-10 10:47:37,107 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1760 transitions. Word has length 196 [2018-11-10 10:47:37,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:37,107 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1760 transitions. [2018-11-10 10:47:37,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1760 transitions. [2018-11-10 10:47:37,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 10:47:37,108 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:37,108 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, 1] [2018-11-10 10:47:37,108 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:37,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:37,108 INFO L82 PathProgramCache]: Analyzing trace with hash 244896961, now seen corresponding path program 1 times [2018-11-10 10:47:37,109 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:37,109 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 117 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:37,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:38,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:38,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:47:38,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:47:38,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-10 10:47:38,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-10 10:47:38,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:38,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:38,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,869 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:13 [2018-11-10 10:47:38,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:47:38,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:47:38,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:38,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:38,900 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-11-10 10:47:38,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:38,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:38,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:38,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:38,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:38,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:38,905 INFO L87 Difference]: Start difference. First operand 1169 states and 1760 transitions. Second operand 7 states. [2018-11-10 10:47:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:41,700 INFO L93 Difference]: Finished difference Result 2325 states and 3505 transitions. [2018-11-10 10:47:41,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:41,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-11-10 10:47:41,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:41,702 INFO L225 Difference]: With dead ends: 2325 [2018-11-10 10:47:41,702 INFO L226 Difference]: Without dead ends: 1207 [2018-11-10 10:47:41,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:41,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2018-11-10 10:47:41,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1169. [2018-11-10 10:47:41,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-10 10:47:41,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1758 transitions. [2018-11-10 10:47:41,789 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1758 transitions. Word has length 197 [2018-11-10 10:47:41,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:41,789 INFO L481 AbstractCegarLoop]: Abstraction has 1169 states and 1758 transitions. [2018-11-10 10:47:41,789 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:41,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1758 transitions. [2018-11-10 10:47:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 10:47:41,790 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:41,790 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, 1, 1] [2018-11-10 10:47:41,790 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:41,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:41,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2081631965, now seen corresponding path program 1 times [2018-11-10 10:47:41,791 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:41,791 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 118 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:43,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:43,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:43,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:43,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:43,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:43,679 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,685 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,697 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:43,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:47:43,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:47:43,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,711 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:43,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:47:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2018-11-10 10:47:43,737 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:47:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:47:43,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:47:43,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:47:43,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:47:43,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:47:43,743 INFO L87 Difference]: Start difference. First operand 1169 states and 1758 transitions. Second operand 7 states. [2018-11-10 10:47:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:46,650 INFO L93 Difference]: Finished difference Result 2433 states and 3669 transitions. [2018-11-10 10:47:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:47:46,650 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2018-11-10 10:47:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:46,652 INFO L225 Difference]: With dead ends: 2433 [2018-11-10 10:47:46,652 INFO L226 Difference]: Without dead ends: 1315 [2018-11-10 10:47:46,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:47:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2018-11-10 10:47:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1171. [2018-11-10 10:47:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2018-11-10 10:47:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1760 transitions. [2018-11-10 10:47:46,742 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1760 transitions. Word has length 197 [2018-11-10 10:47:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:46,742 INFO L481 AbstractCegarLoop]: Abstraction has 1171 states and 1760 transitions. [2018-11-10 10:47:46,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:47:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1760 transitions. [2018-11-10 10:47:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-11-10 10:47:46,743 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:46,743 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, 1, 1] [2018-11-10 10:47:46,744 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:46,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:46,744 INFO L82 PathProgramCache]: Analyzing trace with hash -593915859, now seen corresponding path program 1 times [2018-11-10 10:47:46,745 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:46,745 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 119 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:46,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:48,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:48,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:48,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:48,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:48,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,689 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:48,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 17 treesize of output 13 [2018-11-10 10:47:48,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:47:48,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:48,727 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 224 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:48,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:47:48,757 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:47:48,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:48,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-11-10 10:47:48,778 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 225 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:48,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:47:48,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:47:48,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:47:48,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:47:48,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:47:48,784 INFO L87 Difference]: Start difference. First operand 1171 states and 1760 transitions. Second operand 9 states. [2018-11-10 10:47:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:54,074 INFO L93 Difference]: Finished difference Result 2711 states and 4065 transitions. [2018-11-10 10:47:54,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:47:54,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 197 [2018-11-10 10:47:54,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:54,075 INFO L225 Difference]: With dead ends: 2711 [2018-11-10 10:47:54,075 INFO L226 Difference]: Without dead ends: 1591 [2018-11-10 10:47:54,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:47:54,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2018-11-10 10:47:54,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1229. [2018-11-10 10:47:54,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:47:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1850 transitions. [2018-11-10 10:47:54,159 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1850 transitions. Word has length 197 [2018-11-10 10:47:54,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:54,159 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1850 transitions. [2018-11-10 10:47:54,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:47:54,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1850 transitions. [2018-11-10 10:47:54,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-11-10 10:47:54,160 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:54,160 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, 1, 1] [2018-11-10 10:47:54,160 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:54,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:54,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1054932977, now seen corresponding path program 1 times [2018-11-10 10:47:54,161 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:54,161 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 120 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:54,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:47:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:47:56,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:47:56,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:47:56,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:47:56,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:47:56,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:47:56,087 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,092 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,105 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:47:56,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:47:56,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:47:56,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:47:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 227 proven. 1 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:56,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:47:56,164 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:47:56,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:47:56,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:47:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 10:47:56,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:47:56,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:47:56,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:47:56,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:47:56,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:47:56,193 INFO L87 Difference]: Start difference. First operand 1229 states and 1850 transitions. Second operand 9 states. [2018-11-10 10:47:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:47:59,603 INFO L93 Difference]: Finished difference Result 2729 states and 4083 transitions. [2018-11-10 10:47:59,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:47:59,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2018-11-10 10:47:59,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:47:59,604 INFO L225 Difference]: With dead ends: 2729 [2018-11-10 10:47:59,604 INFO L226 Difference]: Without dead ends: 1551 [2018-11-10 10:47:59,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:47:59,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-11-10 10:47:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1229. [2018-11-10 10:47:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:47:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1840 transitions. [2018-11-10 10:47:59,706 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1840 transitions. Word has length 198 [2018-11-10 10:47:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:47:59,706 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1840 transitions. [2018-11-10 10:47:59,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:47:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1840 transitions. [2018-11-10 10:47:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 10:47:59,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:47:59,707 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, 1] [2018-11-10 10:47:59,707 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:47:59,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:47:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash 989481722, now seen corresponding path program 1 times [2018-11-10 10:47:59,707 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:47:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 121 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:47:59,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:02,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:02,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 18 treesize of output 15 [2018-11-10 10:48:02,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:02,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:02,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-11-10 10:48:02,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,062 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:02,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 19 treesize of output 15 [2018-11-10 10:48:02,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:48:02,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:02,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:48:02,123 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:48:02,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:48:02,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:48:02,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:48:02,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:48:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:48:02,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:48:02,129 INFO L87 Difference]: Start difference. First operand 1229 states and 1840 transitions. Second operand 7 states. [2018-11-10 10:48:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:03,087 INFO L93 Difference]: Finished difference Result 2545 states and 3805 transitions. [2018-11-10 10:48:03,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:48:03,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2018-11-10 10:48:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:03,088 INFO L225 Difference]: With dead ends: 2545 [2018-11-10 10:48:03,088 INFO L226 Difference]: Without dead ends: 1367 [2018-11-10 10:48:03,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:48:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-11-10 10:48:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1229. [2018-11-10 10:48:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1838 transitions. [2018-11-10 10:48:03,181 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1838 transitions. Word has length 202 [2018-11-10 10:48:03,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:03,181 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1838 transitions. [2018-11-10 10:48:03,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:48:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1838 transitions. [2018-11-10 10:48:03,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-11-10 10:48:03,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:03,182 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 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-11-10 10:48:03,182 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:03,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1766469914, now seen corresponding path program 1 times [2018-11-10 10:48:03,183 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:03,183 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 122 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:48:03,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:05,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:05,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:05,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:05,481 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:05,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:05,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,503 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:05,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:48:05,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:48:05,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:05,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:48:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:48:05,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:48:05,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:48:05,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:48:05,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:48:05,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:48:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:48:05,548 INFO L87 Difference]: Start difference. First operand 1229 states and 1838 transitions. Second operand 7 states. [2018-11-10 10:48:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:06,500 INFO L93 Difference]: Finished difference Result 2545 states and 3801 transitions. [2018-11-10 10:48:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:48:06,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2018-11-10 10:48:06,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:06,502 INFO L225 Difference]: With dead ends: 2545 [2018-11-10 10:48:06,502 INFO L226 Difference]: Without dead ends: 1367 [2018-11-10 10:48:06,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:48:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-11-10 10:48:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1229. [2018-11-10 10:48:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1836 transitions. [2018-11-10 10:48:06,592 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1836 transitions. Word has length 202 [2018-11-10 10:48:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:06,593 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1836 transitions. [2018-11-10 10:48:06,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:48:06,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1836 transitions. [2018-11-10 10:48:06,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-11-10 10:48:06,594 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:06,594 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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-11-10 10:48:06,594 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:06,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:06,594 INFO L82 PathProgramCache]: Analyzing trace with hash 639586722, now seen corresponding path program 1 times [2018-11-10 10:48:06,595 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:06,595 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 123 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:48:06,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:08,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:08,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:08,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:08,853 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:08,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:08,855 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,863 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,868 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:08,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:48:08,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:48:08,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:08,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:48:08,920 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:48:08,920 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:48:08,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:48:08,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:48:08,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:48:08,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:48:08,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:48:08,926 INFO L87 Difference]: Start difference. First operand 1229 states and 1836 transitions. Second operand 7 states. [2018-11-10 10:48:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:09,900 INFO L93 Difference]: Finished difference Result 2545 states and 3797 transitions. [2018-11-10 10:48:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:48:09,900 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 203 [2018-11-10 10:48:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:09,901 INFO L225 Difference]: With dead ends: 2545 [2018-11-10 10:48:09,901 INFO L226 Difference]: Without dead ends: 1367 [2018-11-10 10:48:09,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:48:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-11-10 10:48:09,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1229. [2018-11-10 10:48:09,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:09,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1834 transitions. [2018-11-10 10:48:09,988 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1834 transitions. Word has length 203 [2018-11-10 10:48:09,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:09,988 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1834 transitions. [2018-11-10 10:48:09,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:48:09,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1834 transitions. [2018-11-10 10:48:09,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-11-10 10:48:09,989 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:09,989 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 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-11-10 10:48:09,989 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:09,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2141647681, now seen corresponding path program 1 times [2018-11-10 10:48:09,990 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:09,990 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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-11-10 10:48:10,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:12,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:12,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:12,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:12,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:12,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:12,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,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-11-10 10:48:12,281 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:12,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:48:12,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-11-10 10:48:12,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:12,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:48:12,320 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:48:12,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:48:12,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:48:12,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:48:12,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:48:12,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:48:12,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:48:12,327 INFO L87 Difference]: Start difference. First operand 1229 states and 1834 transitions. Second operand 7 states. [2018-11-10 10:48:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:13,280 INFO L93 Difference]: Finished difference Result 2545 states and 3793 transitions. [2018-11-10 10:48:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:48:13,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2018-11-10 10:48:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:13,281 INFO L225 Difference]: With dead ends: 2545 [2018-11-10 10:48:13,282 INFO L226 Difference]: Without dead ends: 1367 [2018-11-10 10:48:13,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:48:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2018-11-10 10:48:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1229. [2018-11-10 10:48:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:13,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1832 transitions. [2018-11-10 10:48:13,373 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1832 transitions. Word has length 204 [2018-11-10 10:48:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:13,373 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1832 transitions. [2018-11-10 10:48:13,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:48:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1832 transitions. [2018-11-10 10:48:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 10:48:13,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:13,375 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, 1, 1] [2018-11-10 10:48:13,375 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:13,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1228448596, now seen corresponding path program 1 times [2018-11-10 10:48:13,376 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:13,376 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 125 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:48:13,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:15,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:15,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:15,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:15,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:15,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:15,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,197 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:15,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:48:15,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:48:15,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:48:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 250 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 10:48:15,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:48:15,275 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:48:15,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:15,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-11-10 10:48:15,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:48:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 10:48:15,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:48:15,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:48:15,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:48:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:48:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:48:15,303 INFO L87 Difference]: Start difference. First operand 1229 states and 1832 transitions. Second operand 9 states. [2018-11-10 10:48:18,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:18,533 INFO L93 Difference]: Finished difference Result 2729 states and 4045 transitions. [2018-11-10 10:48:18,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:48:18,534 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2018-11-10 10:48:18,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:18,535 INFO L225 Difference]: With dead ends: 2729 [2018-11-10 10:48:18,536 INFO L226 Difference]: Without dead ends: 1551 [2018-11-10 10:48:18,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 405 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:48:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-11-10 10:48:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1229. [2018-11-10 10:48:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1826 transitions. [2018-11-10 10:48:18,630 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1826 transitions. Word has length 205 [2018-11-10 10:48:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:18,630 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1826 transitions. [2018-11-10 10:48:18,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:48:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1826 transitions. [2018-11-10 10:48:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 10:48:18,631 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:18,632 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 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-11-10 10:48:18,632 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:18,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1389646429, now seen corresponding path program 1 times [2018-11-10 10:48:18,633 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:18,633 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/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-11-10 10:48:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:20,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:20,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:20,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:20,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:20,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:20,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:20,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:20,974 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:20,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:20,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:20,986 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:20,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-10 10:48:20,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-11-10 10:48:20,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:21,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:21,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:21,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-11-10 10:48:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-11-10 10:48:21,026 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-10 10:48:21,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 10:48:21,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 10:48:21,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-10 10:48:21,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 10:48:21,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-10 10:48:21,032 INFO L87 Difference]: Start difference. First operand 1229 states and 1826 transitions. Second operand 7 states. [2018-11-10 10:48:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:23,995 INFO L93 Difference]: Finished difference Result 2525 states and 3749 transitions. [2018-11-10 10:48:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 10:48:23,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 205 [2018-11-10 10:48:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:23,997 INFO L225 Difference]: With dead ends: 2525 [2018-11-10 10:48:23,997 INFO L226 Difference]: Without dead ends: 1347 [2018-11-10 10:48:23,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-10 10:48:23,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2018-11-10 10:48:24,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1229. [2018-11-10 10:48:24,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2018-11-10 10:48:24,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1824 transitions. [2018-11-10 10:48:24,093 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1824 transitions. Word has length 205 [2018-11-10 10:48:24,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:24,093 INFO L481 AbstractCegarLoop]: Abstraction has 1229 states and 1824 transitions. [2018-11-10 10:48:24,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-10 10:48:24,093 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1824 transitions. [2018-11-10 10:48:24,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-11-10 10:48:24,094 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:24,094 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-11-10 10:48:24,094 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:24,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1285901395, now seen corresponding path program 1 times [2018-11-10 10:48:24,095 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:24,095 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 127 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:48:24,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:28,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:48:28,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-10 10:48:28,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:48:28,703 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,706 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:48:28,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:48:28,750 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:48:28,757 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:48:28,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,779 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,796 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,814 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 10:48:28,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:48:28,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:48:28,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,881 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-10 10:48:28,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:48:28,904 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:28,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:28,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-10 10:48:28,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:48:28,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,090 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 10:48:29,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-10 10:48:29,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 10:48:29,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-11-10 10:48:29,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-10 10:48:29,211 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,213 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,226 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 10:48:29,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 10:48:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-10 10:48:29,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 10:48:29,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:48:29,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:48:29,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:48:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:48:29,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:48:29,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2018-11-10 10:48:29,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:48:29,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:29,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 72 [2018-11-10 10:48:29,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:29,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 10:48:29,596 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:48:29,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 39 treesize of output 23 [2018-11-10 10:48:29,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:29,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:29,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 10:48:29,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,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 37 treesize of output 29 [2018-11-10 10:48:29,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-10 10:48:29,645 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,650 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:29,679 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 10:48:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:48:29,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:48:29,810 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:48:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:30,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:30,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:48:30,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:48:30,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:48:30,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:48:30,203 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,210 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:48:30,223 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:48:30,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:48:30,343 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:48:30,351 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,354 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:48:30,361 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,385 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,395 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,422 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 10:48:30,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:48:30,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:48:30,531 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-10 10:48:30,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:48:30,569 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:30,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-10 10:48:30,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:48:30,637 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:48:30,654 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:30,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:30,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:30,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:48:30,722 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 10:48:30,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 31 treesize of output 28 [2018-11-10 10:48:30,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 10:48:30,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,812 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-11-10 10:48:30,830 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:30,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-11-10 10:48:30,830 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-11-10 10:48:30,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:30,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-10 10:48:30,849 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:48:30,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:48:30,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-10 10:48:30,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-10 10:48:30,866 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,867 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,874 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 10:48:30,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:48:30,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 13 treesize of output 5 [2018-11-10 10:48:30,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:30,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:48:30,974 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:48:30,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:48:31,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2018-11-10 10:48:31,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:48:31,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,037 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:31,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 72 [2018-11-10 10:48:31,114 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:31,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 10:48:31,166 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:48:31,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-11-10 10:48:31,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:31,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:48:31,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 10:48:31,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,207 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,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 37 treesize of output 29 [2018-11-10 10:48:31,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-10 10:48:31,213 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:31,249 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 10:48:31,306 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:48:31,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:48:31,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 10:48:31,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:48:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:48:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:48:31,327 INFO L87 Difference]: Start difference. First operand 1229 states and 1824 transitions. Second operand 19 states. [2018-11-10 10:48:54,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:48:54,903 INFO L93 Difference]: Finished difference Result 7513 states and 11101 transitions. [2018-11-10 10:48:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-10 10:48:54,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 205 [2018-11-10 10:48:54,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:48:54,908 INFO L225 Difference]: With dead ends: 7513 [2018-11-10 10:48:54,908 INFO L226 Difference]: Without dead ends: 6335 [2018-11-10 10:48:54,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 800 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 10:48:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6335 states. [2018-11-10 10:48:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6335 to 1383. [2018-11-10 10:48:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-11-10 10:48:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2088 transitions. [2018-11-10 10:48:55,034 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2088 transitions. Word has length 205 [2018-11-10 10:48:55,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:48:55,034 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2088 transitions. [2018-11-10 10:48:55,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:48:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2088 transitions. [2018-11-10 10:48:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:48:55,035 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:48:55,035 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, 1, 1] [2018-11-10 10:48:55,035 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:48:55,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:48:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1431834539, now seen corresponding path program 1 times [2018-11-10 10:48:55,036 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:48:55,036 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 129 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:48:55,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:48:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:48:56,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:48:56,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-10 10:48:56,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 10:48:56,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:48:56,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-10 10:48:56,856 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,861 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,873 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2018-11-10 10:48:56,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:48:56,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:48:56,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:48:56,915 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 253 proven. 1 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 10:48:56,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:48:56,936 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 10:48:56,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:48:56,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2018-11-10 10:48:56,954 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-11-10 10:48:56,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 10:48:56,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2018-11-10 10:48:56,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 10:48:56,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 10:48:56,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-10 10:48:56,960 INFO L87 Difference]: Start difference. First operand 1383 states and 2088 transitions. Second operand 9 states. [2018-11-10 10:49:02,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:49:02,270 INFO L93 Difference]: Finished difference Result 3037 states and 4556 transitions. [2018-11-10 10:49:02,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 10:49:02,270 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 206 [2018-11-10 10:49:02,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:49:02,272 INFO L225 Difference]: With dead ends: 3037 [2018-11-10 10:49:02,272 INFO L226 Difference]: Without dead ends: 1705 [2018-11-10 10:49:02,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-11-10 10:49:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2018-11-10 10:49:02,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1383. [2018-11-10 10:49:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1383 states. [2018-11-10 10:49:02,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 2082 transitions. [2018-11-10 10:49:02,385 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 2082 transitions. Word has length 206 [2018-11-10 10:49:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:49:02,386 INFO L481 AbstractCegarLoop]: Abstraction has 1383 states and 2082 transitions. [2018-11-10 10:49:02,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 10:49:02,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 2082 transitions. [2018-11-10 10:49:02,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-11-10 10:49:02,387 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:49:02,387 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, 1] [2018-11-10 10:49:02,387 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:49:02,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:49:02,388 INFO L82 PathProgramCache]: Analyzing trace with hash -66657434, now seen corresponding path program 1 times [2018-11-10 10:49:02,388 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:49:02,388 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 130 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:49:02,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:49:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:49:06,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:49:06,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:49:06,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:06,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 13 treesize of output 10 [2018-11-10 10:49:06,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:49:06,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:06,920 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:06,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:49:06,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:49:06,959 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:06,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:49:06,965 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:06,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:06,968 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:06,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:49:06,975 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:06,988 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:06,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,005 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,023 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:48, output treesize:14 [2018-11-10 10:49:07,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:49:07,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:49:07,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:07,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-10 10:49:07,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:49:07,122 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:07,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-10 10:49:07,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:49:07,193 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,216 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,239 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,294 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:119, output treesize:76 [2018-11-10 10:49:07,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-11-10 10:49:07,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 10:49:07,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 33 [2018-11-10 10:49:07,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-10 10:49:07,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,414 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:64, output treesize:21 [2018-11-10 10:49:07,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 10:49:07,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-10 10:49:07,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:13 [2018-11-10 10:49:07,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-10 10:49:07,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:49:07,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,458 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,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-11-10 10:49:07,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:49:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 100 proven. 120 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:49:07,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:49:07,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 100 [2018-11-10 10:49:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:49:07,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,624 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:07,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 74 [2018-11-10 10:49:07,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:07,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 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 10:49:07,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:49:07,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-11-10 10:49:07,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:07,790 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:07,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 10:49:07,791 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,795 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-10 10:49:07,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-10 10:49:07,800 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,804 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:07,835 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:128, output treesize:10 [2018-11-10 10:49:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:49:07,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 10:49:07,973 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 10:49:07,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:49:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:49:08,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:49:08,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-10 10:49:08,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:49:08,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:49:08,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:49:08,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,392 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,395 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:49:08,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,436 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,480 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 20 [2018-11-10 10:49:08,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-10 10:49:08,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2018-11-10 10:49:08,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,554 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-10 10:49:08,563 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,577 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,587 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,596 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,623 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:58, output treesize:23 [2018-11-10 10:49:08,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-11-10 10:49:08,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-10 10:49:08,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,741 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2018-11-10 10:49:08,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 10:49:08,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:08,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:08,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 47 [2018-11-10 10:49:08,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 23 [2018-11-10 10:49:08,838 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-10 10:49:08,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:08,874 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:08,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:08,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 10:49:08,923 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:126, output treesize:90 [2018-11-10 10:49:09,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 31 treesize of output 28 [2018-11-10 10:49:09,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-10 10:49:09,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,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 49 treesize of output 33 [2018-11-10 10:49:09,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 9 [2018-11-10 10:49:09,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-10 10:49:09,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-10 10:49:09,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-10 10:49:09,054 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,055 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,061 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:71, output treesize:13 [2018-11-10 10:49:09,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 17 treesize of output 13 [2018-11-10 10:49:09,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-10 10:49:09,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-10 10:49:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 96 proven. 124 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:49:09,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 10:49:09,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 98 [2018-11-10 10:49:09,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-11-10 10:49:09,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:49:09,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 72 [2018-11-10 10:49:09,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:09,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-10 10:49:09,429 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-10 10:49:09,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-10 10:49:09,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2018-11-10 10:49:09,467 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,471 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2018-11-10 10:49:09,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:09,476 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 10:49:09,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-11-10 10:49:09,477 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,481 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:49:09,510 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:126, output treesize:10 [2018-11-10 10:49:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2018-11-10 10:49:09,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-10 10:49:09,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8, 8] total 19 [2018-11-10 10:49:09,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 10:49:09,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 10:49:09,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-11-10 10:49:09,592 INFO L87 Difference]: Start difference. First operand 1383 states and 2082 transitions. Second operand 19 states. [2018-11-10 10:49:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 10:49:37,298 INFO L93 Difference]: Finished difference Result 7085 states and 10552 transitions. [2018-11-10 10:49:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 10:49:37,299 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 206 [2018-11-10 10:49:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 10:49:37,302 INFO L225 Difference]: With dead ends: 7085 [2018-11-10 10:49:37,302 INFO L226 Difference]: Without dead ends: 5753 [2018-11-10 10:49:37,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 803 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2018-11-10 10:49:37,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5753 states. [2018-11-10 10:49:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5753 to 1377. [2018-11-10 10:49:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1377 states. [2018-11-10 10:49:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 2072 transitions. [2018-11-10 10:49:37,428 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 2072 transitions. Word has length 206 [2018-11-10 10:49:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 10:49:37,428 INFO L481 AbstractCegarLoop]: Abstraction has 1377 states and 2072 transitions. [2018-11-10 10:49:37,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 10:49:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 2072 transitions. [2018-11-10 10:49:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-11-10 10:49:37,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 10:49:37,429 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, 1, 1, 1] [2018-11-10 10:49:37,429 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 10:49:37,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:49:37,429 INFO L82 PathProgramCache]: Analyzing trace with hash 23711206, now seen corresponding path program 1 times [2018-11-10 10:49:37,430 INFO L225 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-10 10:49:37,430 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/cvc4nyu Starting monitored process 132 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-10 10:49:37,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:49:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:49:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:49:46,663 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-10 10:49:46,681 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,682 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,683 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,683 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:49:46 BoogieIcfgContainer [2018-11-10 10:49:46,761 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 10:49:46,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:49:46,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:49:46,762 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:49:46,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:41:03" (3/4) ... [2018-11-10 10:49:46,765 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-10 10:49:46,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,775 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,776 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-10 10:49:46,850 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e53d124b-b5c9-41ac-b3d1-5759797bf5da/bin-2019/utaipan/witness.graphml [2018-11-10 10:49:46,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:49:46,851 INFO L168 Benchmark]: Toolchain (without parser) took 528094.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 49.8 MB). Free memory was 944.4 MB in the beginning and 920.8 MB in the end (delta: 23.6 MB). Peak memory consumption was 73.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.64 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 772.6 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 772.6 MB in the beginning and 1.1 GB in the end (delta: -295.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: Boogie Preprocessor took 75.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: RCFGBuilder took 3408.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 889.8 MB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,852 INFO L168 Benchmark]: TraceAbstraction took 523574.89 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.5 MB). Free memory was 889.8 MB in the beginning and 939.2 MB in the end (delta: -49.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:49:46,853 INFO L168 Benchmark]: Witness Printer took 89.38 ms. Allocated memory is still 1.1 GB. Free memory was 939.2 MB in the beginning and 920.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:49:46,854 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 803.64 ms. Allocated memory is still 1.0 GB. Free memory was 944.4 MB in the beginning and 772.6 MB in the end (delta: 171.8 MB). Peak memory consumption was 171.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 82.3 MB). Free memory was 772.6 MB in the beginning and 1.1 GB in the end (delta: -295.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 75.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3408.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 889.8 MB in the end (delta: 171.4 MB). Peak memory consumption was 171.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 523574.89 ms. Allocated memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -32.5 MB). Free memory was 889.8 MB in the beginning and 939.2 MB in the end (delta: -49.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 89.38 ms. Allocated memory is still 1.1 GB. Free memory was 939.2 MB in the beginning and 920.8 MB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 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: 1762]: 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={2096138218: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={2096138218: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={2096138218: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={2096138218: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={2096138218:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2096138218: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={2096138218: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={2096138218:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2096138218: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 [L1598] CALL, EXPR s->session [L1598] RET, EXPR s->session [L1598] CALL, EXPR s->s3 [L1598] RET, EXPR s->s3 [L1598] CALL, EXPR (s->s3)->tmp.new_cipher [L1598] RET, EXPR (s->s3)->tmp.new_cipher [L1598] CALL (s->session)->cipher = (s->s3)->tmp.new_cipher [L1598] RET (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1609] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1612] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1619] COND FALSE !(ret <= 0) [L1624] CALL s->state = 8672 [L1624] RET s->state = 8672 [L1625] CALL s->init_num = 0 [L1625] RET s->init_num = 0 [L1626] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={2096138218:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2096138218: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 [L1635] ret = __VERIFIER_nondet_int() [L1636] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1639] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1642] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1649] COND FALSE !(ret <= 0) [L1654] CALL s->state = 8448 [L1654] RET s->state = 8448 [L1655] CALL s->hit [L1655] RET s->hit [L1655] COND TRUE s->hit [L1656] CALL, EXPR s->s3 [L1656] RET, EXPR s->s3 [L1656] CALL (s->s3)->tmp.next_state = 8640 [L1656] RET (s->s3)->tmp.next_state = 8640 [L1660] CALL s->init_num = 0 [L1660] RET s->init_num = 0 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={2096138218:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2096138218: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={2096138218: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 [L1721] CALL, EXPR s->s3 [L1721] RET, EXPR s->s3 [L1721] CALL, EXPR (s->s3)->tmp.reuse_message [L1721] RET, EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={2096138218:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={2096138218: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={2096138218:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={2096138218:0}] [L1762] __VERIFIER_error() VAL [init=1, SSLv3_server_data={2096138218:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 1 error locations. UNSAFE Result, 523.5s OverallTime, 128 OverallIterations, 8 TraceHistogramMax, 366.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 25087 SDtfs, 50994 SDslu, 63956 SDs, 0 SdLazy, 54362 SolverSat, 4539 SolverUnsat, 125 SolverUnknown, 0 SolverNotchecked, 338.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20444 GetRequests, 19588 SyntacticMatches, 6 SemanticMatches, 850 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1383occurred in iteration=125, 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.3s AutomataMinimizationTime, 127 MinimizatonAttempts, 22207 StatesRemovedByMinimization, 125 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 4.4s SsaConstructionTime, 94.4s SatisfiabilityAnalysisTime, 44.7s InterpolantComputationTime, 17111 NumberOfCodeBlocks, 17111 NumberOfCodeBlocksAsserted, 131 NumberOfCheckSat, 20072 ConstructedInterpolants, 168 QuantifiedInterpolants, 15309843 SizeOfPredicates, 2135 NumberOfNonLiveVariables, 103563 ConjunctsInSsa, 2361 ConjunctsInUnsatCore, 149 InterpolantComputations, 124 PerfectInterpolantSequences, 20852/22901 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...