./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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 df2b0e0d9b5ef7fc63f69443b04bd0a125d39bfd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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 df2b0e0d9b5ef7fc63f69443b04bd0a125d39bfd ....................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: null --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 01:14:51,469 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:14:51,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:14:51,479 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:14:51,479 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:14:51,480 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:14:51,480 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:14:51,482 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:14:51,483 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:14:51,483 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:14:51,484 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:14:51,484 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:14:51,485 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:14:51,485 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:14:51,486 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:14:51,487 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:14:51,487 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:14:51,488 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:14:51,490 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:14:51,490 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:14:51,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:14:51,491 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:14:51,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:14:51,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:14:51,492 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:14:51,493 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:14:51,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:14:51,494 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:14:51,494 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:14:51,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:14:51,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:14:51,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:14:51,496 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:14:51,496 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:14:51,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:14:51,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:14:51,497 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 01:14:51,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:14:51,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:14:51,505 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:14:51,506 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:14:51,506 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:14:51,506 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:14:51,506 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:14:51,506 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 01:14:51,507 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:14:51,507 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:14:51,507 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 01:14:51,507 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 01:14:51,507 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:14:51,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:14:51,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:14:51,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 01:14:51,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:14:51,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:14:51,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:14:51,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:14:51,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:14:51,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:14:51,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:14:51,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:14:51,509 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:14:51,510 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:14:51,510 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:14:51,511 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 01:14:51,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:14:51,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 01:14:51,511 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 01:14:51,511 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_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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 -> df2b0e0d9b5ef7fc63f69443b04bd0a125d39bfd [2018-12-02 01:14:51,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:14:51,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:14:51,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:14:51,544 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:14:51,544 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:14:51,545 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c [2018-12-02 01:14:51,584 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/ebf3a4326/f5630b73f5e0478da728177cd871d2e0/FLAG28da7bf99 [2018-12-02 01:14:52,025 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:14:52,025 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c [2018-12-02 01:14:52,034 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/ebf3a4326/f5630b73f5e0478da728177cd871d2e0/FLAG28da7bf99 [2018-12-02 01:14:52,042 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/ebf3a4326/f5630b73f5e0478da728177cd871d2e0 [2018-12-02 01:14:52,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:14:52,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:14:52,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:14:52,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:14:52,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:14:52,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,051 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@630b4775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52, skipping insertion in model container [2018-12-02 01:14:52,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,057 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:14:52,088 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:14:52,324 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:14:52,332 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:14:52,389 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:14:52,401 INFO L195 MainTranslator]: Completed translation [2018-12-02 01:14:52,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52 WrapperNode [2018-12-02 01:14:52,401 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 01:14:52,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 01:14:52,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 01:14:52,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 01:14:52,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,419 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 01:14:52,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 01:14:52,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 01:14:52,425 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 01:14:52,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... [2018-12-02 01:14:52,471 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 01:14:52,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 01:14:52,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 01:14:52,471 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 01:14:52,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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-12-02 01:14:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 01:14:52,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 01:14:52,504 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-12-02 01:14:52,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-12-02 01:14:52,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 01:14:52,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 01:14:52,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 01:14:52,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 01:14:52,665 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-02 01:14:52,665 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 01:14:53,004 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 01:14:53,004 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 01:14:53,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:53 BoogieIcfgContainer [2018-12-02 01:14:53,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 01:14:53,005 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 01:14:53,005 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 01:14:53,007 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 01:14:53,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:14:52" (1/3) ... [2018-12-02 01:14:53,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7f4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:53, skipping insertion in model container [2018-12-02 01:14:53,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:14:52" (2/3) ... [2018-12-02 01:14:53,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a7f4372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:14:53, skipping insertion in model container [2018-12-02 01:14:53,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:53" (3/3) ... [2018-12-02 01:14:53,009 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.08_false-unreach-call.i.cil.c [2018-12-02 01:14:53,015 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 01:14:53,020 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 01:14:53,029 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 01:14:53,048 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 01:14:53,048 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 01:14:53,048 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 01:14:53,048 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 01:14:53,049 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 01:14:53,049 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 01:14:53,049 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 01:14:53,049 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 01:14:53,064 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states. [2018-12-02 01:14:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 01:14:53,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:53,070 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:53,072 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:53,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:53,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1113695275, now seen corresponding path program 1 times [2018-12-02 01:14:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:53,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:53,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:53,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:53,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:53,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:53,301 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:53,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:53,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:53,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:53,316 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 4 states. [2018-12-02 01:14:53,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:53,544 INFO L93 Difference]: Finished difference Result 333 states and 558 transitions. [2018-12-02 01:14:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:53,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-02 01:14:53,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:53,552 INFO L225 Difference]: With dead ends: 333 [2018-12-02 01:14:53,552 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 01:14:53,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 01:14:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 01:14:53,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 01:14:53,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2018-12-02 01:14:53,584 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 48 [2018-12-02 01:14:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:53,584 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2018-12-02 01:14:53,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2018-12-02 01:14:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 01:14:53,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:53,586 INFO L402 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] [2018-12-02 01:14:53,586 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:53,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1437939466, now seen corresponding path program 1 times [2018-12-02 01:14:53,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:53,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:53,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:53,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:53,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:53,653 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:53,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:53,654 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2018-12-02 01:14:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:53,846 INFO L93 Difference]: Finished difference Result 296 states and 449 transitions. [2018-12-02 01:14:53,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:53,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 01:14:53,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:53,848 INFO L225 Difference]: With dead ends: 296 [2018-12-02 01:14:53,848 INFO L226 Difference]: Without dead ends: 169 [2018-12-02 01:14:53,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-02 01:14:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2018-12-02 01:14:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 01:14:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2018-12-02 01:14:53,855 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 61 [2018-12-02 01:14:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:53,855 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2018-12-02 01:14:53,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2018-12-02 01:14:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:14:53,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:53,857 INFO L402 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] [2018-12-02 01:14:53,857 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:53,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:53,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1890092254, now seen corresponding path program 1 times [2018-12-02 01:14:53,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:53,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:53,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:53,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:53,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:53,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:14:53,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:53,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:14:53,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:14:53,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:53,932 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 5 states. [2018-12-02 01:14:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:54,218 INFO L93 Difference]: Finished difference Result 300 states and 457 transitions. [2018-12-02 01:14:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:14:54,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 01:14:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:54,219 INFO L225 Difference]: With dead ends: 300 [2018-12-02 01:14:54,220 INFO L226 Difference]: Without dead ends: 173 [2018-12-02 01:14:54,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:14:54,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-02 01:14:54,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-02 01:14:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 01:14:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2018-12-02 01:14:54,226 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 62 [2018-12-02 01:14:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:54,226 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2018-12-02 01:14:54,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:14:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2018-12-02 01:14:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:14:54,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:54,227 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:54,227 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:54,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash 263492231, now seen corresponding path program 1 times [2018-12-02 01:14:54,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:54,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:54,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:54,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:54,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:54,287 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:54,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:54,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:54,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:54,287 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 4 states. [2018-12-02 01:14:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:54,474 INFO L93 Difference]: Finished difference Result 333 states and 497 transitions. [2018-12-02 01:14:54,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:54,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 01:14:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:54,475 INFO L225 Difference]: With dead ends: 333 [2018-12-02 01:14:54,475 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 01:14:54,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:54,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 01:14:54,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2018-12-02 01:14:54,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 01:14:54,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2018-12-02 01:14:54,483 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 62 [2018-12-02 01:14:54,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:54,483 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 256 transitions. [2018-12-02 01:14:54,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:54,483 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 256 transitions. [2018-12-02 01:14:54,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 01:14:54,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:54,484 INFO L402 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] [2018-12-02 01:14:54,484 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:54,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:54,484 INFO L82 PathProgramCache]: Analyzing trace with hash 404218918, now seen corresponding path program 1 times [2018-12-02 01:14:54,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:54,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:54,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:54,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:54,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:54,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:54,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:54,523 INFO L87 Difference]: Start difference. First operand 172 states and 256 transitions. Second operand 4 states. [2018-12-02 01:14:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:54,669 INFO L93 Difference]: Finished difference Result 332 states and 495 transitions. [2018-12-02 01:14:54,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:54,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-02 01:14:54,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:54,670 INFO L225 Difference]: With dead ends: 332 [2018-12-02 01:14:54,670 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 01:14:54,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:54,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 01:14:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 01:14:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 01:14:54,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 255 transitions. [2018-12-02 01:14:54,677 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 255 transitions. Word has length 62 [2018-12-02 01:14:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:54,678 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 255 transitions. [2018-12-02 01:14:54,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:54,678 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 255 transitions. [2018-12-02 01:14:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 01:14:54,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:54,679 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:54,679 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:54,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash -165765159, now seen corresponding path program 1 times [2018-12-02 01:14:54,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:54,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:54,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:54,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:54,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:54,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:54,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:54,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:54,727 INFO L87 Difference]: Start difference. First operand 172 states and 255 transitions. Second operand 4 states. [2018-12-02 01:14:54,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:54,876 INFO L93 Difference]: Finished difference Result 332 states and 494 transitions. [2018-12-02 01:14:54,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:54,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 01:14:54,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:54,877 INFO L225 Difference]: With dead ends: 332 [2018-12-02 01:14:54,877 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 01:14:54,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 01:14:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 01:14:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 01:14:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 254 transitions. [2018-12-02 01:14:54,883 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 254 transitions. Word has length 63 [2018-12-02 01:14:54,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:54,884 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 254 transitions. [2018-12-02 01:14:54,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 254 transitions. [2018-12-02 01:14:54,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 01:14:54,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:54,885 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:54,885 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:54,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:54,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1159888918, now seen corresponding path program 1 times [2018-12-02 01:14:54,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:54,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:54,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:54,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:54,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:54,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:54,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:54,939 INFO L87 Difference]: Start difference. First operand 172 states and 254 transitions. Second operand 4 states. [2018-12-02 01:14:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:55,098 INFO L93 Difference]: Finished difference Result 332 states and 493 transitions. [2018-12-02 01:14:55,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:55,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 01:14:55,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:55,099 INFO L225 Difference]: With dead ends: 332 [2018-12-02 01:14:55,099 INFO L226 Difference]: Without dead ends: 185 [2018-12-02 01:14:55,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-02 01:14:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 172. [2018-12-02 01:14:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-02 01:14:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 253 transitions. [2018-12-02 01:14:55,105 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 253 transitions. Word has length 64 [2018-12-02 01:14:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:55,105 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 253 transitions. [2018-12-02 01:14:55,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:55,105 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 253 transitions. [2018-12-02 01:14:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 01:14:55,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:55,106 INFO L402 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-12-02 01:14:55,107 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:55,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1763605761, now seen corresponding path program 1 times [2018-12-02 01:14:55,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:55,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:55,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:55,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:55,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:55,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:55,162 INFO L87 Difference]: Start difference. First operand 172 states and 253 transitions. Second operand 4 states. [2018-12-02 01:14:55,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:55,310 INFO L93 Difference]: Finished difference Result 361 states and 539 transitions. [2018-12-02 01:14:55,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:55,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 01:14:55,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:55,311 INFO L225 Difference]: With dead ends: 361 [2018-12-02 01:14:55,311 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 01:14:55,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:55,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 01:14:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 01:14:55,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2018-12-02 01:14:55,315 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 65 [2018-12-02 01:14:55,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:55,316 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2018-12-02 01:14:55,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2018-12-02 01:14:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 01:14:55,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:55,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:55,316 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:55,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash -648191682, now seen corresponding path program 1 times [2018-12-02 01:14:55,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:55,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:55,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:55,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:55,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:55,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:55,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:55,345 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 4 states. [2018-12-02 01:14:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:55,478 INFO L93 Difference]: Finished difference Result 376 states and 566 transitions. [2018-12-02 01:14:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:55,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-02 01:14:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:55,479 INFO L225 Difference]: With dead ends: 376 [2018-12-02 01:14:55,479 INFO L226 Difference]: Without dead ends: 207 [2018-12-02 01:14:55,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-02 01:14:55,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2018-12-02 01:14:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2018-12-02 01:14:55,483 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 65 [2018-12-02 01:14:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:55,483 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 289 transitions. [2018-12-02 01:14:55,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:55,484 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 289 transitions. [2018-12-02 01:14:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-02 01:14:55,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:55,484 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:55,484 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:55,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash -700683857, now seen corresponding path program 1 times [2018-12-02 01:14:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:55,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:55,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:55,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:55,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:55,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:55,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:55,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:55,520 INFO L87 Difference]: Start difference. First operand 194 states and 289 transitions. Second operand 4 states. [2018-12-02 01:14:55,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:55,634 INFO L93 Difference]: Finished difference Result 366 states and 553 transitions. [2018-12-02 01:14:55,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:55,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-12-02 01:14:55,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:55,635 INFO L225 Difference]: With dead ends: 366 [2018-12-02 01:14:55,635 INFO L226 Difference]: Without dead ends: 197 [2018-12-02 01:14:55,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-02 01:14:55,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-12-02 01:14:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:55,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 288 transitions. [2018-12-02 01:14:55,639 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 288 transitions. Word has length 66 [2018-12-02 01:14:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:55,639 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 288 transitions. [2018-12-02 01:14:55,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 288 transitions. [2018-12-02 01:14:55,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 01:14:55,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:55,640 INFO L402 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] [2018-12-02 01:14:55,640 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:55,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:55,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1018077858, now seen corresponding path program 1 times [2018-12-02 01:14:55,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:55,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:55,676 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:55,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:55,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:55,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:55,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:55,677 INFO L87 Difference]: Start difference. First operand 194 states and 288 transitions. Second operand 4 states. [2018-12-02 01:14:55,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:55,838 INFO L93 Difference]: Finished difference Result 383 states and 573 transitions. [2018-12-02 01:14:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:55,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2018-12-02 01:14:55,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:55,839 INFO L225 Difference]: With dead ends: 383 [2018-12-02 01:14:55,839 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 01:14:55,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:55,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 01:14:55,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 194. [2018-12-02 01:14:55,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2018-12-02 01:14:55,846 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 287 transitions. Word has length 78 [2018-12-02 01:14:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:55,846 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 287 transitions. [2018-12-02 01:14:55,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:55,846 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2018-12-02 01:14:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 01:14:55,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:55,847 INFO L402 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-12-02 01:14:55,847 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:55,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:55,847 INFO L82 PathProgramCache]: Analyzing trace with hash -909382053, now seen corresponding path program 1 times [2018-12-02 01:14:55,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:55,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:55,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:55,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:55,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:55,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:55,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:55,893 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand 4 states. [2018-12-02 01:14:56,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:56,056 INFO L93 Difference]: Finished difference Result 381 states and 569 transitions. [2018-12-02 01:14:56,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:56,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 01:14:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:56,058 INFO L225 Difference]: With dead ends: 381 [2018-12-02 01:14:56,058 INFO L226 Difference]: Without dead ends: 212 [2018-12-02 01:14:56,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:56,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-02 01:14:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 194. [2018-12-02 01:14:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 286 transitions. [2018-12-02 01:14:56,062 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 286 transitions. Word has length 79 [2018-12-02 01:14:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:56,063 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 286 transitions. [2018-12-02 01:14:56,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 286 transitions. [2018-12-02 01:14:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-02 01:14:56,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:56,063 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:56,064 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:56,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:56,064 INFO L82 PathProgramCache]: Analyzing trace with hash -768655366, now seen corresponding path program 1 times [2018-12-02 01:14:56,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:56,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:56,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:56,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:56,092 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:56,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,092 INFO L87 Difference]: Start difference. First operand 194 states and 286 transitions. Second operand 4 states. [2018-12-02 01:14:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:56,263 INFO L93 Difference]: Finished difference Result 380 states and 566 transitions. [2018-12-02 01:14:56,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:56,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2018-12-02 01:14:56,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:56,264 INFO L225 Difference]: With dead ends: 380 [2018-12-02 01:14:56,264 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 01:14:56,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 01:14:56,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 01:14:56,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:56,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 285 transitions. [2018-12-02 01:14:56,269 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 285 transitions. Word has length 79 [2018-12-02 01:14:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:56,269 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 285 transitions. [2018-12-02 01:14:56,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:56,269 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 285 transitions. [2018-12-02 01:14:56,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-02 01:14:56,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:56,270 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:56,270 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:56,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2129837701, now seen corresponding path program 1 times [2018-12-02 01:14:56,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:56,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:56,318 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:56,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:56,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:56,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:56,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:56,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,319 INFO L87 Difference]: Start difference. First operand 194 states and 285 transitions. Second operand 4 states. [2018-12-02 01:14:56,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:56,494 INFO L93 Difference]: Finished difference Result 380 states and 564 transitions. [2018-12-02 01:14:56,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:56,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2018-12-02 01:14:56,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:56,495 INFO L225 Difference]: With dead ends: 380 [2018-12-02 01:14:56,495 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 01:14:56,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 01:14:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 01:14:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 284 transitions. [2018-12-02 01:14:56,499 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 284 transitions. Word has length 80 [2018-12-02 01:14:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 284 transitions. [2018-12-02 01:14:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 284 transitions. [2018-12-02 01:14:56,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 01:14:56,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:56,500 INFO L402 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-12-02 01:14:56,500 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:56,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:56,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1284323006, now seen corresponding path program 1 times [2018-12-02 01:14:56,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:56,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:56,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:56,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:56,541 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:56,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:56,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:56,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,542 INFO L87 Difference]: Start difference. First operand 194 states and 284 transitions. Second operand 4 states. [2018-12-02 01:14:56,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:56,686 INFO L93 Difference]: Finished difference Result 380 states and 562 transitions. [2018-12-02 01:14:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:56,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-02 01:14:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:56,687 INFO L225 Difference]: With dead ends: 380 [2018-12-02 01:14:56,687 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 01:14:56,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 01:14:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 01:14:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-12-02 01:14:56,691 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 81 [2018-12-02 01:14:56,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:56,691 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-12-02 01:14:56,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-12-02 01:14:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-02 01:14:56,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:56,692 INFO L402 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-12-02 01:14:56,692 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:56,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:56,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2107933930, now seen corresponding path program 1 times [2018-12-02 01:14:56,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:56,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:56,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:56,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:56,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:56,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:56,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,723 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 4 states. [2018-12-02 01:14:56,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:56,880 INFO L93 Difference]: Finished difference Result 380 states and 560 transitions. [2018-12-02 01:14:56,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:56,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2018-12-02 01:14:56,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:56,881 INFO L225 Difference]: With dead ends: 380 [2018-12-02 01:14:56,881 INFO L226 Difference]: Without dead ends: 211 [2018-12-02 01:14:56,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-02 01:14:56,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 194. [2018-12-02 01:14:56,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2018-12-02 01:14:56,886 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 82 [2018-12-02 01:14:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:56,886 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2018-12-02 01:14:56,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2018-12-02 01:14:56,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-02 01:14:56,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:56,887 INFO L402 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-12-02 01:14:56,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:56,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1160135805, now seen corresponding path program 1 times [2018-12-02 01:14:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:56,888 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 01:14:56,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:56,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:56,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:56,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:56,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:56,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:56,930 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand 4 states. [2018-12-02 01:14:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:57,064 INFO L93 Difference]: Finished difference Result 370 states and 546 transitions. [2018-12-02 01:14:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:57,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-02 01:14:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:57,064 INFO L225 Difference]: With dead ends: 370 [2018-12-02 01:14:57,064 INFO L226 Difference]: Without dead ends: 201 [2018-12-02 01:14:57,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:57,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-02 01:14:57,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2018-12-02 01:14:57,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-02 01:14:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 281 transitions. [2018-12-02 01:14:57,070 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 281 transitions. Word has length 83 [2018-12-02 01:14:57,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:57,070 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 281 transitions. [2018-12-02 01:14:57,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 281 transitions. [2018-12-02 01:14:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 01:14:57,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:57,071 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:57,071 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:57,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:57,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2088811947, now seen corresponding path program 1 times [2018-12-02 01:14:57,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:57,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:57,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:57,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:57,128 INFO L87 Difference]: Start difference. First operand 194 states and 281 transitions. Second operand 4 states. [2018-12-02 01:14:57,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:57,358 INFO L93 Difference]: Finished difference Result 469 states and 696 transitions. [2018-12-02 01:14:57,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:57,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 01:14:57,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:57,359 INFO L225 Difference]: With dead ends: 469 [2018-12-02 01:14:57,359 INFO L226 Difference]: Without dead ends: 300 [2018-12-02 01:14:57,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-12-02 01:14:57,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 235. [2018-12-02 01:14:57,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-02 01:14:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 354 transitions. [2018-12-02 01:14:57,364 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 354 transitions. Word has length 87 [2018-12-02 01:14:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:57,364 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 354 transitions. [2018-12-02 01:14:57,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 354 transitions. [2018-12-02 01:14:57,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-02 01:14:57,364 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:57,364 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:57,364 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:57,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash 717004649, now seen corresponding path program 1 times [2018-12-02 01:14:57,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:57,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:57,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:57,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:57,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:57,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:57,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:57,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:57,411 INFO L87 Difference]: Start difference. First operand 235 states and 354 transitions. Second operand 4 states. [2018-12-02 01:14:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:57,598 INFO L93 Difference]: Finished difference Result 493 states and 752 transitions. [2018-12-02 01:14:57,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:57,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2018-12-02 01:14:57,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:57,599 INFO L225 Difference]: With dead ends: 493 [2018-12-02 01:14:57,599 INFO L226 Difference]: Without dead ends: 283 [2018-12-02 01:14:57,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-02 01:14:57,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 259. [2018-12-02 01:14:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-02 01:14:57,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 395 transitions. [2018-12-02 01:14:57,605 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 395 transitions. Word has length 87 [2018-12-02 01:14:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:57,605 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 395 transitions. [2018-12-02 01:14:57,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 395 transitions. [2018-12-02 01:14:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 01:14:57,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:57,605 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 01:14:57,606 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:57,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:57,606 INFO L82 PathProgramCache]: Analyzing trace with hash 127175711, now seen corresponding path program 1 times [2018-12-02 01:14:57,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:57,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:57,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:57,640 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:57,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:57,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:57,640 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:57,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:57,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:57,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:57,641 INFO L87 Difference]: Start difference. First operand 259 states and 395 transitions. Second operand 4 states. [2018-12-02 01:14:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:57,856 INFO L93 Difference]: Finished difference Result 551 states and 841 transitions. [2018-12-02 01:14:57,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:57,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2018-12-02 01:14:57,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:57,857 INFO L225 Difference]: With dead ends: 551 [2018-12-02 01:14:57,857 INFO L226 Difference]: Without dead ends: 317 [2018-12-02 01:14:57,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-02 01:14:57,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2018-12-02 01:14:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 396 transitions. [2018-12-02 01:14:57,863 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 396 transitions. Word has length 88 [2018-12-02 01:14:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:57,863 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 396 transitions. [2018-12-02 01:14:57,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 396 transitions. [2018-12-02 01:14:57,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 01:14:57,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:57,864 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:57,864 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:57,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:57,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1306452106, now seen corresponding path program 1 times [2018-12-02 01:14:57,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:57,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:57,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:57,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:57,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:57,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:57,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:57,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:57,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:57,906 INFO L87 Difference]: Start difference. First operand 260 states and 396 transitions. Second operand 4 states. [2018-12-02 01:14:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:58,141 INFO L93 Difference]: Finished difference Result 552 states and 841 transitions. [2018-12-02 01:14:58,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:58,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 01:14:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:58,142 INFO L225 Difference]: With dead ends: 552 [2018-12-02 01:14:58,142 INFO L226 Difference]: Without dead ends: 317 [2018-12-02 01:14:58,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:58,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-02 01:14:58,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2018-12-02 01:14:58,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:58,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 395 transitions. [2018-12-02 01:14:58,148 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 395 transitions. Word has length 100 [2018-12-02 01:14:58,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:58,148 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 395 transitions. [2018-12-02 01:14:58,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:58,148 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 395 transitions. [2018-12-02 01:14:58,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-02 01:14:58,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:58,149 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:58,149 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:58,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash -862551432, now seen corresponding path program 1 times [2018-12-02 01:14:58,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:58,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:58,187 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:58,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:58,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:58,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:58,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:58,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:58,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:58,188 INFO L87 Difference]: Start difference. First operand 260 states and 395 transitions. Second operand 4 states. [2018-12-02 01:14:58,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:58,363 INFO L93 Difference]: Finished difference Result 519 states and 792 transitions. [2018-12-02 01:14:58,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:58,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-02 01:14:58,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:58,365 INFO L225 Difference]: With dead ends: 519 [2018-12-02 01:14:58,365 INFO L226 Difference]: Without dead ends: 284 [2018-12-02 01:14:58,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:58,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-02 01:14:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 260. [2018-12-02 01:14:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2018-12-02 01:14:58,372 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 100 [2018-12-02 01:14:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:58,372 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2018-12-02 01:14:58,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2018-12-02 01:14:58,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:14:58,372 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:58,372 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:58,372 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:58,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 44633095, now seen corresponding path program 1 times [2018-12-02 01:14:58,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:58,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:58,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:58,409 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:58,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:58,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:58,409 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:58,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:58,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:58,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:58,410 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2018-12-02 01:14:58,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:58,634 INFO L93 Difference]: Finished difference Result 550 states and 835 transitions. [2018-12-02 01:14:58,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:58,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:14:58,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:58,635 INFO L225 Difference]: With dead ends: 550 [2018-12-02 01:14:58,635 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 01:14:58,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 01:14:58,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2018-12-02 01:14:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:58,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2018-12-02 01:14:58,645 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 101 [2018-12-02 01:14:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:58,646 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2018-12-02 01:14:58,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2018-12-02 01:14:58,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:14:58,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:58,647 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:58,647 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:58,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:58,647 INFO L82 PathProgramCache]: Analyzing trace with hash 185359782, now seen corresponding path program 1 times [2018-12-02 01:14:58,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:58,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:58,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:58,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:58,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:58,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:58,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:58,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:58,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:58,707 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2018-12-02 01:14:58,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:58,935 INFO L93 Difference]: Finished difference Result 549 states and 832 transitions. [2018-12-02 01:14:58,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:58,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:14:58,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:58,936 INFO L225 Difference]: With dead ends: 549 [2018-12-02 01:14:58,936 INFO L226 Difference]: Without dead ends: 314 [2018-12-02 01:14:58,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-02 01:14:58,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2018-12-02 01:14:58,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2018-12-02 01:14:58,943 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 101 [2018-12-02 01:14:58,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:58,943 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2018-12-02 01:14:58,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2018-12-02 01:14:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:14:58,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:58,943 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:58,943 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:58,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:58,944 INFO L82 PathProgramCache]: Analyzing trace with hash 920652101, now seen corresponding path program 1 times [2018-12-02 01:14:58,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:58,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:58,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:58,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:58,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:58,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:58,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:58,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:58,988 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2018-12-02 01:14:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:59,135 INFO L93 Difference]: Finished difference Result 517 states and 784 transitions. [2018-12-02 01:14:59,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:59,136 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:14:59,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:59,137 INFO L225 Difference]: With dead ends: 517 [2018-12-02 01:14:59,137 INFO L226 Difference]: Without dead ends: 282 [2018-12-02 01:14:59,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:59,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-02 01:14:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2018-12-02 01:14:59,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:59,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2018-12-02 01:14:59,147 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 101 [2018-12-02 01:14:59,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:59,147 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2018-12-02 01:14:59,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:59,147 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2018-12-02 01:14:59,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-02 01:14:59,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:59,148 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-12-02 01:14:59,148 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:59,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:59,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1061378788, now seen corresponding path program 1 times [2018-12-02 01:14:59,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:59,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:59,191 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:59,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:59,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:59,191 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:59,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:59,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:59,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:59,192 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2018-12-02 01:14:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:59,351 INFO L93 Difference]: Finished difference Result 516 states and 781 transitions. [2018-12-02 01:14:59,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:59,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2018-12-02 01:14:59,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:59,352 INFO L225 Difference]: With dead ends: 516 [2018-12-02 01:14:59,352 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 01:14:59,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:59,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 01:14:59,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-12-02 01:14:59,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2018-12-02 01:14:59,362 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 101 [2018-12-02 01:14:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:59,362 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2018-12-02 01:14:59,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2018-12-02 01:14:59,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 01:14:59,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:59,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:59,363 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:59,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1639536217, now seen corresponding path program 1 times [2018-12-02 01:14:59,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:59,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:59,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:59,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:59,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:59,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:59,396 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2018-12-02 01:14:59,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:59,602 INFO L93 Difference]: Finished difference Result 549 states and 826 transitions. [2018-12-02 01:14:59,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:59,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 01:14:59,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:59,603 INFO L225 Difference]: With dead ends: 549 [2018-12-02 01:14:59,603 INFO L226 Difference]: Without dead ends: 314 [2018-12-02 01:14:59,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:59,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-02 01:14:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2018-12-02 01:14:59,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:59,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2018-12-02 01:14:59,613 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 102 [2018-12-02 01:14:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:59,613 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2018-12-02 01:14:59,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2018-12-02 01:14:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-02 01:14:59,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:59,614 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:59,615 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:59,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1268645669, now seen corresponding path program 1 times [2018-12-02 01:14:59,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:59,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:59,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:59,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:59,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:59,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:59,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:59,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:59,654 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2018-12-02 01:14:59,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:14:59,809 INFO L93 Difference]: Finished difference Result 516 states and 777 transitions. [2018-12-02 01:14:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:14:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-02 01:14:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:14:59,810 INFO L225 Difference]: With dead ends: 516 [2018-12-02 01:14:59,810 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 01:14:59,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:14:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 01:14:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-12-02 01:14:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:14:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2018-12-02 01:14:59,816 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 102 [2018-12-02 01:14:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:14:59,816 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2018-12-02 01:14:59,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:14:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2018-12-02 01:14:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:14:59,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:14:59,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:14:59,817 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:14:59,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:14:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1030121110, now seen corresponding path program 1 times [2018-12-02 01:14:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:14:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:14:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:14:59,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:14:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:14:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:14:59,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:14:59,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:14:59,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:14:59,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:14:59,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:14:59,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:14:59,857 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2018-12-02 01:15:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:00,084 INFO L93 Difference]: Finished difference Result 549 states and 822 transitions. [2018-12-02 01:15:00,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:00,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 01:15:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:00,085 INFO L225 Difference]: With dead ends: 549 [2018-12-02 01:15:00,085 INFO L226 Difference]: Without dead ends: 314 [2018-12-02 01:15:00,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-02 01:15:00,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2018-12-02 01:15:00,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:00,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2018-12-02 01:15:00,095 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 103 [2018-12-02 01:15:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:00,095 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2018-12-02 01:15:00,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:00,095 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2018-12-02 01:15:00,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 01:15:00,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:00,096 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:00,096 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:00,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:00,096 INFO L82 PathProgramCache]: Analyzing trace with hash -989446360, now seen corresponding path program 1 times [2018-12-02 01:15:00,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:00,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:00,139 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:00,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:00,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:00,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:00,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:00,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:00,140 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 4 states. [2018-12-02 01:15:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:00,324 INFO L93 Difference]: Finished difference Result 516 states and 773 transitions. [2018-12-02 01:15:00,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:00,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2018-12-02 01:15:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:00,325 INFO L225 Difference]: With dead ends: 516 [2018-12-02 01:15:00,325 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 01:15:00,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 01:15:00,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-12-02 01:15:00,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 386 transitions. [2018-12-02 01:15:00,333 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 386 transitions. Word has length 103 [2018-12-02 01:15:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:00,333 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 386 transitions. [2018-12-02 01:15:00,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 386 transitions. [2018-12-02 01:15:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 01:15:00,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:00,334 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:00,334 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:00,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -920356930, now seen corresponding path program 1 times [2018-12-02 01:15:00,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:00,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:00,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:00,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:00,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:00,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:00,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:00,371 INFO L87 Difference]: Start difference. First operand 260 states and 386 transitions. Second operand 4 states. [2018-12-02 01:15:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:00,608 INFO L93 Difference]: Finished difference Result 549 states and 818 transitions. [2018-12-02 01:15:00,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:00,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 01:15:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:00,609 INFO L225 Difference]: With dead ends: 549 [2018-12-02 01:15:00,609 INFO L226 Difference]: Without dead ends: 314 [2018-12-02 01:15:00,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:00,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-02 01:15:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 260. [2018-12-02 01:15:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:00,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 385 transitions. [2018-12-02 01:15:00,615 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 385 transitions. Word has length 104 [2018-12-02 01:15:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:00,616 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 385 transitions. [2018-12-02 01:15:00,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:00,616 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 385 transitions. [2018-12-02 01:15:00,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-02 01:15:00,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:00,616 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:00,616 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:00,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:00,616 INFO L82 PathProgramCache]: Analyzing trace with hash 340560320, now seen corresponding path program 1 times [2018-12-02 01:15:00,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:00,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:00,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:00,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:00,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:00,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:00,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:00,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:00,647 INFO L87 Difference]: Start difference. First operand 260 states and 385 transitions. Second operand 4 states. [2018-12-02 01:15:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:00,800 INFO L93 Difference]: Finished difference Result 516 states and 769 transitions. [2018-12-02 01:15:00,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:00,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-02 01:15:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:00,801 INFO L225 Difference]: With dead ends: 516 [2018-12-02 01:15:00,802 INFO L226 Difference]: Without dead ends: 281 [2018-12-02 01:15:00,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-02 01:15:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 260. [2018-12-02 01:15:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:00,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 384 transitions. [2018-12-02 01:15:00,808 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 384 transitions. Word has length 104 [2018-12-02 01:15:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:00,808 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 384 transitions. [2018-12-02 01:15:00,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 384 transitions. [2018-12-02 01:15:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:15:00,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:00,809 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:00,809 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:00,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:00,809 INFO L82 PathProgramCache]: Analyzing trace with hash -547871953, now seen corresponding path program 1 times [2018-12-02 01:15:00,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:00,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:00,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:00,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:00,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:00,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:00,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:00,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:00,843 INFO L87 Difference]: Start difference. First operand 260 states and 384 transitions. Second operand 4 states. [2018-12-02 01:15:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:01,128 INFO L93 Difference]: Finished difference Result 539 states and 802 transitions. [2018-12-02 01:15:01,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:01,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 01:15:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:01,130 INFO L225 Difference]: With dead ends: 539 [2018-12-02 01:15:01,130 INFO L226 Difference]: Without dead ends: 304 [2018-12-02 01:15:01,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-02 01:15:01,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 260. [2018-12-02 01:15:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:01,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2018-12-02 01:15:01,143 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 105 [2018-12-02 01:15:01,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:01,143 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2018-12-02 01:15:01,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:01,143 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2018-12-02 01:15:01,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 01:15:01,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:01,144 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:01,144 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:01,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:01,144 INFO L82 PathProgramCache]: Analyzing trace with hash -114142867, now seen corresponding path program 1 times [2018-12-02 01:15:01,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:01,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:01,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:01,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:01,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:01,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:01,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:01,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:01,175 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand 4 states. [2018-12-02 01:15:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:01,325 INFO L93 Difference]: Finished difference Result 506 states and 753 transitions. [2018-12-02 01:15:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:01,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-02 01:15:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:01,326 INFO L225 Difference]: With dead ends: 506 [2018-12-02 01:15:01,326 INFO L226 Difference]: Without dead ends: 271 [2018-12-02 01:15:01,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:01,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-02 01:15:01,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 260. [2018-12-02 01:15:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:01,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 382 transitions. [2018-12-02 01:15:01,338 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 382 transitions. Word has length 105 [2018-12-02 01:15:01,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:01,339 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 382 transitions. [2018-12-02 01:15:01,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:01,339 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 382 transitions. [2018-12-02 01:15:01,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 01:15:01,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:01,340 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:01,340 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:01,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:01,340 INFO L82 PathProgramCache]: Analyzing trace with hash 772292931, now seen corresponding path program 1 times [2018-12-02 01:15:01,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:01,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:01,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:01,380 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:01,380 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:01,381 INFO L87 Difference]: Start difference. First operand 260 states and 382 transitions. Second operand 4 states. [2018-12-02 01:15:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:01,611 INFO L93 Difference]: Finished difference Result 539 states and 798 transitions. [2018-12-02 01:15:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:01,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-02 01:15:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:01,612 INFO L225 Difference]: With dead ends: 539 [2018-12-02 01:15:01,613 INFO L226 Difference]: Without dead ends: 304 [2018-12-02 01:15:01,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-02 01:15:01,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 260. [2018-12-02 01:15:01,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 01:15:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 381 transitions. [2018-12-02 01:15:01,622 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 381 transitions. Word has length 109 [2018-12-02 01:15:01,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:01,622 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 381 transitions. [2018-12-02 01:15:01,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:01,622 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 381 transitions. [2018-12-02 01:15:01,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-02 01:15:01,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:01,623 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:01,623 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:01,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1451565185, now seen corresponding path program 1 times [2018-12-02 01:15:01,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:01,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:01,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:01,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:01,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:01,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:01,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:01,655 INFO L87 Difference]: Start difference. First operand 260 states and 381 transitions. Second operand 4 states. [2018-12-02 01:15:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:01,832 INFO L93 Difference]: Finished difference Result 547 states and 813 transitions. [2018-12-02 01:15:01,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:01,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2018-12-02 01:15:01,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:01,833 INFO L225 Difference]: With dead ends: 547 [2018-12-02 01:15:01,833 INFO L226 Difference]: Without dead ends: 312 [2018-12-02 01:15:01,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-12-02 01:15:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 286. [2018-12-02 01:15:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:01,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 426 transitions. [2018-12-02 01:15:01,845 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 426 transitions. Word has length 109 [2018-12-02 01:15:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:01,845 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 426 transitions. [2018-12-02 01:15:01,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:01,845 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 426 transitions. [2018-12-02 01:15:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-02 01:15:01,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:01,846 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:01,846 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:01,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:01,846 INFO L82 PathProgramCache]: Analyzing trace with hash -402667213, now seen corresponding path program 1 times [2018-12-02 01:15:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:01,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:01,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:01,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:01,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:01,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:01,904 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:01,904 INFO L87 Difference]: Start difference. First operand 286 states and 426 transitions. Second operand 4 states. [2018-12-02 01:15:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:02,094 INFO L93 Difference]: Finished difference Result 591 states and 886 transitions. [2018-12-02 01:15:02,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:02,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-02 01:15:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:02,094 INFO L225 Difference]: With dead ends: 591 [2018-12-02 01:15:02,095 INFO L226 Difference]: Without dead ends: 330 [2018-12-02 01:15:02,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-02 01:15:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 286. [2018-12-02 01:15:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 425 transitions. [2018-12-02 01:15:02,103 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 425 transitions. Word has length 112 [2018-12-02 01:15:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:02,104 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 425 transitions. [2018-12-02 01:15:02,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 425 transitions. [2018-12-02 01:15:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-02 01:15:02,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:02,104 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:15:02,105 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:02,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:02,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1291792380, now seen corresponding path program 1 times [2018-12-02 01:15:02,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:02,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:02,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:02,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:02,138 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:02,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:02,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:02,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:02,138 INFO L87 Difference]: Start difference. First operand 286 states and 425 transitions. Second operand 4 states. [2018-12-02 01:15:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:02,317 INFO L93 Difference]: Finished difference Result 583 states and 871 transitions. [2018-12-02 01:15:02,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:02,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-02 01:15:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:02,318 INFO L225 Difference]: With dead ends: 583 [2018-12-02 01:15:02,318 INFO L226 Difference]: Without dead ends: 322 [2018-12-02 01:15:02,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:02,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-02 01:15:02,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2018-12-02 01:15:02,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 424 transitions. [2018-12-02 01:15:02,326 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 424 transitions. Word has length 113 [2018-12-02 01:15:02,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:02,326 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 424 transitions. [2018-12-02 01:15:02,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 424 transitions. [2018-12-02 01:15:02,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-02 01:15:02,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:02,327 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:02,327 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:02,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:02,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1797724583, now seen corresponding path program 1 times [2018-12-02 01:15:02,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:02,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:02,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:02,365 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:02,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:02,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:02,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:02,366 INFO L87 Difference]: Start difference. First operand 286 states and 424 transitions. Second operand 4 states. [2018-12-02 01:15:02,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:02,550 INFO L93 Difference]: Finished difference Result 583 states and 869 transitions. [2018-12-02 01:15:02,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:02,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2018-12-02 01:15:02,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:02,551 INFO L225 Difference]: With dead ends: 583 [2018-12-02 01:15:02,551 INFO L226 Difference]: Without dead ends: 322 [2018-12-02 01:15:02,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-02 01:15:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2018-12-02 01:15:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 423 transitions. [2018-12-02 01:15:02,559 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 423 transitions. Word has length 114 [2018-12-02 01:15:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:02,559 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 423 transitions. [2018-12-02 01:15:02,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:02,559 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 423 transitions. [2018-12-02 01:15:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 01:15:02,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:02,559 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:02,560 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:02,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:02,560 INFO L82 PathProgramCache]: Analyzing trace with hash -158699122, now seen corresponding path program 1 times [2018-12-02 01:15:02,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:02,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:02,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:02,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:02,590 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:02,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:02,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:02,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:02,591 INFO L87 Difference]: Start difference. First operand 286 states and 423 transitions. Second operand 4 states. [2018-12-02 01:15:02,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:02,765 INFO L93 Difference]: Finished difference Result 583 states and 867 transitions. [2018-12-02 01:15:02,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:02,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 01:15:02,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:02,766 INFO L225 Difference]: With dead ends: 583 [2018-12-02 01:15:02,766 INFO L226 Difference]: Without dead ends: 322 [2018-12-02 01:15:02,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-12-02 01:15:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2018-12-02 01:15:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 422 transitions. [2018-12-02 01:15:02,775 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 422 transitions. Word has length 115 [2018-12-02 01:15:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 422 transitions. [2018-12-02 01:15:02,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 422 transitions. [2018-12-02 01:15:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-02 01:15:02,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:02,776 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:02,776 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:02,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:02,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2016518774, now seen corresponding path program 1 times [2018-12-02 01:15:02,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:02,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:02,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:02,820 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:02,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:02,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:02,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:02,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:02,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:02,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:02,821 INFO L87 Difference]: Start difference. First operand 286 states and 422 transitions. Second operand 4 states. [2018-12-02 01:15:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:02,994 INFO L93 Difference]: Finished difference Result 581 states and 863 transitions. [2018-12-02 01:15:02,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:02,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-02 01:15:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:02,995 INFO L225 Difference]: With dead ends: 581 [2018-12-02 01:15:02,995 INFO L226 Difference]: Without dead ends: 320 [2018-12-02 01:15:02,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-12-02 01:15:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 286. [2018-12-02 01:15:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:03,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2018-12-02 01:15:03,003 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 421 transitions. Word has length 115 [2018-12-02 01:15:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:03,003 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-12-02 01:15:03,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 421 transitions. [2018-12-02 01:15:03,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 01:15:03,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:03,004 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:03,004 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:03,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1502887867, now seen corresponding path program 1 times [2018-12-02 01:15:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:03,054 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:03,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:03,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:03,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:03,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:03,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:03,055 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. Second operand 4 states. [2018-12-02 01:15:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:03,226 INFO L93 Difference]: Finished difference Result 578 states and 857 transitions. [2018-12-02 01:15:03,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:03,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 01:15:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:03,227 INFO L225 Difference]: With dead ends: 578 [2018-12-02 01:15:03,227 INFO L226 Difference]: Without dead ends: 317 [2018-12-02 01:15:03,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-12-02 01:15:03,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 286. [2018-12-02 01:15:03,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 420 transitions. [2018-12-02 01:15:03,236 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 420 transitions. Word has length 116 [2018-12-02 01:15:03,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:03,236 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 420 transitions. [2018-12-02 01:15:03,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 420 transitions. [2018-12-02 01:15:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-02 01:15:03,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:03,236 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:03,236 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:03,237 INFO L82 PathProgramCache]: Analyzing trace with hash -280964675, now seen corresponding path program 1 times [2018-12-02 01:15:03,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:03,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:03,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:03,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:03,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:03,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:03,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:03,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:03,271 INFO L87 Difference]: Start difference. First operand 286 states and 420 transitions. Second operand 4 states. [2018-12-02 01:15:03,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:03,424 INFO L93 Difference]: Finished difference Result 576 states and 852 transitions. [2018-12-02 01:15:03,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:03,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2018-12-02 01:15:03,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:03,426 INFO L225 Difference]: With dead ends: 576 [2018-12-02 01:15:03,426 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 01:15:03,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:03,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 01:15:03,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 286. [2018-12-02 01:15:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2018-12-02 01:15:03,436 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 116 [2018-12-02 01:15:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:03,436 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2018-12-02 01:15:03,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2018-12-02 01:15:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-02 01:15:03,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:03,437 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:03,437 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:03,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1680182759, now seen corresponding path program 1 times [2018-12-02 01:15:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:03,483 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:03,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:03,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:03,484 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:03,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:03,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:03,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:03,484 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand 4 states. [2018-12-02 01:15:03,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:03,648 INFO L93 Difference]: Finished difference Result 576 states and 850 transitions. [2018-12-02 01:15:03,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:03,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2018-12-02 01:15:03,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:03,649 INFO L225 Difference]: With dead ends: 576 [2018-12-02 01:15:03,649 INFO L226 Difference]: Without dead ends: 315 [2018-12-02 01:15:03,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:03,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-12-02 01:15:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 286. [2018-12-02 01:15:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:03,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 418 transitions. [2018-12-02 01:15:03,658 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 418 transitions. Word has length 118 [2018-12-02 01:15:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:03,658 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 418 transitions. [2018-12-02 01:15:03,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:03,658 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 418 transitions. [2018-12-02 01:15:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 01:15:03,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:03,658 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:03,658 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:03,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 164506373, now seen corresponding path program 1 times [2018-12-02 01:15:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:03,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:03,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:03,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:03,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:03,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:03,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:03,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:03,697 INFO L87 Difference]: Start difference. First operand 286 states and 418 transitions. Second operand 4 states. [2018-12-02 01:15:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:03,854 INFO L93 Difference]: Finished difference Result 572 states and 843 transitions. [2018-12-02 01:15:03,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:03,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 01:15:03,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:03,856 INFO L225 Difference]: With dead ends: 572 [2018-12-02 01:15:03,856 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 01:15:03,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:03,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 01:15:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 286. [2018-12-02 01:15:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 417 transitions. [2018-12-02 01:15:03,864 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 417 transitions. Word has length 119 [2018-12-02 01:15:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:03,865 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 417 transitions. [2018-12-02 01:15:03,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:03,865 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 417 transitions. [2018-12-02 01:15:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-02 01:15:03,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:03,865 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:03,865 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1432252756, now seen corresponding path program 1 times [2018-12-02 01:15:03,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:03,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:03,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:03,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:03,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:03,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:03,908 INFO L87 Difference]: Start difference. First operand 286 states and 417 transitions. Second operand 4 states. [2018-12-02 01:15:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:04,082 INFO L93 Difference]: Finished difference Result 572 states and 841 transitions. [2018-12-02 01:15:04,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:04,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-02 01:15:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:04,084 INFO L225 Difference]: With dead ends: 572 [2018-12-02 01:15:04,084 INFO L226 Difference]: Without dead ends: 311 [2018-12-02 01:15:04,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:04,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-02 01:15:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 286. [2018-12-02 01:15:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 416 transitions. [2018-12-02 01:15:04,092 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 416 transitions. Word has length 119 [2018-12-02 01:15:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:04,092 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 416 transitions. [2018-12-02 01:15:04,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 416 transitions. [2018-12-02 01:15:04,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-02 01:15:04,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:04,093 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:04,093 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:04,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:04,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1979926904, now seen corresponding path program 1 times [2018-12-02 01:15:04,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:04,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,094 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:04,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:04,126 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:04,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:04,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:04,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:04,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:04,127 INFO L87 Difference]: Start difference. First operand 286 states and 416 transitions. Second operand 4 states. [2018-12-02 01:15:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:04,285 INFO L93 Difference]: Finished difference Result 570 states and 837 transitions. [2018-12-02 01:15:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:04,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2018-12-02 01:15:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:04,286 INFO L225 Difference]: With dead ends: 570 [2018-12-02 01:15:04,286 INFO L226 Difference]: Without dead ends: 309 [2018-12-02 01:15:04,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-02 01:15:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-12-02 01:15:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:04,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 415 transitions. [2018-12-02 01:15:04,295 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 415 transitions. Word has length 120 [2018-12-02 01:15:04,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:04,295 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 415 transitions. [2018-12-02 01:15:04,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 415 transitions. [2018-12-02 01:15:04,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-02 01:15:04,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:04,295 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:04,295 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:04,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:04,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1994373191, now seen corresponding path program 1 times [2018-12-02 01:15:04,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:04,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:04,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:04,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:04,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:04,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:04,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:04,332 INFO L87 Difference]: Start difference. First operand 286 states and 415 transitions. Second operand 4 states. [2018-12-02 01:15:04,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:04,510 INFO L93 Difference]: Finished difference Result 570 states and 835 transitions. [2018-12-02 01:15:04,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:04,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-02 01:15:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:04,512 INFO L225 Difference]: With dead ends: 570 [2018-12-02 01:15:04,512 INFO L226 Difference]: Without dead ends: 309 [2018-12-02 01:15:04,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-02 01:15:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 286. [2018-12-02 01:15:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:04,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 414 transitions. [2018-12-02 01:15:04,525 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 414 transitions. Word has length 121 [2018-12-02 01:15:04,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:04,525 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 414 transitions. [2018-12-02 01:15:04,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 414 transitions. [2018-12-02 01:15:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 01:15:04,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:04,526 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:04,526 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:04,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:04,527 INFO L82 PathProgramCache]: Analyzing trace with hash -212012915, now seen corresponding path program 1 times [2018-12-02 01:15:04,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:04,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:04,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:04,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:04,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:04,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:04,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:04,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:04,568 INFO L87 Difference]: Start difference. First operand 286 states and 414 transitions. Second operand 4 states. [2018-12-02 01:15:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:04,854 INFO L93 Difference]: Finished difference Result 568 states and 831 transitions. [2018-12-02 01:15:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:04,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 01:15:04,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:04,856 INFO L225 Difference]: With dead ends: 568 [2018-12-02 01:15:04,856 INFO L226 Difference]: Without dead ends: 307 [2018-12-02 01:15:04,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-12-02 01:15:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 286. [2018-12-02 01:15:04,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 01:15:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 413 transitions. [2018-12-02 01:15:04,874 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 413 transitions. Word has length 122 [2018-12-02 01:15:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 413 transitions. [2018-12-02 01:15:04,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 413 transitions. [2018-12-02 01:15:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-02 01:15:04,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:04,875 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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] [2018-12-02 01:15:04,875 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:04,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -181237664, now seen corresponding path program 1 times [2018-12-02 01:15:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:04,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:04,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-12-02 01:15:04,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:04,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:04,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:04,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:04,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:04,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:04,914 INFO L87 Difference]: Start difference. First operand 286 states and 413 transitions. Second operand 4 states. [2018-12-02 01:15:05,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:05,120 INFO L93 Difference]: Finished difference Result 618 states and 908 transitions. [2018-12-02 01:15:05,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:05,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2018-12-02 01:15:05,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:05,122 INFO L225 Difference]: With dead ends: 618 [2018-12-02 01:15:05,122 INFO L226 Difference]: Without dead ends: 357 [2018-12-02 01:15:05,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:05,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-12-02 01:15:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 318. [2018-12-02 01:15:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-12-02 01:15:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 470 transitions. [2018-12-02 01:15:05,133 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 470 transitions. Word has length 122 [2018-12-02 01:15:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 470 transitions. [2018-12-02 01:15:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 470 transitions. [2018-12-02 01:15:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-02 01:15:05,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:05,134 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-12-02 01:15:05,134 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:05,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:05,134 INFO L82 PathProgramCache]: Analyzing trace with hash 707269116, now seen corresponding path program 1 times [2018-12-02 01:15:05,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:05,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:05,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:05,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:05,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:05,177 INFO L87 Difference]: Start difference. First operand 318 states and 470 transitions. Second operand 4 states. [2018-12-02 01:15:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:05,412 INFO L93 Difference]: Finished difference Result 715 states and 1072 transitions. [2018-12-02 01:15:05,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:05,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2018-12-02 01:15:05,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:05,413 INFO L225 Difference]: With dead ends: 715 [2018-12-02 01:15:05,413 INFO L226 Difference]: Without dead ends: 422 [2018-12-02 01:15:05,413 INFO L631 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-12-02 01:15:05,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-12-02 01:15:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 357. [2018-12-02 01:15:05,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-02 01:15:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 541 transitions. [2018-12-02 01:15:05,425 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 541 transitions. Word has length 123 [2018-12-02 01:15:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:05,425 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 541 transitions. [2018-12-02 01:15:05,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 541 transitions. [2018-12-02 01:15:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 01:15:05,425 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:05,425 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:05,425 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:05,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash 638856387, now seen corresponding path program 1 times [2018-12-02 01:15:05,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:05,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:05,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:05,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:05,473 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:05,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:05,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:05,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:05,474 INFO L87 Difference]: Start difference. First operand 357 states and 541 transitions. Second operand 4 states. [2018-12-02 01:15:05,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:05,642 INFO L93 Difference]: Finished difference Result 715 states and 1087 transitions. [2018-12-02 01:15:05,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:05,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 01:15:05,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:05,643 INFO L225 Difference]: With dead ends: 715 [2018-12-02 01:15:05,643 INFO L226 Difference]: Without dead ends: 383 [2018-12-02 01:15:05,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:05,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-12-02 01:15:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 357. [2018-12-02 01:15:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-12-02 01:15:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 540 transitions. [2018-12-02 01:15:05,654 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 540 transitions. Word has length 124 [2018-12-02 01:15:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:05,654 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 540 transitions. [2018-12-02 01:15:05,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:05,654 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 540 transitions. [2018-12-02 01:15:05,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-02 01:15:05,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:05,654 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-12-02 01:15:05,654 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:05,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:05,655 INFO L82 PathProgramCache]: Analyzing trace with hash 249020910, now seen corresponding path program 1 times [2018-12-02 01:15:05,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:05,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:05,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:05,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:05,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:05,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:05,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:05,685 INFO L87 Difference]: Start difference. First operand 357 states and 540 transitions. Second operand 4 states. [2018-12-02 01:15:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:05,940 INFO L93 Difference]: Finished difference Result 747 states and 1131 transitions. [2018-12-02 01:15:05,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:05,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2018-12-02 01:15:05,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:05,943 INFO L225 Difference]: With dead ends: 747 [2018-12-02 01:15:05,943 INFO L226 Difference]: Without dead ends: 415 [2018-12-02 01:15:05,943 INFO L631 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-12-02 01:15:05,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-12-02 01:15:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 356. [2018-12-02 01:15:05,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 01:15:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 539 transitions. [2018-12-02 01:15:05,964 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 539 transitions. Word has length 124 [2018-12-02 01:15:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:05,964 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 539 transitions. [2018-12-02 01:15:05,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 539 transitions. [2018-12-02 01:15:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 01:15:05,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:05,965 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:05,966 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:05,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1986424768, now seen corresponding path program 1 times [2018-12-02 01:15:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:05,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:05,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:06,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:06,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:06,000 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:06,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:06,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:06,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:06,000 INFO L87 Difference]: Start difference. First operand 356 states and 539 transitions. Second operand 4 states. [2018-12-02 01:15:06,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:06,161 INFO L93 Difference]: Finished difference Result 713 states and 1083 transitions. [2018-12-02 01:15:06,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:06,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 01:15:06,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:06,162 INFO L225 Difference]: With dead ends: 713 [2018-12-02 01:15:06,162 INFO L226 Difference]: Without dead ends: 382 [2018-12-02 01:15:06,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-02 01:15:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 356. [2018-12-02 01:15:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 01:15:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 538 transitions. [2018-12-02 01:15:06,179 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 538 transitions. Word has length 125 [2018-12-02 01:15:06,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:06,179 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 538 transitions. [2018-12-02 01:15:06,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:06,179 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 538 transitions. [2018-12-02 01:15:06,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-02 01:15:06,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:06,180 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:06,180 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:06,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:06,180 INFO L82 PathProgramCache]: Analyzing trace with hash -500999256, now seen corresponding path program 1 times [2018-12-02 01:15:06,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:06,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:06,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:06,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:06,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:06,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:06,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:06,224 INFO L87 Difference]: Start difference. First operand 356 states and 538 transitions. Second operand 4 states. [2018-12-02 01:15:06,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:06,380 INFO L93 Difference]: Finished difference Result 713 states and 1081 transitions. [2018-12-02 01:15:06,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:06,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2018-12-02 01:15:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:06,381 INFO L225 Difference]: With dead ends: 713 [2018-12-02 01:15:06,381 INFO L226 Difference]: Without dead ends: 382 [2018-12-02 01:15:06,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-02 01:15:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 356. [2018-12-02 01:15:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 01:15:06,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 537 transitions. [2018-12-02 01:15:06,392 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 537 transitions. Word has length 126 [2018-12-02 01:15:06,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:06,392 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 537 transitions. [2018-12-02 01:15:06,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 537 transitions. [2018-12-02 01:15:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 01:15:06,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:06,393 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:06,393 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:06,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash -432685947, now seen corresponding path program 1 times [2018-12-02 01:15:06,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:06,424 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:06,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:06,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:06,424 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:06,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:06,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:06,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:06,425 INFO L87 Difference]: Start difference. First operand 356 states and 537 transitions. Second operand 4 states. [2018-12-02 01:15:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:06,578 INFO L93 Difference]: Finished difference Result 703 states and 1067 transitions. [2018-12-02 01:15:06,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:06,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 01:15:06,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:06,579 INFO L225 Difference]: With dead ends: 703 [2018-12-02 01:15:06,579 INFO L226 Difference]: Without dead ends: 372 [2018-12-02 01:15:06,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:06,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-12-02 01:15:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 356. [2018-12-02 01:15:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 01:15:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 536 transitions. [2018-12-02 01:15:06,590 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 536 transitions. Word has length 127 [2018-12-02 01:15:06,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:06,590 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 536 transitions. [2018-12-02 01:15:06,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:06,590 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 536 transitions. [2018-12-02 01:15:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-02 01:15:06,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:06,591 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:06,591 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:06,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:06,591 INFO L82 PathProgramCache]: Analyzing trace with hash -433625085, now seen corresponding path program 1 times [2018-12-02 01:15:06,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:06,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:06,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:06,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:06,625 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:06,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:06,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:06,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:06,625 INFO L87 Difference]: Start difference. First operand 356 states and 536 transitions. Second operand 4 states. [2018-12-02 01:15:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:06,885 INFO L93 Difference]: Finished difference Result 791 states and 1204 transitions. [2018-12-02 01:15:06,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:06,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2018-12-02 01:15:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:06,886 INFO L225 Difference]: With dead ends: 791 [2018-12-02 01:15:06,886 INFO L226 Difference]: Without dead ends: 460 [2018-12-02 01:15:06,887 INFO L631 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-12-02 01:15:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-02 01:15:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 395. [2018-12-02 01:15:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-12-02 01:15:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 607 transitions. [2018-12-02 01:15:06,901 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 607 transitions. Word has length 128 [2018-12-02 01:15:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 607 transitions. [2018-12-02 01:15:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 607 transitions. [2018-12-02 01:15:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 01:15:06,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:06,902 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:15:06,902 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:06,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -758960953, now seen corresponding path program 1 times [2018-12-02 01:15:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:06,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:06,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:06,949 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:06,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:06,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:06,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:06,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:06,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:06,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:06,950 INFO L87 Difference]: Start difference. First operand 395 states and 607 transitions. Second operand 4 states. [2018-12-02 01:15:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:07,188 INFO L93 Difference]: Finished difference Result 823 states and 1265 transitions. [2018-12-02 01:15:07,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:07,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2018-12-02 01:15:07,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:07,189 INFO L225 Difference]: With dead ends: 823 [2018-12-02 01:15:07,189 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 01:15:07,189 INFO L631 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-12-02 01:15:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 01:15:07,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 356. [2018-12-02 01:15:07,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 01:15:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 536 transitions. [2018-12-02 01:15:07,201 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 536 transitions. Word has length 129 [2018-12-02 01:15:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:07,201 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 536 transitions. [2018-12-02 01:15:07,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 536 transitions. [2018-12-02 01:15:07,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-02 01:15:07,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:07,202 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:15:07,202 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:07,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:07,202 INFO L82 PathProgramCache]: Analyzing trace with hash 473364685, now seen corresponding path program 1 times [2018-12-02 01:15:07,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:07,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:07,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 01:15:07,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:07,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:07,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:07,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:07,246 INFO L87 Difference]: Start difference. First operand 356 states and 536 transitions. Second operand 4 states. [2018-12-02 01:15:07,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:07,407 INFO L93 Difference]: Finished difference Result 702 states and 1064 transitions. [2018-12-02 01:15:07,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:07,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2018-12-02 01:15:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:07,408 INFO L225 Difference]: With dead ends: 702 [2018-12-02 01:15:07,408 INFO L226 Difference]: Without dead ends: 371 [2018-12-02 01:15:07,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-02 01:15:07,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2018-12-02 01:15:07,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 01:15:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 539 transitions. [2018-12-02 01:15:07,420 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 539 transitions. Word has length 130 [2018-12-02 01:15:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 539 transitions. [2018-12-02 01:15:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 539 transitions. [2018-12-02 01:15:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 01:15:07,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:07,421 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2018-12-02 01:15:07,421 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:07,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:07,421 INFO L82 PathProgramCache]: Analyzing trace with hash -434361596, now seen corresponding path program 1 times [2018-12-02 01:15:07,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:07,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 01:15:07,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:07,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:07,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:07,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:07,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:07,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:07,458 INFO L87 Difference]: Start difference. First operand 359 states and 539 transitions. Second operand 4 states. [2018-12-02 01:15:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:07,627 INFO L93 Difference]: Finished difference Result 709 states and 1071 transitions. [2018-12-02 01:15:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:07,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 01:15:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:07,628 INFO L225 Difference]: With dead ends: 709 [2018-12-02 01:15:07,628 INFO L226 Difference]: Without dead ends: 375 [2018-12-02 01:15:07,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:07,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-12-02 01:15:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 359. [2018-12-02 01:15:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-12-02 01:15:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 538 transitions. [2018-12-02 01:15:07,641 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 538 transitions. Word has length 137 [2018-12-02 01:15:07,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:07,641 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 538 transitions. [2018-12-02 01:15:07,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 538 transitions. [2018-12-02 01:15:07,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-02 01:15:07,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:07,642 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:07,642 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:07,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2133797020, now seen corresponding path program 1 times [2018-12-02 01:15:07,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:07,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:07,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:07,677 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:07,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:07,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:07,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:07,677 INFO L87 Difference]: Start difference. First operand 359 states and 538 transitions. Second operand 4 states. [2018-12-02 01:15:07,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:07,873 INFO L93 Difference]: Finished difference Result 755 states and 1144 transitions. [2018-12-02 01:15:07,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:07,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2018-12-02 01:15:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:07,874 INFO L225 Difference]: With dead ends: 755 [2018-12-02 01:15:07,874 INFO L226 Difference]: Without dead ends: 421 [2018-12-02 01:15:07,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-12-02 01:15:07,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 387. [2018-12-02 01:15:07,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-02 01:15:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 587 transitions. [2018-12-02 01:15:07,888 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 587 transitions. Word has length 137 [2018-12-02 01:15:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:07,888 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 587 transitions. [2018-12-02 01:15:07,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 587 transitions. [2018-12-02 01:15:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 01:15:07,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:07,889 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2018-12-02 01:15:07,889 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:07,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:07,889 INFO L82 PathProgramCache]: Analyzing trace with hash 119363943, now seen corresponding path program 1 times [2018-12-02 01:15:07,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:07,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:07,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:07,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:07,925 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 01:15:07,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:07,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:07,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:07,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:07,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:07,926 INFO L87 Difference]: Start difference. First operand 387 states and 587 transitions. Second operand 4 states. [2018-12-02 01:15:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:08,081 INFO L93 Difference]: Finished difference Result 763 states and 1165 transitions. [2018-12-02 01:15:08,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:08,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 01:15:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:08,082 INFO L225 Difference]: With dead ends: 763 [2018-12-02 01:15:08,082 INFO L226 Difference]: Without dead ends: 401 [2018-12-02 01:15:08,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:08,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-12-02 01:15:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 387. [2018-12-02 01:15:08,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-02 01:15:08,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 586 transitions. [2018-12-02 01:15:08,096 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 586 transitions. Word has length 138 [2018-12-02 01:15:08,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:08,096 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 586 transitions. [2018-12-02 01:15:08,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 586 transitions. [2018-12-02 01:15:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-02 01:15:08,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:08,096 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-12-02 01:15:08,097 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:08,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:08,097 INFO L82 PathProgramCache]: Analyzing trace with hash 220640744, now seen corresponding path program 1 times [2018-12-02 01:15:08,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:08,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:08,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:08,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:08,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:08,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:08,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:08,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:08,128 INFO L87 Difference]: Start difference. First operand 387 states and 586 transitions. Second operand 4 states. [2018-12-02 01:15:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:08,353 INFO L93 Difference]: Finished difference Result 846 states and 1293 transitions. [2018-12-02 01:15:08,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:08,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2018-12-02 01:15:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:08,354 INFO L225 Difference]: With dead ends: 846 [2018-12-02 01:15:08,354 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:08,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 399. [2018-12-02 01:15:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-12-02 01:15:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 603 transitions. [2018-12-02 01:15:08,370 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 603 transitions. Word has length 138 [2018-12-02 01:15:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:08,370 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 603 transitions. [2018-12-02 01:15:08,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 603 transitions. [2018-12-02 01:15:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-02 01:15:08,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:08,370 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-12-02 01:15:08,371 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:08,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:08,371 INFO L82 PathProgramCache]: Analyzing trace with hash -2066207813, now seen corresponding path program 1 times [2018-12-02 01:15:08,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:08,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:08,404 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:08,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:08,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:08,404 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:08,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:08,404 INFO L87 Difference]: Start difference. First operand 399 states and 603 transitions. Second operand 4 states. [2018-12-02 01:15:08,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:08,630 INFO L93 Difference]: Finished difference Result 858 states and 1309 transitions. [2018-12-02 01:15:08,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:08,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-12-02 01:15:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:08,632 INFO L225 Difference]: With dead ends: 858 [2018-12-02 01:15:08,632 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:08,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:08,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:08,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-12-02 01:15:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-02 01:15:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 604 transitions. [2018-12-02 01:15:08,648 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 604 transitions. Word has length 139 [2018-12-02 01:15:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:08,649 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 604 transitions. [2018-12-02 01:15:08,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 604 transitions. [2018-12-02 01:15:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-02 01:15:08,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:08,650 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1] [2018-12-02 01:15:08,650 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:08,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:08,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1320693645, now seen corresponding path program 1 times [2018-12-02 01:15:08,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:08,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:08,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:08,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:08,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:08,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:08,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:08,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:08,682 INFO L87 Difference]: Start difference. First operand 400 states and 604 transitions. Second operand 4 states. [2018-12-02 01:15:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:08,901 INFO L93 Difference]: Finished difference Result 859 states and 1309 transitions. [2018-12-02 01:15:08,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:08,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2018-12-02 01:15:08,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:08,902 INFO L225 Difference]: With dead ends: 859 [2018-12-02 01:15:08,903 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:08,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:08,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2018-12-02 01:15:08,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-12-02 01:15:08,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 605 transitions. [2018-12-02 01:15:08,921 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 605 transitions. Word has length 140 [2018-12-02 01:15:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:08,921 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 605 transitions. [2018-12-02 01:15:08,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:08,922 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 605 transitions. [2018-12-02 01:15:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-02 01:15:08,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:08,922 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 1] [2018-12-02 01:15:08,922 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:08,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash 205219136, now seen corresponding path program 1 times [2018-12-02 01:15:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:08,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:08,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:08,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:08,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:08,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:08,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:08,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:08,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:08,951 INFO L87 Difference]: Start difference. First operand 401 states and 605 transitions. Second operand 4 states. [2018-12-02 01:15:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:09,171 INFO L93 Difference]: Finished difference Result 850 states and 1297 transitions. [2018-12-02 01:15:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:09,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2018-12-02 01:15:09,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:09,172 INFO L225 Difference]: With dead ends: 850 [2018-12-02 01:15:09,172 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 01:15:09,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:09,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 01:15:09,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 402. [2018-12-02 01:15:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-02 01:15:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 606 transitions. [2018-12-02 01:15:09,193 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 606 transitions. Word has length 141 [2018-12-02 01:15:09,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:09,193 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 606 transitions. [2018-12-02 01:15:09,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:09,193 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 606 transitions. [2018-12-02 01:15:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-02 01:15:09,193 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:09,193 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-12-02 01:15:09,194 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:09,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:09,194 INFO L82 PathProgramCache]: Analyzing trace with hash 516796673, now seen corresponding path program 1 times [2018-12-02 01:15:09,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:09,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:09,235 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:09,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:09,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:09,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:09,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:09,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:09,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:09,236 INFO L87 Difference]: Start difference. First operand 402 states and 606 transitions. Second operand 4 states. [2018-12-02 01:15:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:09,500 INFO L93 Difference]: Finished difference Result 861 states and 1309 transitions. [2018-12-02 01:15:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:09,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2018-12-02 01:15:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:09,502 INFO L225 Difference]: With dead ends: 861 [2018-12-02 01:15:09,502 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:09,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:09,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:09,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2018-12-02 01:15:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-02 01:15:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 605 transitions. [2018-12-02 01:15:09,524 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 605 transitions. Word has length 143 [2018-12-02 01:15:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:09,524 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 605 transitions. [2018-12-02 01:15:09,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:09,524 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 605 transitions. [2018-12-02 01:15:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-02 01:15:09,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:09,525 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-12-02 01:15:09,525 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:09,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:09,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1475308606, now seen corresponding path program 1 times [2018-12-02 01:15:09,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:09,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:09,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:09,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:09,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:09,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:09,559 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:09,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:09,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:09,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:09,559 INFO L87 Difference]: Start difference. First operand 402 states and 605 transitions. Second operand 4 states. [2018-12-02 01:15:09,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:09,794 INFO L93 Difference]: Finished difference Result 861 states and 1307 transitions. [2018-12-02 01:15:09,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:09,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2018-12-02 01:15:09,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:09,796 INFO L225 Difference]: With dead ends: 861 [2018-12-02 01:15:09,796 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:09,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:09,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2018-12-02 01:15:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-02 01:15:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 604 transitions. [2018-12-02 01:15:09,815 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 604 transitions. Word has length 144 [2018-12-02 01:15:09,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:09,815 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 604 transitions. [2018-12-02 01:15:09,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:09,815 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 604 transitions. [2018-12-02 01:15:09,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-02 01:15:09,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:09,816 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-12-02 01:15:09,816 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:09,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:09,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1836267418, now seen corresponding path program 1 times [2018-12-02 01:15:09,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:09,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:09,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:09,863 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:09,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:09,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:09,863 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:09,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:09,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:09,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:09,864 INFO L87 Difference]: Start difference. First operand 402 states and 604 transitions. Second operand 4 states. [2018-12-02 01:15:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:10,130 INFO L93 Difference]: Finished difference Result 861 states and 1305 transitions. [2018-12-02 01:15:10,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:10,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2018-12-02 01:15:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:10,131 INFO L225 Difference]: With dead ends: 861 [2018-12-02 01:15:10,131 INFO L226 Difference]: Without dead ends: 484 [2018-12-02 01:15:10,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-02 01:15:10,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 402. [2018-12-02 01:15:10,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-12-02 01:15:10,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 603 transitions. [2018-12-02 01:15:10,150 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 603 transitions. Word has length 145 [2018-12-02 01:15:10,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:10,151 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 603 transitions. [2018-12-02 01:15:10,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:10,151 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 603 transitions. [2018-12-02 01:15:10,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-02 01:15:10,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:10,151 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1] [2018-12-02 01:15:10,151 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:10,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:10,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1123673991, now seen corresponding path program 1 times [2018-12-02 01:15:10,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:10,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:10,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:10,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:10,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:10,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:10,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:10,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:10,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:10,200 INFO L87 Difference]: Start difference. First operand 402 states and 603 transitions. Second operand 4 states. [2018-12-02 01:15:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:10,434 INFO L93 Difference]: Finished difference Result 851 states and 1291 transitions. [2018-12-02 01:15:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:10,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2018-12-02 01:15:10,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:10,436 INFO L225 Difference]: With dead ends: 851 [2018-12-02 01:15:10,436 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 01:15:10,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 01:15:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 387. [2018-12-02 01:15:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-12-02 01:15:10,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 582 transitions. [2018-12-02 01:15:10,452 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 582 transitions. Word has length 146 [2018-12-02 01:15:10,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:10,453 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 582 transitions. [2018-12-02 01:15:10,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:10,453 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 582 transitions. [2018-12-02 01:15:10,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-02 01:15:10,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:10,453 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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-12-02 01:15:10,453 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:10,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash -113098238, now seen corresponding path program 1 times [2018-12-02 01:15:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:10,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:10,490 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:10,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:10,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:10,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:10,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:10,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:10,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:10,491 INFO L87 Difference]: Start difference. First operand 387 states and 582 transitions. Second operand 4 states. [2018-12-02 01:15:10,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:10,720 INFO L93 Difference]: Finished difference Result 836 states and 1269 transitions. [2018-12-02 01:15:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:10,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2018-12-02 01:15:10,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:10,721 INFO L225 Difference]: With dead ends: 836 [2018-12-02 01:15:10,722 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 01:15:10,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 01:15:10,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 415. [2018-12-02 01:15:10,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-12-02 01:15:10,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2018-12-02 01:15:10,738 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 148 [2018-12-02 01:15:10,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:10,739 INFO L480 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2018-12-02 01:15:10,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:10,739 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2018-12-02 01:15:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-02 01:15:10,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:10,739 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:10,739 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:10,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash -905088747, now seen corresponding path program 1 times [2018-12-02 01:15:10,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:10,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:10,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:10,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:10,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:10,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:10,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:10,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:10,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:10,774 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:10,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:10,970 INFO L93 Difference]: Finished difference Result 856 states and 1300 transitions. [2018-12-02 01:15:10,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:10,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2018-12-02 01:15:10,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:10,972 INFO L225 Difference]: With dead ends: 856 [2018-12-02 01:15:10,972 INFO L226 Difference]: Without dead ends: 466 [2018-12-02 01:15:10,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:10,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-02 01:15:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 416. [2018-12-02 01:15:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 01:15:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 628 transitions. [2018-12-02 01:15:10,990 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 628 transitions. Word has length 149 [2018-12-02 01:15:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:10,990 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 628 transitions. [2018-12-02 01:15:10,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 628 transitions. [2018-12-02 01:15:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-02 01:15:10,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:10,991 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1] [2018-12-02 01:15:10,992 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:10,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:10,992 INFO L82 PathProgramCache]: Analyzing trace with hash -499227137, now seen corresponding path program 1 times [2018-12-02 01:15:10,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:10,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:10,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:10,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:11,026 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 01:15:11,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:11,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:11,026 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:11,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:11,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:11,026 INFO L87 Difference]: Start difference. First operand 416 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:11,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:11,229 INFO L93 Difference]: Finished difference Result 857 states and 1300 transitions. [2018-12-02 01:15:11,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:11,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2018-12-02 01:15:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:11,230 INFO L225 Difference]: With dead ends: 857 [2018-12-02 01:15:11,230 INFO L226 Difference]: Without dead ends: 466 [2018-12-02 01:15:11,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-02 01:15:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 416. [2018-12-02 01:15:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 01:15:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 627 transitions. [2018-12-02 01:15:11,247 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 627 transitions. Word has length 151 [2018-12-02 01:15:11,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:11,247 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 627 transitions. [2018-12-02 01:15:11,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:11,247 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 627 transitions. [2018-12-02 01:15:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 01:15:11,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:11,248 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1] [2018-12-02 01:15:11,248 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:11,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:11,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1891467828, now seen corresponding path program 1 times [2018-12-02 01:15:11,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:11,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 01:15:11,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:11,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:11,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:11,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:11,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:11,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:11,282 INFO L87 Difference]: Start difference. First operand 416 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:11,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:11,503 INFO L93 Difference]: Finished difference Result 855 states and 1296 transitions. [2018-12-02 01:15:11,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:11,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 01:15:11,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:11,504 INFO L225 Difference]: With dead ends: 855 [2018-12-02 01:15:11,504 INFO L226 Difference]: Without dead ends: 464 [2018-12-02 01:15:11,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:11,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-02 01:15:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 416. [2018-12-02 01:15:11,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-12-02 01:15:11,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 626 transitions. [2018-12-02 01:15:11,523 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 626 transitions. Word has length 152 [2018-12-02 01:15:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:11,524 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 626 transitions. [2018-12-02 01:15:11,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 626 transitions. [2018-12-02 01:15:11,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 01:15:11,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:11,524 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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] [2018-12-02 01:15:11,524 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:11,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:11,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1606436598, now seen corresponding path program 1 times [2018-12-02 01:15:11,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:11,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:11,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:11,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:11,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:11,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:11,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:11,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:11,561 INFO L87 Difference]: Start difference. First operand 416 states and 626 transitions. Second operand 4 states. [2018-12-02 01:15:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:11,750 INFO L93 Difference]: Finished difference Result 852 states and 1290 transitions. [2018-12-02 01:15:11,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:11,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 01:15:11,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:11,751 INFO L225 Difference]: With dead ends: 852 [2018-12-02 01:15:11,751 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 01:15:11,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:11,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 01:15:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 419. [2018-12-02 01:15:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 01:15:11,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 631 transitions. [2018-12-02 01:15:11,773 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 631 transitions. Word has length 152 [2018-12-02 01:15:11,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:11,773 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 631 transitions. [2018-12-02 01:15:11,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:11,773 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 631 transitions. [2018-12-02 01:15:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-02 01:15:11,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:11,773 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:11,773 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:11,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:11,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1954378624, now seen corresponding path program 1 times [2018-12-02 01:15:11,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:11,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:11,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:11,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:11,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:11,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:11,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:11,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:11,804 INFO L87 Difference]: Start difference. First operand 419 states and 631 transitions. Second operand 4 states. [2018-12-02 01:15:12,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:12,014 INFO L93 Difference]: Finished difference Result 847 states and 1280 transitions. [2018-12-02 01:15:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:12,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2018-12-02 01:15:12,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:12,016 INFO L225 Difference]: With dead ends: 847 [2018-12-02 01:15:12,016 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 01:15:12,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:12,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 01:15:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2018-12-02 01:15:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 01:15:12,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 630 transitions. [2018-12-02 01:15:12,038 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 630 transitions. Word has length 152 [2018-12-02 01:15:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:12,038 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 630 transitions. [2018-12-02 01:15:12,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 630 transitions. [2018-12-02 01:15:12,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 01:15:12,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:12,039 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:12,039 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:12,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2030105051, now seen corresponding path program 1 times [2018-12-02 01:15:12,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:12,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:12,075 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:12,075 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:12,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:12,076 INFO L87 Difference]: Start difference. First operand 419 states and 630 transitions. Second operand 4 states. [2018-12-02 01:15:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:12,369 INFO L93 Difference]: Finished difference Result 868 states and 1311 transitions. [2018-12-02 01:15:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:12,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 01:15:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:12,371 INFO L225 Difference]: With dead ends: 868 [2018-12-02 01:15:12,371 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 01:15:12,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 01:15:12,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 419. [2018-12-02 01:15:12,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 01:15:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 629 transitions. [2018-12-02 01:15:12,402 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 629 transitions. Word has length 153 [2018-12-02 01:15:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:12,402 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 629 transitions. [2018-12-02 01:15:12,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 629 transitions. [2018-12-02 01:15:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-02 01:15:12,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:12,402 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:12,403 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:12,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:12,403 INFO L82 PathProgramCache]: Analyzing trace with hash 140058915, now seen corresponding path program 1 times [2018-12-02 01:15:12,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:12,441 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:12,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:12,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:12,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:12,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:12,442 INFO L87 Difference]: Start difference. First operand 419 states and 629 transitions. Second operand 4 states. [2018-12-02 01:15:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:12,635 INFO L93 Difference]: Finished difference Result 847 states and 1276 transitions. [2018-12-02 01:15:12,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:12,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2018-12-02 01:15:12,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:12,637 INFO L225 Difference]: With dead ends: 847 [2018-12-02 01:15:12,637 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 01:15:12,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:12,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 01:15:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 419. [2018-12-02 01:15:12,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 01:15:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 628 transitions. [2018-12-02 01:15:12,656 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 628 transitions. Word has length 153 [2018-12-02 01:15:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:12,656 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 628 transitions. [2018-12-02 01:15:12,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 628 transitions. [2018-12-02 01:15:12,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 01:15:12,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:12,657 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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-12-02 01:15:12,657 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:12,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1109703772, now seen corresponding path program 1 times [2018-12-02 01:15:12,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:12,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,658 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:12,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:12,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:12,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:12,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:12,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:12,690 INFO L87 Difference]: Start difference. First operand 419 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:12,905 INFO L93 Difference]: Finished difference Result 860 states and 1294 transitions. [2018-12-02 01:15:12,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:12,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 01:15:12,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:12,906 INFO L225 Difference]: With dead ends: 860 [2018-12-02 01:15:12,906 INFO L226 Difference]: Without dead ends: 466 [2018-12-02 01:15:12,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-02 01:15:12,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 419. [2018-12-02 01:15:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-12-02 01:15:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 627 transitions. [2018-12-02 01:15:12,929 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 627 transitions. Word has length 154 [2018-12-02 01:15:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:12,929 INFO L480 AbstractCegarLoop]: Abstraction has 419 states and 627 transitions. [2018-12-02 01:15:12,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 627 transitions. [2018-12-02 01:15:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 01:15:12,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:12,930 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2018-12-02 01:15:12,930 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:12,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:12,930 INFO L82 PathProgramCache]: Analyzing trace with hash -443755608, now seen corresponding path program 1 times [2018-12-02 01:15:12,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:12,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:12,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:12,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:12,978 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:12,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:12,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:12,978 INFO L87 Difference]: Start difference. First operand 419 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:13,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:13,181 INFO L93 Difference]: Finished difference Result 855 states and 1286 transitions. [2018-12-02 01:15:13,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:13,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 01:15:13,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:13,182 INFO L225 Difference]: With dead ends: 855 [2018-12-02 01:15:13,182 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 01:15:13,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 01:15:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 420. [2018-12-02 01:15:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 01:15:13,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 628 transitions. [2018-12-02 01:15:13,204 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 628 transitions. Word has length 154 [2018-12-02 01:15:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:13,204 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 628 transitions. [2018-12-02 01:15:13,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 628 transitions. [2018-12-02 01:15:13,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-02 01:15:13,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:13,205 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:13,205 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:13,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:13,205 INFO L82 PathProgramCache]: Analyzing trace with hash 995485477, now seen corresponding path program 1 times [2018-12-02 01:15:13,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:13,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:13,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:13,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:13,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:13,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:13,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:13,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:13,241 INFO L87 Difference]: Start difference. First operand 420 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:13,444 INFO L93 Difference]: Finished difference Result 849 states and 1274 transitions. [2018-12-02 01:15:13,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:13,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2018-12-02 01:15:13,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:13,445 INFO L225 Difference]: With dead ends: 849 [2018-12-02 01:15:13,445 INFO L226 Difference]: Without dead ends: 454 [2018-12-02 01:15:13,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-12-02 01:15:13,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 420. [2018-12-02 01:15:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-12-02 01:15:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 627 transitions. [2018-12-02 01:15:13,466 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 627 transitions. Word has length 154 [2018-12-02 01:15:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:13,466 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 627 transitions. [2018-12-02 01:15:13,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 627 transitions. [2018-12-02 01:15:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 01:15:13,467 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:13,467 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2018-12-02 01:15:13,467 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:13,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:13,467 INFO L82 PathProgramCache]: Analyzing trace with hash -160957610, now seen corresponding path program 1 times [2018-12-02 01:15:13,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:13,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:13,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:13,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:13,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:13,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:13,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:13,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:13,505 INFO L87 Difference]: Start difference. First operand 420 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:13,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:13,698 INFO L93 Difference]: Finished difference Result 852 states and 1279 transitions. [2018-12-02 01:15:13,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:13,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 01:15:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:13,699 INFO L225 Difference]: With dead ends: 852 [2018-12-02 01:15:13,699 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 01:15:13,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 01:15:13,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 421. [2018-12-02 01:15:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-12-02 01:15:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 628 transitions. [2018-12-02 01:15:13,719 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 628 transitions. Word has length 155 [2018-12-02 01:15:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:13,719 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 628 transitions. [2018-12-02 01:15:13,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 628 transitions. [2018-12-02 01:15:13,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 01:15:13,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:13,720 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:13,720 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:13,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:13,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1106788773, now seen corresponding path program 1 times [2018-12-02 01:15:13,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:13,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:13,753 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:13,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:13,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:13,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:13,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:13,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:13,754 INFO L87 Difference]: Start difference. First operand 421 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:13,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:13,950 INFO L93 Difference]: Finished difference Result 853 states and 1279 transitions. [2018-12-02 01:15:13,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:13,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 01:15:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:13,951 INFO L225 Difference]: With dead ends: 853 [2018-12-02 01:15:13,951 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 01:15:13,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 01:15:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 422. [2018-12-02 01:15:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 01:15:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 629 transitions. [2018-12-02 01:15:13,972 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 629 transitions. Word has length 155 [2018-12-02 01:15:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:13,972 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 629 transitions. [2018-12-02 01:15:13,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 629 transitions. [2018-12-02 01:15:13,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-02 01:15:13,972 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:13,973 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:13,973 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:13,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1286299480, now seen corresponding path program 1 times [2018-12-02 01:15:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:13,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:13,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:14,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:14,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:14,008 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:14,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:14,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:14,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:14,009 INFO L87 Difference]: Start difference. First operand 422 states and 629 transitions. Second operand 4 states. [2018-12-02 01:15:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:14,203 INFO L93 Difference]: Finished difference Result 843 states and 1264 transitions. [2018-12-02 01:15:14,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:14,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-12-02 01:15:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:14,204 INFO L225 Difference]: With dead ends: 843 [2018-12-02 01:15:14,204 INFO L226 Difference]: Without dead ends: 446 [2018-12-02 01:15:14,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-02 01:15:14,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 422. [2018-12-02 01:15:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 01:15:14,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 628 transitions. [2018-12-02 01:15:14,225 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 628 transitions. Word has length 155 [2018-12-02 01:15:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:14,225 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 628 transitions. [2018-12-02 01:15:14,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 628 transitions. [2018-12-02 01:15:14,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 01:15:14,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:14,225 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:14,226 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:14,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:14,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1313866874, now seen corresponding path program 1 times [2018-12-02 01:15:14,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:14,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 01:15:14,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:14,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:14,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:14,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:14,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:14,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:14,262 INFO L87 Difference]: Start difference. First operand 422 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:14,493 INFO L93 Difference]: Finished difference Result 863 states and 1288 transitions. [2018-12-02 01:15:14,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:14,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 01:15:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:14,494 INFO L225 Difference]: With dead ends: 863 [2018-12-02 01:15:14,494 INFO L226 Difference]: Without dead ends: 466 [2018-12-02 01:15:14,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:14,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2018-12-02 01:15:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 422. [2018-12-02 01:15:14,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-12-02 01:15:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 627 transitions. [2018-12-02 01:15:14,515 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 627 transitions. Word has length 156 [2018-12-02 01:15:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:14,515 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 627 transitions. [2018-12-02 01:15:14,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 627 transitions. [2018-12-02 01:15:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-02 01:15:14,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:14,516 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:14,516 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:14,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash 815591511, now seen corresponding path program 1 times [2018-12-02 01:15:14,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:14,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:14,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:14,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:14,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:14,552 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:14,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:14,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:14,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:14,553 INFO L87 Difference]: Start difference. First operand 422 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:14,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:14,744 INFO L93 Difference]: Finished difference Result 852 states and 1273 transitions. [2018-12-02 01:15:14,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:14,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2018-12-02 01:15:14,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:14,745 INFO L225 Difference]: With dead ends: 852 [2018-12-02 01:15:14,745 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 01:15:14,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 01:15:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 423. [2018-12-02 01:15:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-02 01:15:14,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 628 transitions. [2018-12-02 01:15:14,767 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 628 transitions. Word has length 156 [2018-12-02 01:15:14,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:14,767 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 628 transitions. [2018-12-02 01:15:14,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:14,768 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 628 transitions. [2018-12-02 01:15:14,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 01:15:14,768 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:14,768 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:14,768 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:14,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:14,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1375495899, now seen corresponding path program 1 times [2018-12-02 01:15:14,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:14,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-02 01:15:14,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:14,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:14,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:14,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:14,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:14,801 INFO L87 Difference]: Start difference. First operand 423 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:15,010 INFO L93 Difference]: Finished difference Result 862 states and 1284 transitions. [2018-12-02 01:15:15,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:15,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 01:15:15,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:15,011 INFO L225 Difference]: With dead ends: 862 [2018-12-02 01:15:15,011 INFO L226 Difference]: Without dead ends: 464 [2018-12-02 01:15:15,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:15,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-12-02 01:15:15,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 423. [2018-12-02 01:15:15,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-02 01:15:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 627 transitions. [2018-12-02 01:15:15,033 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 627 transitions. Word has length 157 [2018-12-02 01:15:15,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:15,034 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 627 transitions. [2018-12-02 01:15:15,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 627 transitions. [2018-12-02 01:15:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 01:15:15,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:15,034 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-02 01:15:15,034 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:15,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:15,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1090464669, now seen corresponding path program 1 times [2018-12-02 01:15:15,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:15,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:15,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:15,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:15,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:15,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:15,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:15,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:15,073 INFO L87 Difference]: Start difference. First operand 423 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:15,288 INFO L93 Difference]: Finished difference Result 859 states and 1278 transitions. [2018-12-02 01:15:15,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:15,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 01:15:15,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:15,289 INFO L225 Difference]: With dead ends: 859 [2018-12-02 01:15:15,289 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 01:15:15,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 01:15:15,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 423. [2018-12-02 01:15:15,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-12-02 01:15:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 626 transitions. [2018-12-02 01:15:15,313 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 626 transitions. Word has length 157 [2018-12-02 01:15:15,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:15,313 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 626 transitions. [2018-12-02 01:15:15,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 626 transitions. [2018-12-02 01:15:15,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-02 01:15:15,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:15,314 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:15,314 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:15,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:15,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1232648246, now seen corresponding path program 1 times [2018-12-02 01:15:15,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:15,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,314 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:15,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:15,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:15,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:15,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:15,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:15,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:15,349 INFO L87 Difference]: Start difference. First operand 423 states and 626 transitions. Second operand 4 states. [2018-12-02 01:15:15,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:15,550 INFO L93 Difference]: Finished difference Result 853 states and 1269 transitions. [2018-12-02 01:15:15,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:15,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2018-12-02 01:15:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:15,551 INFO L225 Difference]: With dead ends: 853 [2018-12-02 01:15:15,551 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 01:15:15,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 01:15:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 424. [2018-12-02 01:15:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-12-02 01:15:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 627 transitions. [2018-12-02 01:15:15,573 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 627 transitions. Word has length 157 [2018-12-02 01:15:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:15,573 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 627 transitions. [2018-12-02 01:15:15,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:15,573 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 627 transitions. [2018-12-02 01:15:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-02 01:15:15,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:15,574 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1] [2018-12-02 01:15:15,574 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:15,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:15,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1926623900, now seen corresponding path program 1 times [2018-12-02 01:15:15,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:15,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2018-12-02 01:15:15,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:15,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:15,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:15,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:15,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:15,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:15,609 INFO L87 Difference]: Start difference. First operand 424 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:15,815 INFO L93 Difference]: Finished difference Result 852 states and 1267 transitions. [2018-12-02 01:15:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:15,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2018-12-02 01:15:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:15,815 INFO L225 Difference]: With dead ends: 852 [2018-12-02 01:15:15,816 INFO L226 Difference]: Without dead ends: 453 [2018-12-02 01:15:15,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2018-12-02 01:15:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 425. [2018-12-02 01:15:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:15,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 628 transitions. [2018-12-02 01:15:15,852 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 628 transitions. Word has length 158 [2018-12-02 01:15:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:15,852 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 628 transitions. [2018-12-02 01:15:15,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:15,852 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 628 transitions. [2018-12-02 01:15:15,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-02 01:15:15,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:15,853 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:15,853 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:15,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:15,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1484029121, now seen corresponding path program 1 times [2018-12-02 01:15:15,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:15,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:15,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:15,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:15,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:15,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:15,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:15,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:15,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:15,898 INFO L87 Difference]: Start difference. First operand 425 states and 628 transitions. Second operand 4 states. [2018-12-02 01:15:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:16,104 INFO L93 Difference]: Finished difference Result 861 states and 1276 transitions. [2018-12-02 01:15:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:16,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2018-12-02 01:15:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:16,105 INFO L225 Difference]: With dead ends: 861 [2018-12-02 01:15:16,105 INFO L226 Difference]: Without dead ends: 461 [2018-12-02 01:15:16,106 INFO L631 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-12-02 01:15:16,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-12-02 01:15:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 425. [2018-12-02 01:15:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 627 transitions. [2018-12-02 01:15:16,128 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 627 transitions. Word has length 159 [2018-12-02 01:15:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:16,128 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 627 transitions. [2018-12-02 01:15:16,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:16,128 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 627 transitions. [2018-12-02 01:15:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 01:15:16,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:16,129 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:16,129 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:16,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash -529173155, now seen corresponding path program 1 times [2018-12-02 01:15:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:16,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:16,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:16,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:16,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:16,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:16,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:16,162 INFO L87 Difference]: Start difference. First operand 425 states and 627 transitions. Second operand 4 states. [2018-12-02 01:15:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:16,373 INFO L93 Difference]: Finished difference Result 857 states and 1269 transitions. [2018-12-02 01:15:16,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:16,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-02 01:15:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:16,374 INFO L225 Difference]: With dead ends: 857 [2018-12-02 01:15:16,374 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 01:15:16,374 INFO L631 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-12-02 01:15:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 01:15:16,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 425. [2018-12-02 01:15:16,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 626 transitions. [2018-12-02 01:15:16,397 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 626 transitions. Word has length 160 [2018-12-02 01:15:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:16,398 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 626 transitions. [2018-12-02 01:15:16,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:16,398 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 626 transitions. [2018-12-02 01:15:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-02 01:15:16,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:16,398 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:16,398 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:16,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 738573228, now seen corresponding path program 1 times [2018-12-02 01:15:16,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:16,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:16,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:16,432 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:16,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:16,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:16,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:16,432 INFO L87 Difference]: Start difference. First operand 425 states and 626 transitions. Second operand 4 states. [2018-12-02 01:15:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:16,639 INFO L93 Difference]: Finished difference Result 857 states and 1267 transitions. [2018-12-02 01:15:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:16,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2018-12-02 01:15:16,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:16,641 INFO L225 Difference]: With dead ends: 857 [2018-12-02 01:15:16,641 INFO L226 Difference]: Without dead ends: 457 [2018-12-02 01:15:16,641 INFO L631 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-12-02 01:15:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-12-02 01:15:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 425. [2018-12-02 01:15:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:16,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 625 transitions. [2018-12-02 01:15:16,667 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 625 transitions. Word has length 160 [2018-12-02 01:15:16,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:16,667 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 625 transitions. [2018-12-02 01:15:16,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 625 transitions. [2018-12-02 01:15:16,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-02 01:15:16,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:16,668 INFO L402 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:16,668 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:16,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:16,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2009155792, now seen corresponding path program 1 times [2018-12-02 01:15:16,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:16,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:16,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:16,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:16,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:16,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:16,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:16,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:16,708 INFO L87 Difference]: Start difference. First operand 425 states and 625 transitions. Second operand 4 states. [2018-12-02 01:15:16,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:16,909 INFO L93 Difference]: Finished difference Result 855 states and 1263 transitions. [2018-12-02 01:15:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:16,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2018-12-02 01:15:16,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:16,910 INFO L225 Difference]: With dead ends: 855 [2018-12-02 01:15:16,910 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 01:15:16,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 01:15:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 425. [2018-12-02 01:15:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:16,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 624 transitions. [2018-12-02 01:15:16,934 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 624 transitions. Word has length 161 [2018-12-02 01:15:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:16,934 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 624 transitions. [2018-12-02 01:15:16,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 624 transitions. [2018-12-02 01:15:16,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 01:15:16,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:16,935 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:16,935 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:16,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1394498577, now seen corresponding path program 1 times [2018-12-02 01:15:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:16,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:16,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:16,972 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:16,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:16,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:16,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:16,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:16,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:16,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:16,972 INFO L87 Difference]: Start difference. First operand 425 states and 624 transitions. Second operand 4 states. [2018-12-02 01:15:17,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:17,176 INFO L93 Difference]: Finished difference Result 855 states and 1261 transitions. [2018-12-02 01:15:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:17,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 01:15:17,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:17,178 INFO L225 Difference]: With dead ends: 855 [2018-12-02 01:15:17,178 INFO L226 Difference]: Without dead ends: 455 [2018-12-02 01:15:17,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-12-02 01:15:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 425. [2018-12-02 01:15:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-12-02 01:15:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 623 transitions. [2018-12-02 01:15:17,204 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 623 transitions. Word has length 162 [2018-12-02 01:15:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:17,204 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 623 transitions. [2018-12-02 01:15:17,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 623 transitions. [2018-12-02 01:15:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-02 01:15:17,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:17,205 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:17,205 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:17,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:17,205 INFO L82 PathProgramCache]: Analyzing trace with hash -321199718, now seen corresponding path program 1 times [2018-12-02 01:15:17,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:17,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:17,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:17,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:17,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:17,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:17,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:17,247 INFO L87 Difference]: Start difference. First operand 425 states and 623 transitions. Second operand 4 states. [2018-12-02 01:15:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:17,479 INFO L93 Difference]: Finished difference Result 891 states and 1320 transitions. [2018-12-02 01:15:17,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:17,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2018-12-02 01:15:17,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:17,480 INFO L225 Difference]: With dead ends: 891 [2018-12-02 01:15:17,480 INFO L226 Difference]: Without dead ends: 491 [2018-12-02 01:15:17,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:17,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2018-12-02 01:15:17,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 455. [2018-12-02 01:15:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-12-02 01:15:17,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 676 transitions. [2018-12-02 01:15:17,505 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 676 transitions. Word has length 162 [2018-12-02 01:15:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:17,506 INFO L480 AbstractCegarLoop]: Abstraction has 455 states and 676 transitions. [2018-12-02 01:15:17,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 676 transitions. [2018-12-02 01:15:17,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-02 01:15:17,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:17,506 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:17,506 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:17,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1763796789, now seen corresponding path program 1 times [2018-12-02 01:15:17,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:17,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:17,552 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:17,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:17,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:17,553 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:17,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:17,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:17,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:17,553 INFO L87 Difference]: Start difference. First operand 455 states and 676 transitions. Second operand 4 states. [2018-12-02 01:15:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:17,782 INFO L93 Difference]: Finished difference Result 913 states and 1363 transitions. [2018-12-02 01:15:17,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:17,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-12-02 01:15:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:17,783 INFO L225 Difference]: With dead ends: 913 [2018-12-02 01:15:17,783 INFO L226 Difference]: Without dead ends: 483 [2018-12-02 01:15:17,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:17,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-02 01:15:17,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 417. [2018-12-02 01:15:17,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-12-02 01:15:17,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 620 transitions. [2018-12-02 01:15:17,808 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 620 transitions. Word has length 163 [2018-12-02 01:15:17,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:17,808 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 620 transitions. [2018-12-02 01:15:17,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:17,808 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 620 transitions. [2018-12-02 01:15:17,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 01:15:17,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:17,809 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2018-12-02 01:15:17,809 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:17,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:17,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1495489276, now seen corresponding path program 1 times [2018-12-02 01:15:17,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:17,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:17,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-12-02 01:15:17,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:17,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:17,849 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:17,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:17,850 INFO L87 Difference]: Start difference. First operand 417 states and 620 transitions. Second operand 4 states. [2018-12-02 01:15:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:18,063 INFO L93 Difference]: Finished difference Result 875 states and 1306 transitions. [2018-12-02 01:15:18,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:18,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 01:15:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:18,064 INFO L225 Difference]: With dead ends: 875 [2018-12-02 01:15:18,064 INFO L226 Difference]: Without dead ends: 483 [2018-12-02 01:15:18,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:18,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-12-02 01:15:18,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 447. [2018-12-02 01:15:18,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 01:15:18,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 665 transitions. [2018-12-02 01:15:18,093 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 665 transitions. Word has length 165 [2018-12-02 01:15:18,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:18,093 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 665 transitions. [2018-12-02 01:15:18,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:18,094 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 665 transitions. [2018-12-02 01:15:18,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-02 01:15:18,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:18,094 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:18,095 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:18,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:18,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1882357607, now seen corresponding path program 1 times [2018-12-02 01:15:18,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:18,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:18,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:18,132 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 01:15:18,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:18,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:18,133 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:18,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:18,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:18,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:18,133 INFO L87 Difference]: Start difference. First operand 447 states and 665 transitions. Second operand 4 states. [2018-12-02 01:15:18,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:18,355 INFO L93 Difference]: Finished difference Result 908 states and 1354 transitions. [2018-12-02 01:15:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:18,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2018-12-02 01:15:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:18,356 INFO L225 Difference]: With dead ends: 908 [2018-12-02 01:15:18,356 INFO L226 Difference]: Without dead ends: 486 [2018-12-02 01:15:18,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-12-02 01:15:18,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 447. [2018-12-02 01:15:18,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 01:15:18,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 664 transitions. [2018-12-02 01:15:18,382 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 664 transitions. Word has length 165 [2018-12-02 01:15:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:18,382 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 664 transitions. [2018-12-02 01:15:18,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:18,382 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 664 transitions. [2018-12-02 01:15:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 01:15:18,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:18,383 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:18,383 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:18,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:18,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1267760092, now seen corresponding path program 1 times [2018-12-02 01:15:18,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:18,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,384 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-02 01:15:18,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:18,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:18,417 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:18,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:18,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:18,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:18,417 INFO L87 Difference]: Start difference. First operand 447 states and 664 transitions. Second operand 4 states. [2018-12-02 01:15:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:18,579 INFO L93 Difference]: Finished difference Result 882 states and 1318 transitions. [2018-12-02 01:15:18,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:18,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 01:15:18,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:18,580 INFO L225 Difference]: With dead ends: 882 [2018-12-02 01:15:18,580 INFO L226 Difference]: Without dead ends: 460 [2018-12-02 01:15:18,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:18,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-12-02 01:15:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 447. [2018-12-02 01:15:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 01:15:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 663 transitions. [2018-12-02 01:15:18,606 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 663 transitions. Word has length 166 [2018-12-02 01:15:18,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:18,606 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 663 transitions. [2018-12-02 01:15:18,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:18,606 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 663 transitions. [2018-12-02 01:15:18,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-02 01:15:18,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:18,607 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:18,607 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:18,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:18,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2092592612, now seen corresponding path program 1 times [2018-12-02 01:15:18,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:18,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:18,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2018-12-02 01:15:18,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:18,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:18,641 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:18,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:18,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:18,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:18,642 INFO L87 Difference]: Start difference. First operand 447 states and 663 transitions. Second operand 4 states. [2018-12-02 01:15:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:19,047 INFO L93 Difference]: Finished difference Result 908 states and 1350 transitions. [2018-12-02 01:15:19,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:19,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2018-12-02 01:15:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:19,049 INFO L225 Difference]: With dead ends: 908 [2018-12-02 01:15:19,049 INFO L226 Difference]: Without dead ends: 486 [2018-12-02 01:15:19,050 INFO L631 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-12-02 01:15:19,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-12-02 01:15:19,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 447. [2018-12-02 01:15:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 01:15:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 662 transitions. [2018-12-02 01:15:19,088 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 662 transitions. Word has length 166 [2018-12-02 01:15:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:19,089 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 662 transitions. [2018-12-02 01:15:19,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 662 transitions. [2018-12-02 01:15:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 01:15:19,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:19,089 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:19,089 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:19,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 502764876, now seen corresponding path program 1 times [2018-12-02 01:15:19,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:19,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:19,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 01:15:19,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:19,135 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:19,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:19,135 INFO L87 Difference]: Start difference. First operand 447 states and 662 transitions. Second operand 4 states. [2018-12-02 01:15:19,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:19,336 INFO L93 Difference]: Finished difference Result 893 states and 1330 transitions. [2018-12-02 01:15:19,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:19,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2018-12-02 01:15:19,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:19,337 INFO L225 Difference]: With dead ends: 893 [2018-12-02 01:15:19,337 INFO L226 Difference]: Without dead ends: 471 [2018-12-02 01:15:19,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-12-02 01:15:19,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 447. [2018-12-02 01:15:19,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 01:15:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 661 transitions. [2018-12-02 01:15:19,364 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 661 transitions. Word has length 167 [2018-12-02 01:15:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:19,364 INFO L480 AbstractCegarLoop]: Abstraction has 447 states and 661 transitions. [2018-12-02 01:15:19,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 661 transitions. [2018-12-02 01:15:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-02 01:15:19,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:19,365 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:19,365 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:19,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash -838701495, now seen corresponding path program 1 times [2018-12-02 01:15:19,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:19,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:19,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:19,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:19,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:19,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:19,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:19,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:19,434 INFO L87 Difference]: Start difference. First operand 447 states and 661 transitions. Second operand 5 states. [2018-12-02 01:15:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:19,770 INFO L93 Difference]: Finished difference Result 945 states and 1411 transitions. [2018-12-02 01:15:19,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 01:15:19,771 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2018-12-02 01:15:19,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:19,771 INFO L225 Difference]: With dead ends: 945 [2018-12-02 01:15:19,771 INFO L226 Difference]: Without dead ends: 523 [2018-12-02 01:15:19,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 01:15:19,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2018-12-02 01:15:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 480. [2018-12-02 01:15:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-02 01:15:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 720 transitions. [2018-12-02 01:15:19,799 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 720 transitions. Word has length 167 [2018-12-02 01:15:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:19,799 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 720 transitions. [2018-12-02 01:15:19,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 720 transitions. [2018-12-02 01:15:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-02 01:15:19,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:19,800 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:19,800 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:19,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:19,800 INFO L82 PathProgramCache]: Analyzing trace with hash 35265545, now seen corresponding path program 1 times [2018-12-02 01:15:19,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:19,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:19,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:19,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:19,835 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-12-02 01:15:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:19,835 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:19,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:19,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:19,836 INFO L87 Difference]: Start difference. First operand 480 states and 720 transitions. Second operand 4 states. [2018-12-02 01:15:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:20,036 INFO L93 Difference]: Finished difference Result 957 states and 1444 transitions. [2018-12-02 01:15:20,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:20,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2018-12-02 01:15:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:20,037 INFO L225 Difference]: With dead ends: 957 [2018-12-02 01:15:20,037 INFO L226 Difference]: Without dead ends: 502 [2018-12-02 01:15:20,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:20,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2018-12-02 01:15:20,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 480. [2018-12-02 01:15:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-02 01:15:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 719 transitions. [2018-12-02 01:15:20,065 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 719 transitions. Word has length 168 [2018-12-02 01:15:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:20,065 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 719 transitions. [2018-12-02 01:15:20,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:20,065 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 719 transitions. [2018-12-02 01:15:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-02 01:15:20,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:20,066 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:20,066 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:20,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:20,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1712211829, now seen corresponding path program 1 times [2018-12-02 01:15:20,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:20,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:20,098 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2018-12-02 01:15:20,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:20,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:15:20,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:15:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:15:20,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:15:20,098 INFO L87 Difference]: Start difference. First operand 480 states and 719 transitions. Second operand 3 states. [2018-12-02 01:15:20,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:20,167 INFO L93 Difference]: Finished difference Result 1383 states and 2093 transitions. [2018-12-02 01:15:20,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:15:20,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2018-12-02 01:15:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:20,168 INFO L225 Difference]: With dead ends: 1383 [2018-12-02 01:15:20,168 INFO L226 Difference]: Without dead ends: 928 [2018-12-02 01:15:20,168 INFO L631 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-12-02 01:15:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-12-02 01:15:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 928. [2018-12-02 01:15:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 928 states. [2018-12-02 01:15:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1393 transitions. [2018-12-02 01:15:20,222 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1393 transitions. Word has length 171 [2018-12-02 01:15:20,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:20,222 INFO L480 AbstractCegarLoop]: Abstraction has 928 states and 1393 transitions. [2018-12-02 01:15:20,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:15:20,222 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1393 transitions. [2018-12-02 01:15:20,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 01:15:20,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:20,223 INFO L402 BasicCegarLoop]: trace histogram [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-12-02 01:15:20,223 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:20,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:20,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1315283281, now seen corresponding path program 1 times [2018-12-02 01:15:20,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:20,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:20,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:20,252 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:20,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:20,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:15:20,253 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:20,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:15:20,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:15:20,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:15:20,253 INFO L87 Difference]: Start difference. First operand 928 states and 1393 transitions. Second operand 3 states. [2018-12-02 01:15:20,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:20,365 INFO L93 Difference]: Finished difference Result 2277 states and 3436 transitions. [2018-12-02 01:15:20,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:15:20,365 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2018-12-02 01:15:20,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:20,366 INFO L225 Difference]: With dead ends: 2277 [2018-12-02 01:15:20,366 INFO L226 Difference]: Without dead ends: 1374 [2018-12-02 01:15:20,367 INFO L631 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-12-02 01:15:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2018-12-02 01:15:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1372. [2018-12-02 01:15:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2018-12-02 01:15:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 2062 transitions. [2018-12-02 01:15:20,448 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 2062 transitions. Word has length 172 [2018-12-02 01:15:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:20,448 INFO L480 AbstractCegarLoop]: Abstraction has 1372 states and 2062 transitions. [2018-12-02 01:15:20,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:15:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 2062 transitions. [2018-12-02 01:15:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-02 01:15:20,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:20,449 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:20,449 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:20,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1017411800, now seen corresponding path program 1 times [2018-12-02 01:15:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:20,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 01:15:20,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:20,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:20,491 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:20,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:20,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:20,492 INFO L87 Difference]: Start difference. First operand 1372 states and 2062 transitions. Second operand 4 states. [2018-12-02 01:15:20,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:20,824 INFO L93 Difference]: Finished difference Result 2824 states and 4227 transitions. [2018-12-02 01:15:20,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:20,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2018-12-02 01:15:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:20,826 INFO L225 Difference]: With dead ends: 2824 [2018-12-02 01:15:20,826 INFO L226 Difference]: Without dead ends: 1477 [2018-12-02 01:15:20,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:20,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2018-12-02 01:15:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1282. [2018-12-02 01:15:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-12-02 01:15:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1924 transitions. [2018-12-02 01:15:20,910 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1924 transitions. Word has length 172 [2018-12-02 01:15:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:20,910 INFO L480 AbstractCegarLoop]: Abstraction has 1282 states and 1924 transitions. [2018-12-02 01:15:20,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1924 transitions. [2018-12-02 01:15:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 01:15:20,911 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:20,911 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-12-02 01:15:20,911 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:20,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:20,911 INFO L82 PathProgramCache]: Analyzing trace with hash 691730023, now seen corresponding path program 1 times [2018-12-02 01:15:20,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:20,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:20,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-02 01:15:20,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:20,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:20,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:20,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:20,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:20,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:20,948 INFO L87 Difference]: Start difference. First operand 1282 states and 1924 transitions. Second operand 4 states. [2018-12-02 01:15:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:21,234 INFO L93 Difference]: Finished difference Result 2728 states and 4080 transitions. [2018-12-02 01:15:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:21,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2018-12-02 01:15:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:21,235 INFO L225 Difference]: With dead ends: 2728 [2018-12-02 01:15:21,235 INFO L226 Difference]: Without dead ends: 1471 [2018-12-02 01:15:21,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2018-12-02 01:15:21,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1375. [2018-12-02 01:15:21,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1375 states. [2018-12-02 01:15:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 2062 transitions. [2018-12-02 01:15:21,318 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 2062 transitions. Word has length 173 [2018-12-02 01:15:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:21,318 INFO L480 AbstractCegarLoop]: Abstraction has 1375 states and 2062 transitions. [2018-12-02 01:15:21,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 2062 transitions. [2018-12-02 01:15:21,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 01:15:21,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:21,319 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:21,319 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:21,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2008729, now seen corresponding path program 1 times [2018-12-02 01:15:21,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:21,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-02 01:15:21,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:21,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:15:21,346 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:21,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:15:21,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:15:21,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:15:21,347 INFO L87 Difference]: Start difference. First operand 1375 states and 2062 transitions. Second operand 3 states. [2018-12-02 01:15:21,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:21,469 INFO L93 Difference]: Finished difference Result 3142 states and 4730 transitions. [2018-12-02 01:15:21,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:15:21,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-02 01:15:21,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:21,470 INFO L225 Difference]: With dead ends: 3142 [2018-12-02 01:15:21,471 INFO L226 Difference]: Without dead ends: 1792 [2018-12-02 01:15:21,471 INFO L631 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-12-02 01:15:21,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2018-12-02 01:15:21,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1787. [2018-12-02 01:15:21,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1787 states. [2018-12-02 01:15:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1787 states to 1787 states and 2684 transitions. [2018-12-02 01:15:21,581 INFO L78 Accepts]: Start accepts. Automaton has 1787 states and 2684 transitions. Word has length 173 [2018-12-02 01:15:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:21,581 INFO L480 AbstractCegarLoop]: Abstraction has 1787 states and 2684 transitions. [2018-12-02 01:15:21,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:15:21,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1787 states and 2684 transitions. [2018-12-02 01:15:21,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 01:15:21,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:21,582 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:21,582 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:21,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:21,582 INFO L82 PathProgramCache]: Analyzing trace with hash -582762921, now seen corresponding path program 1 times [2018-12-02 01:15:21,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:21,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-12-02 01:15:21,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:21,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:15:21,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:21,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:15:21,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:15:21,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:15:21,606 INFO L87 Difference]: Start difference. First operand 1787 states and 2684 transitions. Second operand 3 states. [2018-12-02 01:15:21,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:21,727 INFO L93 Difference]: Finished difference Result 3576 states and 5377 transitions. [2018-12-02 01:15:21,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:15:21,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-02 01:15:21,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:21,729 INFO L225 Difference]: With dead ends: 3576 [2018-12-02 01:15:21,729 INFO L226 Difference]: Without dead ends: 1814 [2018-12-02 01:15:21,730 INFO L631 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-12-02 01:15:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1814 states. [2018-12-02 01:15:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1814 to 1814. [2018-12-02 01:15:21,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1814 states. [2018-12-02 01:15:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1814 states to 1814 states and 2719 transitions. [2018-12-02 01:15:21,860 INFO L78 Accepts]: Start accepts. Automaton has 1814 states and 2719 transitions. Word has length 173 [2018-12-02 01:15:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:21,861 INFO L480 AbstractCegarLoop]: Abstraction has 1814 states and 2719 transitions. [2018-12-02 01:15:21,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:15:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1814 states and 2719 transitions. [2018-12-02 01:15:21,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-02 01:15:21,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:21,862 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:21,862 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:21,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:21,862 INFO L82 PathProgramCache]: Analyzing trace with hash -847410411, now seen corresponding path program 1 times [2018-12-02 01:15:21,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:21,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:21,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:21,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-12-02 01:15:21,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:21,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 01:15:21,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:21,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 01:15:21,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 01:15:21,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 01:15:21,885 INFO L87 Difference]: Start difference. First operand 1814 states and 2719 transitions. Second operand 3 states. [2018-12-02 01:15:22,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:22,006 INFO L93 Difference]: Finished difference Result 3605 states and 5413 transitions. [2018-12-02 01:15:22,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 01:15:22,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2018-12-02 01:15:22,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:22,007 INFO L225 Difference]: With dead ends: 3605 [2018-12-02 01:15:22,007 INFO L226 Difference]: Without dead ends: 1816 [2018-12-02 01:15:22,008 INFO L631 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-12-02 01:15:22,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2018-12-02 01:15:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1816. [2018-12-02 01:15:22,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-02 01:15:22,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2721 transitions. [2018-12-02 01:15:22,126 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2721 transitions. Word has length 173 [2018-12-02 01:15:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:22,126 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2721 transitions. [2018-12-02 01:15:22,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 01:15:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2721 transitions. [2018-12-02 01:15:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-02 01:15:22,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:22,127 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:22,127 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:22,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash 2057500298, now seen corresponding path program 1 times [2018-12-02 01:15:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:22,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:22,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:22,167 INFO L87 Difference]: Start difference. First operand 1816 states and 2721 transitions. Second operand 4 states. [2018-12-02 01:15:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:22,571 INFO L93 Difference]: Finished difference Result 3750 states and 5599 transitions. [2018-12-02 01:15:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:22,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2018-12-02 01:15:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:22,573 INFO L225 Difference]: With dead ends: 3750 [2018-12-02 01:15:22,573 INFO L226 Difference]: Without dead ends: 1961 [2018-12-02 01:15:22,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:22,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-12-02 01:15:22,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2018-12-02 01:15:22,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-02 01:15:22,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2717 transitions. [2018-12-02 01:15:22,693 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2717 transitions. Word has length 177 [2018-12-02 01:15:22,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:22,693 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2717 transitions. [2018-12-02 01:15:22,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:22,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2717 transitions. [2018-12-02 01:15:22,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-02 01:15:22,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:22,694 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:22,694 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:22,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:22,694 INFO L82 PathProgramCache]: Analyzing trace with hash -958136487, now seen corresponding path program 1 times [2018-12-02 01:15:22,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:22,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:22,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:22,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:22,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:22,733 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:22,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:22,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:22,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:22,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:22,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:22,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:22,734 INFO L87 Difference]: Start difference. First operand 1816 states and 2717 transitions. Second operand 4 states. [2018-12-02 01:15:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:23,154 INFO L93 Difference]: Finished difference Result 3750 states and 5591 transitions. [2018-12-02 01:15:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:23,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2018-12-02 01:15:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:23,156 INFO L225 Difference]: With dead ends: 3750 [2018-12-02 01:15:23,156 INFO L226 Difference]: Without dead ends: 1961 [2018-12-02 01:15:23,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:23,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-12-02 01:15:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2018-12-02 01:15:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-02 01:15:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2713 transitions. [2018-12-02 01:15:23,283 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2713 transitions. Word has length 178 [2018-12-02 01:15:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:23,284 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2713 transitions. [2018-12-02 01:15:23,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2713 transitions. [2018-12-02 01:15:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-02 01:15:23,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:23,285 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:23,285 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:23,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:23,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1311166383, now seen corresponding path program 1 times [2018-12-02 01:15:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:23,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:23,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:23,286 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:23,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:23,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:23,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:23,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:23,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:23,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:23,330 INFO L87 Difference]: Start difference. First operand 1816 states and 2713 transitions. Second operand 4 states. [2018-12-02 01:15:23,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:23,735 INFO L93 Difference]: Finished difference Result 3750 states and 5583 transitions. [2018-12-02 01:15:23,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:23,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2018-12-02 01:15:23,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:23,737 INFO L225 Difference]: With dead ends: 3750 [2018-12-02 01:15:23,737 INFO L226 Difference]: Without dead ends: 1961 [2018-12-02 01:15:23,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2018-12-02 01:15:23,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1816. [2018-12-02 01:15:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-02 01:15:23,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2709 transitions. [2018-12-02 01:15:23,868 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2709 transitions. Word has length 179 [2018-12-02 01:15:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2709 transitions. [2018-12-02 01:15:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2709 transitions. [2018-12-02 01:15:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-02 01:15:23,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:23,869 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:23,869 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:23,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:23,869 INFO L82 PathProgramCache]: Analyzing trace with hash -90125986, now seen corresponding path program 1 times [2018-12-02 01:15:23,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:23,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:23,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:23,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:23,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:23,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:23,914 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:23,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:23,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:23,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:23,915 INFO L87 Difference]: Start difference. First operand 1816 states and 2709 transitions. Second operand 4 states. [2018-12-02 01:15:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:24,309 INFO L93 Difference]: Finished difference Result 3710 states and 5527 transitions. [2018-12-02 01:15:24,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:24,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-12-02 01:15:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:24,311 INFO L225 Difference]: With dead ends: 3710 [2018-12-02 01:15:24,311 INFO L226 Difference]: Without dead ends: 1921 [2018-12-02 01:15:24,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:24,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2018-12-02 01:15:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1816. [2018-12-02 01:15:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1816 states. [2018-12-02 01:15:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1816 states to 1816 states and 2705 transitions. [2018-12-02 01:15:24,433 INFO L78 Accepts]: Start accepts. Automaton has 1816 states and 2705 transitions. Word has length 180 [2018-12-02 01:15:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:24,433 INFO L480 AbstractCegarLoop]: Abstraction has 1816 states and 2705 transitions. [2018-12-02 01:15:24,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states and 2705 transitions. [2018-12-02 01:15:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-02 01:15:24,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:24,434 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:24,434 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:24,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1051235835, now seen corresponding path program 1 times [2018-12-02 01:15:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:24,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:24,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:24,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:24,494 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:24,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:24,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:24,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:24,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:24,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:24,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:24,494 INFO L87 Difference]: Start difference. First operand 1816 states and 2705 transitions. Second operand 5 states. [2018-12-02 01:15:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:25,010 INFO L93 Difference]: Finished difference Result 4054 states and 6060 transitions. [2018-12-02 01:15:25,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:25,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 182 [2018-12-02 01:15:25,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:25,012 INFO L225 Difference]: With dead ends: 4054 [2018-12-02 01:15:25,012 INFO L226 Difference]: Without dead ends: 2265 [2018-12-02 01:15:25,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:25,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2265 states. [2018-12-02 01:15:25,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2265 to 1975. [2018-12-02 01:15:25,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2018-12-02 01:15:25,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2992 transitions. [2018-12-02 01:15:25,137 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2992 transitions. Word has length 182 [2018-12-02 01:15:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:25,137 INFO L480 AbstractCegarLoop]: Abstraction has 1975 states and 2992 transitions. [2018-12-02 01:15:25,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:25,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2992 transitions. [2018-12-02 01:15:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-02 01:15:25,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:25,138 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:25,138 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:25,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1972912689, now seen corresponding path program 1 times [2018-12-02 01:15:25,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:25,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:25,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:25,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:25,205 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:25,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:25,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:25,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:25,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:25,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:25,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:25,206 INFO L87 Difference]: Start difference. First operand 1975 states and 2992 transitions. Second operand 5 states. [2018-12-02 01:15:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:25,687 INFO L93 Difference]: Finished difference Result 4325 states and 6567 transitions. [2018-12-02 01:15:25,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:25,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2018-12-02 01:15:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:25,689 INFO L225 Difference]: With dead ends: 4325 [2018-12-02 01:15:25,689 INFO L226 Difference]: Without dead ends: 2377 [2018-12-02 01:15:25,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2018-12-02 01:15:25,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2083. [2018-12-02 01:15:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2018-12-02 01:15:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3212 transitions. [2018-12-02 01:15:25,817 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3212 transitions. Word has length 183 [2018-12-02 01:15:25,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:25,817 INFO L480 AbstractCegarLoop]: Abstraction has 2083 states and 3212 transitions. [2018-12-02 01:15:25,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:25,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3212 transitions. [2018-12-02 01:15:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 01:15:25,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:25,818 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:25,818 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:25,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:25,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1699515570, now seen corresponding path program 1 times [2018-12-02 01:15:25,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:25,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:25,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-02 01:15:25,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:25,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:25,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:25,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:25,861 INFO L87 Difference]: Start difference. First operand 2083 states and 3212 transitions. Second operand 4 states. [2018-12-02 01:15:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:26,216 INFO L93 Difference]: Finished difference Result 4224 states and 6513 transitions. [2018-12-02 01:15:26,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:26,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2018-12-02 01:15:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:26,218 INFO L225 Difference]: With dead ends: 4224 [2018-12-02 01:15:26,218 INFO L226 Difference]: Without dead ends: 2168 [2018-12-02 01:15:26,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-12-02 01:15:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2083. [2018-12-02 01:15:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2083 states. [2018-12-02 01:15:26,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3208 transitions. [2018-12-02 01:15:26,351 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3208 transitions. Word has length 196 [2018-12-02 01:15:26,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:26,351 INFO L480 AbstractCegarLoop]: Abstraction has 2083 states and 3208 transitions. [2018-12-02 01:15:26,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3208 transitions. [2018-12-02 01:15:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 01:15:26,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:26,353 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:26,353 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:26,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1145207773, now seen corresponding path program 1 times [2018-12-02 01:15:26,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:26,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:26,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:26,705 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 21 proven. 303 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-12-02 01:15:26,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:26,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:15:26,706 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-02 01:15:26,707 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [337], [342], [377], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:15:26,732 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:15:26,732 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:15:27,248 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:15:27,249 INFO L272 AbstractInterpreter]: Visited 84 different actions 286 times. Merged at 69 different actions 186 times. Never widened. Performed 2183 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2183 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 12 different actions. Largest state had 137 variables. [2018-12-02 01:15:27,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:27,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:15:27,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:27,255 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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-12-02 01:15:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:27,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:15:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:27,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:15:27,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,416 INFO L478 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 31 treesize of output 40 [2018-12-02 01:15:27,442 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,443 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 01:15:27,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,463 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 01:15:27,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-02 01:15:27,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 01:15:27,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 01:15:27,502 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,503 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 01:15:27,506 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,519 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,524 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,537 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-12-02 01:15:27,537 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 01:15:27,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 01:15:27,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 01:15:27,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,634 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,635 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 01:15:27,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 01:15:27,662 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,678 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,697 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,705 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 01:15:27,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,729 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:27,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,759 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,766 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:27,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,816 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,850 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,851 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,854 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:15:27,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,883 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,887 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:27,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:27,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:27,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:27,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:27,948 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:27,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:15:27,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:15:27,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,979 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:27,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:15:27,985 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,016 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:15:28,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 131 [2018-12-02 01:15:28,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:15:28,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 153 [2018-12-02 01:15:28,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:15:28,049 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-12-02 01:15:28,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:15:28,071 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,080 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:208, output treesize:100 [2018-12-02 01:15:28,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2018-12-02 01:15:28,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 39 treesize of output 31 [2018-12-02 01:15:28,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-02 01:15:28,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:15:28,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,134 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:121, output treesize:82 [2018-12-02 01:15:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-02 01:15:28,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:15:28,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,254 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:41, output treesize:1 [2018-12-02 01:15:28,310 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,335 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,339 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,340 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,345 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,359 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:28,361 INFO L478 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 122 treesize of output 121 [2018-12-02 01:15:28,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:28,365 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 106 [2018-12-02 01:15:28,365 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,371 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:28,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 01:15:28,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-12-02 01:15:28,373 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,379 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,383 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:28,385 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:28,386 INFO L478 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 122 treesize of output 104 [2018-12-02 01:15:28,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:28,389 INFO L478 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 94 treesize of output 81 [2018-12-02 01:15:28,389 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-12-02 01:15:28,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2018-12-02 01:15:28,398 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,401 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,405 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 24 [2018-12-02 01:15:28,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:15:28,416 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,419 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,420 INFO L478 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 76 treesize of output 46 [2018-12-02 01:15:28,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:15:28,421 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,423 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:28,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 01:15:28,428 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2018-12-02 01:15:28,439 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,445 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 01:15:28,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:15:28,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:15:28,485 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,492 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,496 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 01:15:28,504 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:15:28,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:15:28,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,544 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,550 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,552 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:28,553 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:25 [2018-12-02 01:15:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-12-02 01:15:28,637 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:15:28,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [12] total 21 [2018-12-02 01:15:28,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:28,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 01:15:28,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 01:15:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-12-02 01:15:28,638 INFO L87 Difference]: Start difference. First operand 2083 states and 3208 transitions. Second operand 7 states. [2018-12-02 01:15:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:29,903 INFO L93 Difference]: Finished difference Result 6171 states and 9516 transitions. [2018-12-02 01:15:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 01:15:29,904 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 196 [2018-12-02 01:15:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:29,911 INFO L225 Difference]: With dead ends: 6171 [2018-12-02 01:15:29,911 INFO L226 Difference]: Without dead ends: 4115 [2018-12-02 01:15:29,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 380 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-02 01:15:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4115 states. [2018-12-02 01:15:30,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4115 to 2091. [2018-12-02 01:15:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2018-12-02 01:15:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3216 transitions. [2018-12-02 01:15:30,095 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3216 transitions. Word has length 196 [2018-12-02 01:15:30,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:30,096 INFO L480 AbstractCegarLoop]: Abstraction has 2091 states and 3216 transitions. [2018-12-02 01:15:30,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 01:15:30,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3216 transitions. [2018-12-02 01:15:30,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-02 01:15:30,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:30,098 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:30,098 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:30,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:30,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2020781821, now seen corresponding path program 1 times [2018-12-02 01:15:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:30,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:30,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:30,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 277 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-12-02 01:15:30,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:30,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:15:30,538 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 197 with the following transitions: [2018-12-02 01:15:30,539 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:15:30,541 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:15:30,541 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:15:30,758 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:15:30,758 INFO L272 AbstractInterpreter]: Visited 84 different actions 222 times. Merged at 67 different actions 128 times. Never widened. Performed 1631 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1631 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 15 fixpoints after 8 different actions. Largest state had 138 variables. [2018-12-02 01:15:30,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:30,761 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:15:30,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:30,761 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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-12-02 01:15:30,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:30,769 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:15:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:30,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:15:30,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,873 INFO L478 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 31 treesize of output 40 [2018-12-02 01:15:30,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 01:15:30,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 01:15:30,912 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,918 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-02 01:15:30,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 01:15:30,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 01:15:30,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,943 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,944 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:30,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 01:15:30,945 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,953 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:30,976 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-12-02 01:15:30,976 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 01:15:31,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,041 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 01:15:31,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,066 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 01:15:31,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,074 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 01:15:31,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,092 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,094 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 01:15:31,107 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,137 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,145 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,153 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 01:15:31,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:31,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:31,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:31,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:31,204 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,205 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,206 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:31,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,220 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:31,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:15:31,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:15:31,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:15:31,266 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,282 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,289 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,296 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:15:31,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:31,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:31,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:31,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:15:31,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,332 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:15:31,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:15:31,356 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:15:31,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,376 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:15:31,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,383 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,384 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:15:31,392 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,409 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:15:31,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:15:31,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:15:31,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:15:31,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:15:31,451 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,463 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:15:31,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:15:31,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,483 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:15:31,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,491 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:15:31,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,517 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,531 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:15:31,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:15:31,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:15:31,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:15:31,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:15:31,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:15:31,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 109 treesize of output 80 [2018-12-02 01:15:31,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:15:31,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,608 INFO L478 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 79 treesize of output 55 [2018-12-02 01:15:31,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:15:31,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,637 INFO L478 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 44 treesize of output 49 [2018-12-02 01:15:31,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,643 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:15:31,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,657 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,732 INFO L478 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 120 treesize of output 121 [2018-12-02 01:15:31,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:15:31,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,744 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,776 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,784 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,815 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,818 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:31,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 240 treesize of output 182 [2018-12-02 01:15:31,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 232 [2018-12-02 01:15:31,877 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 153 [2018-12-02 01:15:31,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:15:31,914 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 125 [2018-12-02 01:15:31,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:31,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 210 [2018-12-02 01:15:31,965 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:31,988 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,000 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,012 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-02 01:15:32,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 01:15:32,034 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,039 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,052 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 01:15:32,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-12-02 01:15:32,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12-02 01:15:32,087 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 01:15:32,113 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,115 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-12-02 01:15:32,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,123 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-12-02 01:15:32,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-12-02 01:15:32,137 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,143 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,148 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 01:15:32,367 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:32,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:15:32,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,453 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 218 [2018-12-02 01:15:32,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:32,461 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 191 [2018-12-02 01:15:32,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,496 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,519 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,534 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,548 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,551 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,562 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,564 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 196 [2018-12-02 01:15:32,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 191 treesize of output 187 [2018-12-02 01:15:32,579 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,583 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 187 treesize of output 159 [2018-12-02 01:15:32,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:15:32,596 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,607 INFO L478 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 158 treesize of output 129 [2018-12-02 01:15:32,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,620 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,620 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-12-02 01:15:32,621 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 182 treesize of output 168 [2018-12-02 01:15:32,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:15:32,635 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,642 INFO L478 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-12-02 01:15:32,642 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,645 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 112 [2018-12-02 01:15:32,654 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,655 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,655 INFO L478 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 107 treesize of output 98 [2018-12-02 01:15:32,655 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2018-12-02 01:15:32,668 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,677 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,677 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,678 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,678 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,678 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,679 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:32,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-02 01:15:32,679 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:32,687 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:32,694 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:32,699 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:32,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 01:15:32,707 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:109 [2018-12-02 01:15:32,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 01:15:32,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 41 treesize of output 37 [2018-12-02 01:15:32,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,741 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,742 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 01:15:32,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-02 01:15:32,800 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 01:15:32,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 41 treesize of output 37 [2018-12-02 01:15:32,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 01:15:32,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,848 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 01:15:32,870 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:15:32,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:15:32,907 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,909 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,919 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,921 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 01:15:32,939 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:15:32,958 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:15:32,976 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,985 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,987 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:32,998 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:33,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:33,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:33,001 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:25 [2018-12-02 01:15:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:33,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:15:33,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 25 [2018-12-02 01:15:33,118 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:15:33,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 01:15:33,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 01:15:33,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-12-02 01:15:33,118 INFO L87 Difference]: Start difference. First operand 2091 states and 3216 transitions. Second operand 18 states. [2018-12-02 01:15:37,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:37,496 INFO L93 Difference]: Finished difference Result 7038 states and 10685 transitions. [2018-12-02 01:15:37,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 01:15:37,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 196 [2018-12-02 01:15:37,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:37,502 INFO L225 Difference]: With dead ends: 7038 [2018-12-02 01:15:37,502 INFO L226 Difference]: Without dead ends: 4974 [2018-12-02 01:15:37,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 371 SyntacticMatches, 18 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=238, Invalid=1094, Unknown=0, NotChecked=0, Total=1332 [2018-12-02 01:15:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4974 states. [2018-12-02 01:15:37,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4974 to 2859. [2018-12-02 01:15:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2018-12-02 01:15:37,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4520 transitions. [2018-12-02 01:15:37,707 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4520 transitions. Word has length 196 [2018-12-02 01:15:37,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:37,707 INFO L480 AbstractCegarLoop]: Abstraction has 2859 states and 4520 transitions. [2018-12-02 01:15:37,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 01:15:37,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4520 transitions. [2018-12-02 01:15:37,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-02 01:15:37,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:37,710 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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] [2018-12-02 01:15:37,710 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:37,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash 114782751, now seen corresponding path program 1 times [2018-12-02 01:15:37,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:37,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 01:15:37,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:37,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:37,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:37,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:37,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:37,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:37,785 INFO L87 Difference]: Start difference. First operand 2859 states and 4520 transitions. Second operand 4 states. [2018-12-02 01:15:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:38,245 INFO L93 Difference]: Finished difference Result 5796 states and 9149 transitions. [2018-12-02 01:15:38,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:38,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 204 [2018-12-02 01:15:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:38,248 INFO L225 Difference]: With dead ends: 5796 [2018-12-02 01:15:38,249 INFO L226 Difference]: Without dead ends: 2964 [2018-12-02 01:15:38,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:38,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2964 states. [2018-12-02 01:15:38,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2964 to 2859. [2018-12-02 01:15:38,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2018-12-02 01:15:38,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4516 transitions. [2018-12-02 01:15:38,451 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4516 transitions. Word has length 204 [2018-12-02 01:15:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:38,452 INFO L480 AbstractCegarLoop]: Abstraction has 2859 states and 4516 transitions. [2018-12-02 01:15:38,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4516 transitions. [2018-12-02 01:15:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-02 01:15:38,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:38,453 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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] [2018-12-02 01:15:38,453 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:38,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:38,453 INFO L82 PathProgramCache]: Analyzing trace with hash -741340048, now seen corresponding path program 1 times [2018-12-02 01:15:38,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:38,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:38,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:38,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 01:15:38,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:38,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:38,521 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:38,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:38,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:38,522 INFO L87 Difference]: Start difference. First operand 2859 states and 4516 transitions. Second operand 4 states. [2018-12-02 01:15:39,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:39,038 INFO L93 Difference]: Finished difference Result 5788 states and 9133 transitions. [2018-12-02 01:15:39,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:39,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 205 [2018-12-02 01:15:39,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:39,042 INFO L225 Difference]: With dead ends: 5788 [2018-12-02 01:15:39,042 INFO L226 Difference]: Without dead ends: 2956 [2018-12-02 01:15:39,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2018-12-02 01:15:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2859. [2018-12-02 01:15:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2859 states. [2018-12-02 01:15:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2859 states to 2859 states and 4512 transitions. [2018-12-02 01:15:39,266 INFO L78 Accepts]: Start accepts. Automaton has 2859 states and 4512 transitions. Word has length 205 [2018-12-02 01:15:39,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:39,266 INFO L480 AbstractCegarLoop]: Abstraction has 2859 states and 4512 transitions. [2018-12-02 01:15:39,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:39,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2859 states and 4512 transitions. [2018-12-02 01:15:39,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-02 01:15:39,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:39,268 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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-12-02 01:15:39,268 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:39,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:39,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1566802382, now seen corresponding path program 1 times [2018-12-02 01:15:39,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:39,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:39,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:39,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-12-02 01:15:39,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:39,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:15:39,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:39,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:15:39,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:15:39,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:39,365 INFO L87 Difference]: Start difference. First operand 2859 states and 4512 transitions. Second operand 6 states. [2018-12-02 01:15:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:40,288 INFO L93 Difference]: Finished difference Result 6411 states and 10022 transitions. [2018-12-02 01:15:40,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:15:40,289 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 209 [2018-12-02 01:15:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:40,292 INFO L225 Difference]: With dead ends: 6411 [2018-12-02 01:15:40,292 INFO L226 Difference]: Without dead ends: 3579 [2018-12-02 01:15:40,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:15:40,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3579 states. [2018-12-02 01:15:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3579 to 2487. [2018-12-02 01:15:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2487 states. [2018-12-02 01:15:40,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3880 transitions. [2018-12-02 01:15:40,474 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3880 transitions. Word has length 209 [2018-12-02 01:15:40,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:40,474 INFO L480 AbstractCegarLoop]: Abstraction has 2487 states and 3880 transitions. [2018-12-02 01:15:40,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:15:40,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3880 transitions. [2018-12-02 01:15:40,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-02 01:15:40,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:40,475 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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-12-02 01:15:40,476 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:40,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:40,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1321595553, now seen corresponding path program 1 times [2018-12-02 01:15:40,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:40,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:40,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:40,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:40,569 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-12-02 01:15:40,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:40,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 01:15:40,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:40,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:15:40,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:15:40,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:40,570 INFO L87 Difference]: Start difference. First operand 2487 states and 3880 transitions. Second operand 6 states. [2018-12-02 01:15:41,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:41,422 INFO L93 Difference]: Finished difference Result 5519 states and 8550 transitions. [2018-12-02 01:15:41,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:15:41,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2018-12-02 01:15:41,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:41,426 INFO L225 Difference]: With dead ends: 5519 [2018-12-02 01:15:41,426 INFO L226 Difference]: Without dead ends: 3059 [2018-12-02 01:15:41,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 01:15:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-12-02 01:15:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2491. [2018-12-02 01:15:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2491 states. [2018-12-02 01:15:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3876 transitions. [2018-12-02 01:15:41,597 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3876 transitions. Word has length 210 [2018-12-02 01:15:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:41,597 INFO L480 AbstractCegarLoop]: Abstraction has 2491 states and 3876 transitions. [2018-12-02 01:15:41,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:15:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3876 transitions. [2018-12-02 01:15:41,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-02 01:15:41,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:41,599 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:41,599 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:41,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:41,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1329950505, now seen corresponding path program 1 times [2018-12-02 01:15:41,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:41,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:41,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:41,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:41,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:41,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:41,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:41,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:41,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:41,685 INFO L87 Difference]: Start difference. First operand 2491 states and 3876 transitions. Second operand 5 states. [2018-12-02 01:15:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:42,227 INFO L93 Difference]: Finished difference Result 5485 states and 8535 transitions. [2018-12-02 01:15:42,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:42,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 216 [2018-12-02 01:15:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:42,230 INFO L225 Difference]: With dead ends: 5485 [2018-12-02 01:15:42,230 INFO L226 Difference]: Without dead ends: 3021 [2018-12-02 01:15:42,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:42,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3021 states. [2018-12-02 01:15:42,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3021 to 2639. [2018-12-02 01:15:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2018-12-02 01:15:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 4136 transitions. [2018-12-02 01:15:42,401 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 4136 transitions. Word has length 216 [2018-12-02 01:15:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:42,402 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 4136 transitions. [2018-12-02 01:15:42,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 4136 transitions. [2018-12-02 01:15:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-02 01:15:42,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:42,403 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:42,403 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:42,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash -237193443, now seen corresponding path program 1 times [2018-12-02 01:15:42,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:42,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:42,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:42,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:42,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:42,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:42,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:42,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:42,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:42,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:42,486 INFO L87 Difference]: Start difference. First operand 2639 states and 4136 transitions. Second operand 5 states. [2018-12-02 01:15:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:43,030 INFO L93 Difference]: Finished difference Result 5621 states and 8771 transitions. [2018-12-02 01:15:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:43,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 217 [2018-12-02 01:15:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:43,032 INFO L225 Difference]: With dead ends: 5621 [2018-12-02 01:15:43,032 INFO L226 Difference]: Without dead ends: 3009 [2018-12-02 01:15:43,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2018-12-02 01:15:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2631. [2018-12-02 01:15:43,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-12-02 01:15:43,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4120 transitions. [2018-12-02 01:15:43,213 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4120 transitions. Word has length 217 [2018-12-02 01:15:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:43,213 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 4120 transitions. [2018-12-02 01:15:43,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:43,214 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4120 transitions. [2018-12-02 01:15:43,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-12-02 01:15:43,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:43,215 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:43,215 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:43,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:43,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1045084572, now seen corresponding path program 1 times [2018-12-02 01:15:43,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:43,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:43,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:43,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-12-02 01:15:43,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:43,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:43,269 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:43,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:43,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:43,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:43,269 INFO L87 Difference]: Start difference. First operand 2631 states and 4120 transitions. Second operand 4 states. [2018-12-02 01:15:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:43,680 INFO L93 Difference]: Finished difference Result 5328 states and 8337 transitions. [2018-12-02 01:15:43,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:43,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 221 [2018-12-02 01:15:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:43,682 INFO L225 Difference]: With dead ends: 5328 [2018-12-02 01:15:43,682 INFO L226 Difference]: Without dead ends: 2724 [2018-12-02 01:15:43,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:43,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2018-12-02 01:15:43,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 2631. [2018-12-02 01:15:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2631 states. [2018-12-02 01:15:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 4116 transitions. [2018-12-02 01:15:43,864 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 4116 transitions. Word has length 221 [2018-12-02 01:15:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:43,864 INFO L480 AbstractCegarLoop]: Abstraction has 2631 states and 4116 transitions. [2018-12-02 01:15:43,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 4116 transitions. [2018-12-02 01:15:43,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-02 01:15:43,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:43,866 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:43,866 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:43,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:43,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1712960192, now seen corresponding path program 1 times [2018-12-02 01:15:43,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:43,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:43,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:43,943 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 307 proven. 4 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2018-12-02 01:15:43,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:43,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:15:43,943 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 225 with the following transitions: [2018-12-02 01:15:43,943 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:15:43,945 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:15:43,945 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:15:44,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:15:44,239 INFO L272 AbstractInterpreter]: Visited 96 different actions 331 times. Merged at 77 different actions 213 times. Never widened. Performed 2619 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2619 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 16 different actions. Largest state had 148 variables. [2018-12-02 01:15:44,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:44,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:15:44,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:44,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:15:44,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:44,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:15:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:44,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:15:44,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-12-02 01:15:44,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:15:44,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 01:15:44,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2018-12-02 01:15:44,371 INFO L478 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 74 treesize of output 58 [2018-12-02 01:15:44,371 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:44,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:44,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 66 [2018-12-02 01:15:44,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 24 [2018-12-02 01:15:44,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 01:15:44,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 65 treesize of output 53 [2018-12-02 01:15:44,385 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:44,389 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:44,426 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 71 [2018-12-02 01:15:44,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-12-02 01:15:44,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-12-02 01:15:44,461 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,494 INFO L478 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 60 treesize of output 79 [2018-12-02 01:15:44,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,500 INFO L478 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 62 treesize of output 47 [2018-12-02 01:15:44,501 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,505 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,538 INFO L478 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 3 case distinctions, treesize of input 55 treesize of output 91 [2018-12-02 01:15:44,541 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 80 treesize of output 49 [2018-12-02 01:15:44,542 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,558 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,559 INFO L478 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 51 treesize of output 62 [2018-12-02 01:15:44,560 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,567 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,577 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-12-02 01:15:44,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 21 treesize of output 24 [2018-12-02 01:15:44,581 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:44,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 29 [2018-12-02 01:15:44,583 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,585 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,594 INFO L478 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 58 treesize of output 48 [2018-12-02 01:15:44,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:15:44,596 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 68 [2018-12-02 01:15:44,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:44,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 55 treesize of output 24 [2018-12-02 01:15:44,611 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,614 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,616 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 01:15:44,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 9 [2018-12-02 01:15:44,627 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,628 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 20 [2018-12-02 01:15:44,630 INFO L478 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 10 treesize of output 6 [2018-12-02 01:15:44,631 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,632 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:44,635 INFO L202 ElimStorePlain]: Needed 26 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 01:15:44,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:15:44,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:15:44,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:15:44,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:15:44,650 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,651 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:44,653 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 01:15:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 276 proven. 17 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-12-02 01:15:44,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:15:44,685 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:44,685 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 01:15:44,700 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 01:15:44,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:15:44,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 01:15:44,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:44,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:44,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:44,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:15:44,717 INFO L87 Difference]: Start difference. First operand 2631 states and 4116 transitions. Second operand 4 states. [2018-12-02 01:15:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:45,264 INFO L93 Difference]: Finished difference Result 5765 states and 9007 transitions. [2018-12-02 01:15:45,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:45,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-12-02 01:15:45,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:45,266 INFO L225 Difference]: With dead ends: 5765 [2018-12-02 01:15:45,266 INFO L226 Difference]: Without dead ends: 3161 [2018-12-02 01:15:45,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 445 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:15:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2018-12-02 01:15:45,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2695. [2018-12-02 01:15:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2018-12-02 01:15:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4202 transitions. [2018-12-02 01:15:45,445 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4202 transitions. Word has length 224 [2018-12-02 01:15:45,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:45,445 INFO L480 AbstractCegarLoop]: Abstraction has 2695 states and 4202 transitions. [2018-12-02 01:15:45,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4202 transitions. [2018-12-02 01:15:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-02 01:15:45,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:45,447 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:45,447 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:45,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:45,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1566796433, now seen corresponding path program 1 times [2018-12-02 01:15:45,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:45,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:45,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:45,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 312 proven. 5 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 01:15:45,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:45,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:15:45,522 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 226 with the following transitions: [2018-12-02 01:15:45,523 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [52], [54], [59], [64], [69], [74], [77], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:15:45,524 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:15:45,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:15:45,823 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:15:45,823 INFO L272 AbstractInterpreter]: Visited 96 different actions 331 times. Merged at 77 different actions 213 times. Never widened. Performed 2623 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2623 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 29 fixpoints after 16 different actions. Largest state had 148 variables. [2018-12-02 01:15:45,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:45,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:15:45,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:45,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:15:45,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:45,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:15:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:45,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:15:45,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-12-02 01:15:45,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-12-02 01:15:45,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:45,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:45,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:45,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2018-12-02 01:15:45,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 01:15:45,975 INFO L478 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 78 treesize of output 66 [2018-12-02 01:15:45,975 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:45,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:45,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-02 01:15:45,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 67 treesize of output 59 [2018-12-02 01:15:45,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:45,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:45,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-02 01:15:45,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-12-02 01:15:45,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:45,996 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 01:15:46,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 53 treesize of output 41 [2018-12-02 01:15:46,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:46,025 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:46,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 01:15:46,027 INFO L478 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 62 treesize of output 46 [2018-12-02 01:15:46,028 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:46,031 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:46,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-02 01:15:46,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2018-12-02 01:15:46,034 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,035 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,056 INFO L478 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 46 treesize of output 36 [2018-12-02 01:15:46,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:15:46,058 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 44 [2018-12-02 01:15:46,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 18 [2018-12-02 01:15:46,069 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,071 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,074 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,091 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 01:15:46,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-02 01:15:46,093 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-12-02 01:15:46,124 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 50 [2018-12-02 01:15:46,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 18 [2018-12-02 01:15:46,157 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,160 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,189 INFO L478 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 3 case distinctions, treesize of input 39 treesize of output 64 [2018-12-02 01:15:46,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 47 [2018-12-02 01:15:46,192 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,207 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,208 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:46,209 INFO L478 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 35 treesize of output 38 [2018-12-02 01:15:46,210 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,218 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:46,234 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:15:46,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:15:46,237 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,238 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:46,245 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 01:15:46,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:15:46,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:15:46,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:15:46,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:15:46,262 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,262 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:46,265 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:39, output treesize:7 [2018-12-02 01:15:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 283 proven. 13 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2018-12-02 01:15:46,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:15:46,298 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:46,298 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:88, output treesize:1 [2018-12-02 01:15:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-12-02 01:15:46,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 01:15:46,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 7] total 12 [2018-12-02 01:15:46,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:46,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:46,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-12-02 01:15:46,344 INFO L87 Difference]: Start difference. First operand 2695 states and 4202 transitions. Second operand 4 states. [2018-12-02 01:15:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:46,882 INFO L93 Difference]: Finished difference Result 5733 states and 8903 transitions. [2018-12-02 01:15:46,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:46,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 225 [2018-12-02 01:15:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:46,886 INFO L225 Difference]: With dead ends: 5733 [2018-12-02 01:15:46,886 INFO L226 Difference]: Without dead ends: 3065 [2018-12-02 01:15:46,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 447 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:15:46,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2018-12-02 01:15:47,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2695. [2018-12-02 01:15:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2018-12-02 01:15:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 4184 transitions. [2018-12-02 01:15:47,066 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 4184 transitions. Word has length 225 [2018-12-02 01:15:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:47,067 INFO L480 AbstractCegarLoop]: Abstraction has 2695 states and 4184 transitions. [2018-12-02 01:15:47,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4184 transitions. [2018-12-02 01:15:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-02 01:15:47,069 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:47,069 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:47,069 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:47,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1027087821, now seen corresponding path program 1 times [2018-12-02 01:15:47,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:47,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:47,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:47,139 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 01:15:47,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:47,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:47,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:47,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:47,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:47,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:47,140 INFO L87 Difference]: Start difference. First operand 2695 states and 4184 transitions. Second operand 4 states. [2018-12-02 01:15:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:47,566 INFO L93 Difference]: Finished difference Result 5496 states and 8500 transitions. [2018-12-02 01:15:47,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:47,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2018-12-02 01:15:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:47,569 INFO L225 Difference]: With dead ends: 5496 [2018-12-02 01:15:47,569 INFO L226 Difference]: Without dead ends: 2828 [2018-12-02 01:15:47,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:47,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2018-12-02 01:15:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 2738. [2018-12-02 01:15:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2738 states. [2018-12-02 01:15:47,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2738 states to 2738 states and 4235 transitions. [2018-12-02 01:15:47,749 INFO L78 Accepts]: Start accepts. Automaton has 2738 states and 4235 transitions. Word has length 226 [2018-12-02 01:15:47,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:47,750 INFO L480 AbstractCegarLoop]: Abstraction has 2738 states and 4235 transitions. [2018-12-02 01:15:47,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:47,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2738 states and 4235 transitions. [2018-12-02 01:15:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-02 01:15:47,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:47,752 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:47,752 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:47,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:47,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1109689526, now seen corresponding path program 1 times [2018-12-02 01:15:47,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:47,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:47,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:47,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:47,753 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:47,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:47,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:47,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:47,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:47,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:47,834 INFO L87 Difference]: Start difference. First operand 2738 states and 4235 transitions. Second operand 5 states. [2018-12-02 01:15:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:48,422 INFO L93 Difference]: Finished difference Result 5831 states and 8981 transitions. [2018-12-02 01:15:48,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:48,423 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 227 [2018-12-02 01:15:48,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:48,425 INFO L225 Difference]: With dead ends: 5831 [2018-12-02 01:15:48,425 INFO L226 Difference]: Without dead ends: 3120 [2018-12-02 01:15:48,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2018-12-02 01:15:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2734. [2018-12-02 01:15:48,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2734 states. [2018-12-02 01:15:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2734 states to 2734 states and 4231 transitions. [2018-12-02 01:15:48,605 INFO L78 Accepts]: Start accepts. Automaton has 2734 states and 4231 transitions. Word has length 227 [2018-12-02 01:15:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:48,605 INFO L480 AbstractCegarLoop]: Abstraction has 2734 states and 4231 transitions. [2018-12-02 01:15:48,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2734 states and 4231 transitions. [2018-12-02 01:15:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-02 01:15:48,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:48,607 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:48,607 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:48,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:48,607 INFO L82 PathProgramCache]: Analyzing trace with hash 2197547, now seen corresponding path program 1 times [2018-12-02 01:15:48,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:48,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:48,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:48,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2018-12-02 01:15:48,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:48,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:15:48,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:48,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:15:48,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:15:48,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:15:48,665 INFO L87 Difference]: Start difference. First operand 2734 states and 4231 transitions. Second operand 4 states. [2018-12-02 01:15:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:49,074 INFO L93 Difference]: Finished difference Result 5542 states and 8555 transitions. [2018-12-02 01:15:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:49,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 227 [2018-12-02 01:15:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:49,078 INFO L225 Difference]: With dead ends: 5542 [2018-12-02 01:15:49,078 INFO L226 Difference]: Without dead ends: 2827 [2018-12-02 01:15:49,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2827 states. [2018-12-02 01:15:49,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2827 to 2758. [2018-12-02 01:15:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2018-12-02 01:15:49,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 4259 transitions. [2018-12-02 01:15:49,261 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 4259 transitions. Word has length 227 [2018-12-02 01:15:49,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:49,261 INFO L480 AbstractCegarLoop]: Abstraction has 2758 states and 4259 transitions. [2018-12-02 01:15:49,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:15:49,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 4259 transitions. [2018-12-02 01:15:49,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-02 01:15:49,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:49,264 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:15:49,264 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:49,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:49,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1732116894, now seen corresponding path program 1 times [2018-12-02 01:15:49,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:49,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:49,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:49,265 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2018-12-02 01:15:49,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:15:49,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:15:49,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:15:49,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:15:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:15:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:15:49,351 INFO L87 Difference]: Start difference. First operand 2758 states and 4259 transitions. Second operand 5 states. [2018-12-02 01:15:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:15:49,962 INFO L93 Difference]: Finished difference Result 5851 states and 9006 transitions. [2018-12-02 01:15:49,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:15:49,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 228 [2018-12-02 01:15:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:15:49,965 INFO L225 Difference]: With dead ends: 5851 [2018-12-02 01:15:49,965 INFO L226 Difference]: Without dead ends: 3112 [2018-12-02 01:15:49,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:15:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-12-02 01:15:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2739. [2018-12-02 01:15:50,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2739 states. [2018-12-02 01:15:50,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2739 states to 2739 states and 4238 transitions. [2018-12-02 01:15:50,147 INFO L78 Accepts]: Start accepts. Automaton has 2739 states and 4238 transitions. Word has length 228 [2018-12-02 01:15:50,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:15:50,147 INFO L480 AbstractCegarLoop]: Abstraction has 2739 states and 4238 transitions. [2018-12-02 01:15:50,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:15:50,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2739 states and 4238 transitions. [2018-12-02 01:15:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-02 01:15:50,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:15:50,148 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1] [2018-12-02 01:15:50,148 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:15:50,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:15:50,149 INFO L82 PathProgramCache]: Analyzing trace with hash 80855202, now seen corresponding path program 2 times [2018-12-02 01:15:50,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:15:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:50,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:15:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:15:50,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:15:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:15:50,603 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 61 proven. 380 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:15:50,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:50,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:15:50,603 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 01:15:50,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 01:15:50,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:15:50,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:15:50,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:15:50,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 01:15:51,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 01:15:51,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:15:51,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:15:51,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 01:15:51,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:15:51,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 109 treesize of output 80 [2018-12-02 01:15:51,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:15:51,097 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,129 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 01:15:51,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-12-02 01:15:51,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 treesize of output 73 [2018-12-02 01:15:51,199 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:51,297 INFO L478 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 47 treesize of output 67 [2018-12-02 01:15:51,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 01:15:51,313 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:51,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,364 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 103 [2018-12-02 01:15:51,371 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:51,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:15:51,523 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-02 01:15:51,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,528 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-12-02 01:15:51,528 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,541 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,628 INFO L478 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 44 treesize of output 66 [2018-12-02 01:15:51,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,633 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,633 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 68 [2018-12-02 01:15:51,634 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,679 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,681 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 01:15:51,686 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:51,722 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:51,757 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:15:51,793 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:15:51,833 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:51,836 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:51,880 INFO L478 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 165 treesize of output 117 [2018-12-02 01:15:51,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 88 [2018-12-02 01:15:51,884 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 80 [2018-12-02 01:15:51,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:51,905 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:51,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 115 [2018-12-02 01:15:51,908 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,916 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,924 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:51,946 INFO L478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 140 [2018-12-02 01:15:51,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-12-02 01:15:51,949 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,095 INFO L478 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 123 treesize of output 122 [2018-12-02 01:15:52,095 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:52,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 101 [2018-12-02 01:15:52,310 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,311 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 47 [2018-12-02 01:15:52,316 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,328 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 107 [2018-12-02 01:15:52,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-02 01:15:52,336 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,347 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,490 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 132 treesize of output 135 [2018-12-02 01:15:52,495 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 01:15:52,501 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,562 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 148 [2018-12-02 01:15:52,574 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:52,654 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:52,770 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 134 [2018-12-02 01:15:52,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,776 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 128 [2018-12-02 01:15:52,776 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 135 [2018-12-02 01:15:52,840 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:52,885 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:52,954 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:52,962 INFO L478 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 183 treesize of output 131 [2018-12-02 01:15:52,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:52,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 124 [2018-12-02 01:15:52,969 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 112 [2018-12-02 01:15:53,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,009 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,014 INFO L478 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 112 treesize of output 146 [2018-12-02 01:15:53,015 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,034 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,052 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,153 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,163 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,164 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,188 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,188 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,197 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,198 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,208 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:53,317 INFO L478 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 149 treesize of output 107 [2018-12-02 01:15:53,319 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 64 treesize of output 118 [2018-12-02 01:15:53,321 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,334 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 86 [2018-12-02 01:15:53,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,337 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,340 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 167 [2018-12-02 01:15:53,341 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,350 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,357 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,372 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 136 treesize of output 125 [2018-12-02 01:15:53,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 111 [2018-12-02 01:15:53,374 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,437 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 116 [2018-12-02 01:15:53,437 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:53,521 INFO L478 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 111 treesize of output 102 [2018-12-02 01:15:53,524 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2018-12-02 01:15:53,525 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,537 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,655 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 87 [2018-12-02 01:15:53,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-12-02 01:15:53,661 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,678 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,684 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 99 [2018-12-02 01:15:53,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,698 INFO L478 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 1 case distinctions, treesize of input 72 treesize of output 134 [2018-12-02 01:15:53,698 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,718 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,851 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:53,858 INFO L478 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 116 treesize of output 78 [2018-12-02 01:15:53,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 32 treesize of output 70 [2018-12-02 01:15:53,865 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,892 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 54 [2018-12-02 01:15:53,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,899 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:53,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 69 [2018-12-02 01:15:53,905 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,915 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,925 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 81 [2018-12-02 01:15:53,933 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:53,936 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 42 [2018-12-02 01:15:53,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:53,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 01:15:53,943 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,956 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:53,967 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:54,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:15:54,070 INFO L202 ElimStorePlain]: Needed 67 recursive calls to eliminate 6 variables, input treesize:265, output treesize:230 [2018-12-02 01:15:54,227 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-02 01:15:54,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 102 [2018-12-02 01:15:54,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-12-02 01:15:54,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:54,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:54,641 INFO L478 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 97 treesize of output 115 [2018-12-02 01:15:54,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 154 [2018-12-02 01:15:54,655 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:54,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,707 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,708 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,712 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:54,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 168 [2018-12-02 01:15:54,720 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:54,779 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:15:55,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,181 INFO L478 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 3 case distinctions, treesize of input 90 treesize of output 120 [2018-12-02 01:15:55,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 155 [2018-12-02 01:15:55,186 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,217 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,220 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 158 [2018-12-02 01:15:55,222 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:55,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 94 [2018-12-02 01:15:55,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,608 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-12-02 01:15:55,608 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,617 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 85 [2018-12-02 01:15:55,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-02 01:15:55,623 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,632 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-12-02 01:15:55,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-12-02 01:15:55,639 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,647 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 77 [2018-12-02 01:15:55,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 01:15:55,923 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,931 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-12-02 01:15:55,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 01:15:55,937 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,944 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 68 [2018-12-02 01:15:55,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:55,949 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-12-02 01:15:55,950 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:55,956 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,167 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,167 INFO L478 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 114 treesize of output 123 [2018-12-02 01:15:56,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,170 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:56,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 98 [2018-12-02 01:15:56,171 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,184 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 83 [2018-12-02 01:15:56,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 01:15:56,359 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,366 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 78 [2018-12-02 01:15:56,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,371 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 67 [2018-12-02 01:15:56,371 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,376 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 106 [2018-12-02 01:15:56,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-12-02 01:15:56,519 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,531 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 108 [2018-12-02 01:15:56,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 91 [2018-12-02 01:15:56,658 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,669 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,764 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 81 [2018-12-02 01:15:56,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,767 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:15:56,769 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 127 [2018-12-02 01:15:56,772 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,784 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,856 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 81 [2018-12-02 01:15:56,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 57 [2018-12-02 01:15:56,861 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,868 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 85 [2018-12-02 01:15:56,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:56,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-12-02 01:15:56,923 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,932 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:56,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:15:56,962 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 12 variables, input treesize:459, output treesize:307 [2018-12-02 01:15:57,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2018-12-02 01:15:57,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 30 [2018-12-02 01:15:57,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,047 INFO L478 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 55 treesize of output 59 [2018-12-02 01:15:57,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 14 [2018-12-02 01:15:57,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:57,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-02 01:15:57,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 01:15:57,116 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-12-02 01:15:57,140 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:15:57,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 65 treesize of output 49 [2018-12-02 01:15:57,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-12-02 01:15:57,182 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:15:57,188 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,189 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2018-12-02 01:15:57,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,232 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,233 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,235 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 71 [2018-12-02 01:15:57,242 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 01:15:57,256 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:57,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:15:57,273 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:348, output treesize:134 [2018-12-02 01:15:57,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-12-02 01:15:57,328 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 01:15:57,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 53 [2018-12-02 01:15:57,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:15:57,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 44 [2018-12-02 01:15:57,373 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:57,374 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 01:15:57,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,380 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-12-02 01:15:57,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:15:57,391 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:57,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:15:57,398 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:125, output treesize:48 [2018-12-02 01:15:57,401 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:57,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:57,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 292 treesize of output 258 [2018-12-02 01:15:57,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:15:57,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,081 INFO L478 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 40 treesize of output 64 [2018-12-02 01:15:58,087 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,089 INFO L478 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 38 treesize of output 68 [2018-12-02 01:15:58,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,102 INFO L478 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 45 treesize of output 112 [2018-12-02 01:15:58,102 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,140 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 37 treesize of output 39 [2018-12-02 01:15:58,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,189 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:15:58,189 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,216 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,255 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,302 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:15:58,730 INFO L478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 257 treesize of output 233 [2018-12-02 01:15:58,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:58,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 220 treesize of output 236 [2018-12-02 01:15:58,742 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:58,790 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:15:59,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 232 [2018-12-02 01:15:59,377 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:15:59,883 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 225 treesize of output 228 [2018-12-02 01:15:59,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:59,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:59,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:15:59,902 INFO L478 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 210 treesize of output 242 [2018-12-02 01:15:59,902 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,112 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 242 [2018-12-02 01:16:00,121 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,179 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,319 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,661 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 210 [2018-12-02 01:16:00,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,669 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 204 [2018-12-02 01:16:00,669 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,812 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:00,817 INFO L478 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 167 treesize of output 199 [2018-12-02 01:16:00,817 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:00,884 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:01,127 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,164 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,384 INFO L478 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 186 treesize of output 192 [2018-12-02 01:16:01,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 145 [2018-12-02 01:16:01,387 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:01,439 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:01,584 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,614 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,739 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,755 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:01,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 108 [2018-12-02 01:16:01,852 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:01,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 100 [2018-12-02 01:16:01,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:01,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:01,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:01,861 INFO L478 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 92 treesize of output 112 [2018-12-02 01:16:01,861 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:01,873 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:01,884 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:01,984 INFO L478 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 252 treesize of output 218 [2018-12-02 01:16:01,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:01,987 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,025 INFO L478 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 169 treesize of output 166 [2018-12-02 01:16:02,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 156 treesize of output 166 [2018-12-02 01:16:02,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,045 INFO L478 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 158 treesize of output 178 [2018-12-02 01:16:02,046 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,064 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,079 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,103 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,165 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,185 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,247 INFO L478 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 188 treesize of output 182 [2018-12-02 01:16:02,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:16:02,250 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,262 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,305 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 105 [2018-12-02 01:16:02,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:02,307 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,325 INFO L478 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 40 treesize of output 47 [2018-12-02 01:16:02,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12-02 01:16:02,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,331 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:16:02,331 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,337 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,344 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,355 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 95 [2018-12-02 01:16:02,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,391 INFO L478 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 68 treesize of output 78 [2018-12-02 01:16:02,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-12-02 01:16:02,397 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,404 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,413 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:02,434 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 14 variables, input treesize:545, output treesize:127 [2018-12-02 01:16:02,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2018-12-02 01:16:02,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,545 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 71 [2018-12-02 01:16:02,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-12-02 01:16:02,580 INFO L478 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 59 treesize of output 47 [2018-12-02 01:16:02,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,628 INFO L478 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 3 case distinctions, treesize of input 84 treesize of output 108 [2018-12-02 01:16:02,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,632 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 137 [2018-12-02 01:16:02,633 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,671 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 128 [2018-12-02 01:16:02,672 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,703 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:02,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-12-02 01:16:02,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,744 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2018-12-02 01:16:02,744 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,751 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 71 [2018-12-02 01:16:02,755 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-12-02 01:16:02,756 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,764 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 81 treesize of output 100 [2018-12-02 01:16:02,817 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:02,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 105 [2018-12-02 01:16:02,820 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,828 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2018-12-02 01:16:02,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:16:02,853 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,858 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-12-02 01:16:02,879 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:203, output treesize:176 [2018-12-02 01:16:02,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2018-12-02 01:16:02,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 01:16:02,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:02,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-12-02 01:16:02,960 INFO L478 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 41 treesize of output 29 [2018-12-02 01:16:02,960 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:02,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-02 01:16:02,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:112, output treesize:85 [2018-12-02 01:16:03,279 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 354 proven. 87 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:16:03,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:16:03,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2018-12-02 01:16:03,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,483 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,531 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,535 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,549 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 131 treesize of output 99 [2018-12-02 01:16:03,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:03,583 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,608 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 129 [2018-12-02 01:16:03,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:16:03,612 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:16:03,621 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,624 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,629 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:03,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 97 [2018-12-02 01:16:03,632 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,633 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,633 INFO L478 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 39 treesize of output 68 [2018-12-02 01:16:03,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,650 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,651 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:03,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 57 [2018-12-02 01:16:03,651 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,661 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,672 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,685 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:03,702 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,708 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,708 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,710 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:03,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-12-02 01:16:03,720 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:322, output treesize:206 [2018-12-02 01:16:03,765 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,791 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:192, output treesize:262 [2018-12-02 01:16:03,913 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:03,950 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:214, output treesize:284 [2018-12-02 01:16:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 325 proven. 116 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2018-12-02 01:16:04,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:16:04,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 33 [2018-12-02 01:16:04,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:16:04,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 01:16:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 01:16:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=884, Unknown=0, NotChecked=0, Total=1056 [2018-12-02 01:16:04,150 INFO L87 Difference]: Start difference. First operand 2739 states and 4238 transitions. Second operand 22 states. [2018-12-02 01:16:14,090 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2018-12-02 01:16:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:16,453 INFO L93 Difference]: Finished difference Result 15745 states and 23767 transitions. [2018-12-02 01:16:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-02 01:16:16,453 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 238 [2018-12-02 01:16:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:16,461 INFO L225 Difference]: With dead ends: 15745 [2018-12-02 01:16:16,461 INFO L226 Difference]: Without dead ends: 13033 [2018-12-02 01:16:16,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 472 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=696, Invalid=2844, Unknown=0, NotChecked=0, Total=3540 [2018-12-02 01:16:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13033 states. [2018-12-02 01:16:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13033 to 6497. [2018-12-02 01:16:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6497 states. [2018-12-02 01:16:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 10382 transitions. [2018-12-02 01:16:16,935 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 10382 transitions. Word has length 238 [2018-12-02 01:16:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:16,935 INFO L480 AbstractCegarLoop]: Abstraction has 6497 states and 10382 transitions. [2018-12-02 01:16:16,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 01:16:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 10382 transitions. [2018-12-02 01:16:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-12-02 01:16:16,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:16,937 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:16,937 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:16,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:16,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1073765906, now seen corresponding path program 1 times [2018-12-02 01:16:16,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:16,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:16:16,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:16,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-12-02 01:16:16,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:16,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:16,984 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:16,984 INFO L87 Difference]: Start difference. First operand 6497 states and 10382 transitions. Second operand 4 states. [2018-12-02 01:16:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:17,654 INFO L93 Difference]: Finished difference Result 13024 states and 20806 transitions. [2018-12-02 01:16:17,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:17,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2018-12-02 01:16:17,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:17,659 INFO L225 Difference]: With dead ends: 13024 [2018-12-02 01:16:17,660 INFO L226 Difference]: Without dead ends: 6554 [2018-12-02 01:16:17,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6554 states. [2018-12-02 01:16:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6554 to 6497. [2018-12-02 01:16:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6497 states. [2018-12-02 01:16:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6497 states to 6497 states and 10379 transitions. [2018-12-02 01:16:18,117 INFO L78 Accepts]: Start accepts. Automaton has 6497 states and 10379 transitions. Word has length 241 [2018-12-02 01:16:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:18,117 INFO L480 AbstractCegarLoop]: Abstraction has 6497 states and 10379 transitions. [2018-12-02 01:16:18,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6497 states and 10379 transitions. [2018-12-02 01:16:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-02 01:16:18,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:18,119 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:18,120 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:18,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1007892626, now seen corresponding path program 1 times [2018-12-02 01:16:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:18,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2018-12-02 01:16:18,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:18,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:16:18,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:18,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:16:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:16:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:18,200 INFO L87 Difference]: Start difference. First operand 6497 states and 10379 transitions. Second operand 5 states. [2018-12-02 01:16:19,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:19,215 INFO L93 Difference]: Finished difference Result 14111 states and 22495 transitions. [2018-12-02 01:16:19,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:19,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 248 [2018-12-02 01:16:19,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:19,221 INFO L225 Difference]: With dead ends: 14111 [2018-12-02 01:16:19,221 INFO L226 Difference]: Without dead ends: 7641 [2018-12-02 01:16:19,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:16:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7641 states. [2018-12-02 01:16:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7641 to 6917. [2018-12-02 01:16:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6917 states. [2018-12-02 01:16:19,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 11075 transitions. [2018-12-02 01:16:19,690 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 11075 transitions. Word has length 248 [2018-12-02 01:16:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:19,690 INFO L480 AbstractCegarLoop]: Abstraction has 6917 states and 11075 transitions. [2018-12-02 01:16:19,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:16:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 11075 transitions. [2018-12-02 01:16:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-02 01:16:19,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:19,693 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:19,693 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:19,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 570249190, now seen corresponding path program 1 times [2018-12-02 01:16:19,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:19,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:19,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:19,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:19,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 326 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 01:16:19,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:19,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:19,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:19,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:19,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:19,779 INFO L87 Difference]: Start difference. First operand 6917 states and 11075 transitions. Second operand 4 states. [2018-12-02 01:16:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:20,662 INFO L93 Difference]: Finished difference Result 14281 states and 22818 transitions. [2018-12-02 01:16:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:20,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 249 [2018-12-02 01:16:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:20,667 INFO L225 Difference]: With dead ends: 14281 [2018-12-02 01:16:20,667 INFO L226 Difference]: Without dead ends: 7391 [2018-12-02 01:16:20,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2018-12-02 01:16:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 6917. [2018-12-02 01:16:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6917 states. [2018-12-02 01:16:21,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 11067 transitions. [2018-12-02 01:16:21,142 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 11067 transitions. Word has length 249 [2018-12-02 01:16:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:21,142 INFO L480 AbstractCegarLoop]: Abstraction has 6917 states and 11067 transitions. [2018-12-02 01:16:21,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 11067 transitions. [2018-12-02 01:16:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-02 01:16:21,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:21,144 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:21,144 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:21,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1873511161, now seen corresponding path program 1 times [2018-12-02 01:16:21,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:21,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:21,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:21,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:21,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 01:16:21,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:21,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:21,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:21,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:21,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:21,227 INFO L87 Difference]: Start difference. First operand 6917 states and 11067 transitions. Second operand 4 states. [2018-12-02 01:16:22,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:22,158 INFO L93 Difference]: Finished difference Result 14281 states and 22802 transitions. [2018-12-02 01:16:22,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:22,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 250 [2018-12-02 01:16:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:22,164 INFO L225 Difference]: With dead ends: 14281 [2018-12-02 01:16:22,164 INFO L226 Difference]: Without dead ends: 7391 [2018-12-02 01:16:22,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:22,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2018-12-02 01:16:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 6917. [2018-12-02 01:16:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6917 states. [2018-12-02 01:16:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 11059 transitions. [2018-12-02 01:16:22,649 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 11059 transitions. Word has length 250 [2018-12-02 01:16:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:22,649 INFO L480 AbstractCegarLoop]: Abstraction has 6917 states and 11059 transitions. [2018-12-02 01:16:22,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:22,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 11059 transitions. [2018-12-02 01:16:22,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-12-02 01:16:22,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:22,651 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:22,651 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:22,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:22,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2112775967, now seen corresponding path program 1 times [2018-12-02 01:16:22,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:22,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:22,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 342 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2018-12-02 01:16:22,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:22,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:22,739 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:22,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:22,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:22,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:22,739 INFO L87 Difference]: Start difference. First operand 6917 states and 11059 transitions. Second operand 4 states. [2018-12-02 01:16:23,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:23,664 INFO L93 Difference]: Finished difference Result 14281 states and 22786 transitions. [2018-12-02 01:16:23,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:23,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 251 [2018-12-02 01:16:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:23,670 INFO L225 Difference]: With dead ends: 14281 [2018-12-02 01:16:23,670 INFO L226 Difference]: Without dead ends: 7391 [2018-12-02 01:16:23,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:23,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7391 states. [2018-12-02 01:16:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7391 to 6917. [2018-12-02 01:16:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6917 states. [2018-12-02 01:16:24,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6917 states to 6917 states and 11027 transitions. [2018-12-02 01:16:24,162 INFO L78 Accepts]: Start accepts. Automaton has 6917 states and 11027 transitions. Word has length 251 [2018-12-02 01:16:24,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:24,163 INFO L480 AbstractCegarLoop]: Abstraction has 6917 states and 11027 transitions. [2018-12-02 01:16:24,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:24,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6917 states and 11027 transitions. [2018-12-02 01:16:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 01:16:24,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:24,165 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:24,165 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:24,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:24,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1723606676, now seen corresponding path program 1 times [2018-12-02 01:16:24,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:24,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:24,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 365 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-12-02 01:16:24,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:24,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:16:24,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:24,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:16:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:16:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:24,250 INFO L87 Difference]: Start difference. First operand 6917 states and 11027 transitions. Second operand 5 states. [2018-12-02 01:16:25,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:25,263 INFO L93 Difference]: Finished difference Result 14487 states and 22999 transitions. [2018-12-02 01:16:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:25,263 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 252 [2018-12-02 01:16:25,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:25,269 INFO L225 Difference]: With dead ends: 14487 [2018-12-02 01:16:25,269 INFO L226 Difference]: Without dead ends: 7597 [2018-12-02 01:16:25,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:16:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2018-12-02 01:16:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 6885. [2018-12-02 01:16:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6885 states. [2018-12-02 01:16:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6885 states to 6885 states and 10959 transitions. [2018-12-02 01:16:25,765 INFO L78 Accepts]: Start accepts. Automaton has 6885 states and 10959 transitions. Word has length 252 [2018-12-02 01:16:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:25,765 INFO L480 AbstractCegarLoop]: Abstraction has 6885 states and 10959 transitions. [2018-12-02 01:16:25,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:16:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6885 states and 10959 transitions. [2018-12-02 01:16:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-02 01:16:25,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:25,767 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:25,767 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:25,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:25,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1011367895, now seen corresponding path program 1 times [2018-12-02 01:16:25,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:25,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:25,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:25,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 01:16:26,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:26,262 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:16:26,262 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 253 with the following transitions: [2018-12-02 01:16:26,262 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [47], [49], [54], [59], [64], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [222], [224], [227], [231], [235], [250], [256], [266], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:16:26,264 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:16:26,264 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:16:26,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:16:26,609 INFO L272 AbstractInterpreter]: Visited 96 different actions 407 times. Merged at 78 different actions 282 times. Never widened. Performed 3385 root evaluator evaluations with a maximum evaluation depth of 5. Performed 3385 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 36 fixpoints after 17 different actions. Largest state had 148 variables. [2018-12-02 01:16:26,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:26,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:16:26,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:26,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:16:26,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:26,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:16:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:26,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:16:26,719 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,720 INFO L478 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 31 treesize of output 40 [2018-12-02 01:16:26,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 01:16:26,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,747 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 01:16:26,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-02 01:16:26,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 01:16:26,778 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 01:16:26,782 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,783 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,784 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 01:16:26,785 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,791 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,794 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,797 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,805 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-12-02 01:16:26,805 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 01:16:26,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:26,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:26,847 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:26,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:26,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 01:16:26,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,867 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 01:16:26,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,876 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 01:16:26,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,886 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,888 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 01:16:26,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,916 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,934 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,942 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 01:16:26,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:26,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,960 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:26,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:26,981 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:26,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:26,987 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,988 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:26,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:26,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:27,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:16:27,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:16:27,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:16:27,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,084 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:27,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:27,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:27,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:27,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:27,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,118 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:27,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:27,145 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:16:27,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,165 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:16:27,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,175 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:16:27,181 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,197 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,211 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:27,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:16:27,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:16:27,215 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:16:27,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:16:27,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:16:27,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:27,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:27,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:27,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:27,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,297 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:27,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:16:27,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:16:27,302 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:16:27,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:16:27,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,323 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,330 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:16:27,332 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:27,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 407 treesize of output 337 [2018-12-02 01:16:27,516 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 369 [2018-12-02 01:16:27,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 321 treesize of output 290 [2018-12-02 01:16:27,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:27,621 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 250 [2018-12-02 01:16:27,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,678 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,682 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,684 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 347 [2018-12-02 01:16:27,705 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,750 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,780 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,810 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 181 [2018-12-02 01:16:27,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:16:27,857 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,866 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 109 treesize of output 80 [2018-12-02 01:16:27,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:27,898 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 55 [2018-12-02 01:16:27,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:27,910 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 49 [2018-12-02 01:16:27,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,925 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:16:27,925 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,932 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,937 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,942 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 55 [2018-12-02 01:16:27,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:27,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 01:16:27,965 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,971 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:27,985 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:343, output treesize:118 [2018-12-02 01:16:28,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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-12-02 01:16:28,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12-02 01:16:28,011 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 82 [2018-12-02 01:16:28,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-12-02 01:16:28,035 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,044 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 93 [2018-12-02 01:16:28,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 73 [2018-12-02 01:16:28,057 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,063 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,067 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:149, output treesize:38 [2018-12-02 01:16:28,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 37 [2018-12-02 01:16:28,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-12-02 01:16:28,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,091 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,091 INFO L478 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 22 treesize of output 16 [2018-12-02 01:16:28,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,095 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,095 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:47, output treesize:3 [2018-12-02 01:16:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 01:16:28,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:16:28,321 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,369 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,392 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,431 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,435 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 273 [2018-12-02 01:16:28,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:28,440 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 245 [2018-12-02 01:16:28,440 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,446 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 198 treesize of output 170 [2018-12-02 01:16:28,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:28,455 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,465 INFO L478 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 169 treesize of output 140 [2018-12-02 01:16:28,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,477 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,478 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-12-02 01:16:28,478 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 193 treesize of output 179 [2018-12-02 01:16:28,492 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,492 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,493 INFO L478 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-12-02 01:16:28,493 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2018-12-02 01:16:28,499 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,500 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 134 [2018-12-02 01:16:28,510 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,510 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 60 [2018-12-02 01:16:28,512 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 110 [2018-12-02 01:16:28,531 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,544 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,544 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:28,545 INFO L478 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 110 treesize of output 101 [2018-12-02 01:16:28,545 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,558 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:28,565 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:28,571 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:28,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 47 [2018-12-02 01:16:28,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-02 01:16:28,584 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,584 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:28,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,585 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 7 variables, input treesize:289, output treesize:15 [2018-12-02 01:16:28,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-12-02 01:16:28,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 46 treesize of output 38 [2018-12-02 01:16:28,591 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,597 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,598 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 01:16:28,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,610 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 01:16:28,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2018-12-02 01:16:28,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 36 treesize of output 32 [2018-12-02 01:16:28,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,624 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:32 [2018-12-02 01:16:28,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,635 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,638 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 01:16:28,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:16:28,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:16:28,654 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2018-12-02 01:16:28,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:16:28,670 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-02 01:16:28,676 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,691 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:28,693 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:71, output treesize:25 [2018-12-02 01:16:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 319 proven. 124 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 01:16:28,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:16:28,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-02 01:16:28,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:16:28,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:16:28,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:16:28,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2018-12-02 01:16:28,770 INFO L87 Difference]: Start difference. First operand 6885 states and 10959 transitions. Second operand 13 states. [2018-12-02 01:16:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:32,047 INFO L93 Difference]: Finished difference Result 18288 states and 28656 transitions. [2018-12-02 01:16:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:16:32,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 252 [2018-12-02 01:16:32,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:32,056 INFO L225 Difference]: With dead ends: 18288 [2018-12-02 01:16:32,056 INFO L226 Difference]: Without dead ends: 11430 [2018-12-02 01:16:32,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 487 SyntacticMatches, 23 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2018-12-02 01:16:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11430 states. [2018-12-02 01:16:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11430 to 6885. [2018-12-02 01:16:32,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6885 states. [2018-12-02 01:16:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6885 states to 6885 states and 10939 transitions. [2018-12-02 01:16:32,571 INFO L78 Accepts]: Start accepts. Automaton has 6885 states and 10939 transitions. Word has length 252 [2018-12-02 01:16:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:32,571 INFO L480 AbstractCegarLoop]: Abstraction has 6885 states and 10939 transitions. [2018-12-02 01:16:32,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:16:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 6885 states and 10939 transitions. [2018-12-02 01:16:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-02 01:16:32,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:32,574 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:32,574 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:32,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:32,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1803952293, now seen corresponding path program 1 times [2018-12-02 01:16:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:32,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:32,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:32,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 01:16:32,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:32,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:32,642 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:32,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:32,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:32,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:32,642 INFO L87 Difference]: Start difference. First operand 6885 states and 10939 transitions. Second operand 4 states. [2018-12-02 01:16:33,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:33,324 INFO L93 Difference]: Finished difference Result 13800 states and 21920 transitions. [2018-12-02 01:16:33,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:33,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 258 [2018-12-02 01:16:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:33,329 INFO L225 Difference]: With dead ends: 13800 [2018-12-02 01:16:33,329 INFO L226 Difference]: Without dead ends: 6942 [2018-12-02 01:16:33,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6942 states. [2018-12-02 01:16:33,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6942 to 6885. [2018-12-02 01:16:33,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6885 states. [2018-12-02 01:16:33,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6885 states to 6885 states and 10936 transitions. [2018-12-02 01:16:33,828 INFO L78 Accepts]: Start accepts. Automaton has 6885 states and 10936 transitions. Word has length 258 [2018-12-02 01:16:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:33,828 INFO L480 AbstractCegarLoop]: Abstraction has 6885 states and 10936 transitions. [2018-12-02 01:16:33,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 6885 states and 10936 transitions. [2018-12-02 01:16:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-12-02 01:16:33,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:33,830 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:33,830 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:33,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1562726042, now seen corresponding path program 1 times [2018-12-02 01:16:33,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:33,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:33,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:33,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:33,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-12-02 01:16:33,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:33,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:33,878 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:33,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:33,878 INFO L87 Difference]: Start difference. First operand 6885 states and 10936 transitions. Second operand 4 states. [2018-12-02 01:16:34,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:34,584 INFO L93 Difference]: Finished difference Result 13794 states and 21905 transitions. [2018-12-02 01:16:34,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:34,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 259 [2018-12-02 01:16:34,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:34,590 INFO L225 Difference]: With dead ends: 13794 [2018-12-02 01:16:34,591 INFO L226 Difference]: Without dead ends: 6936 [2018-12-02 01:16:34,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2018-12-02 01:16:35,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 6885. [2018-12-02 01:16:35,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6885 states. [2018-12-02 01:16:35,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6885 states to 6885 states and 10933 transitions. [2018-12-02 01:16:35,088 INFO L78 Accepts]: Start accepts. Automaton has 6885 states and 10933 transitions. Word has length 259 [2018-12-02 01:16:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:35,088 INFO L480 AbstractCegarLoop]: Abstraction has 6885 states and 10933 transitions. [2018-12-02 01:16:35,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 6885 states and 10933 transitions. [2018-12-02 01:16:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-12-02 01:16:35,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:35,091 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:35,091 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -971330935, now seen corresponding path program 1 times [2018-12-02 01:16:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:35,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:35,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:35,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 354 proven. 138 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-12-02 01:16:35,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:35,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:16:35,362 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 266 with the following transitions: [2018-12-02 01:16:35,363 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [69], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [149], [154], [157], [159], [164], [167], [169], [174], [177], [179], [184], [187], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [440], [445], [450], [455], [458], [463], [465], [470], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:16:35,364 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:16:35,364 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:16:35,534 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:16:35,534 INFO L272 AbstractInterpreter]: Visited 92 different actions 246 times. Merged at 73 different actions 140 times. Never widened. Performed 1871 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1871 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 21 fixpoints after 10 different actions. Largest state had 139 variables. [2018-12-02 01:16:35,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:35,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:16:35,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:35,536 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:16:35,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:35,545 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:16:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:35,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:16:35,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,640 INFO L478 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 31 treesize of output 40 [2018-12-02 01:16:35,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-12-02 01:16:35,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,670 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2018-12-02 01:16:35,671 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,677 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-12-02 01:16:35,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-12-02 01:16:35,697 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 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-12-02 01:16:35,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-12-02 01:16:35,701 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,707 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,710 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,721 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-12-02 01:16:35,721 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:57, output treesize:79 [2018-12-02 01:16:35,748 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:35,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:35,765 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:35,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:35,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 87 [2018-12-02 01:16:35,785 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,786 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 137 [2018-12-02 01:16:35,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,796 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 171 [2018-12-02 01:16:35,806 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,808 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 168 [2018-12-02 01:16:35,820 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,837 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,849 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,856 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,862 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:79 [2018-12-02 01:16:35,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:35,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:35,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:35,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:35,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:35,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:35,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:35,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:35,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:35,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:35,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:35,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:35,994 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:35,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:36,000 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,001 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:36,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:36,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:36,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,026 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:36,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:79 [2018-12-02 01:16:36,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:36,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:36,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 77 [2018-12-02 01:16:36,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 127 [2018-12-02 01:16:36,088 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:36,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:16:36,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:16:36,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:16:36,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:16:36,123 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,129 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,141 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:16:36,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 82 [2018-12-02 01:16:36,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,167 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 132 [2018-12-02 01:16:36,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 168 [2018-12-02 01:16:36,179 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,201 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,208 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:117, output treesize:79 [2018-12-02 01:16:36,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 45 [2018-12-02 01:16:36,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 45 treesize of output 37 [2018-12-02 01:16:36,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 110 [2018-12-02 01:16:36,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 1 [2018-12-02 01:16:36,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,237 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:128, output treesize:79 [2018-12-02 01:16:36,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 109 treesize of output 80 [2018-12-02 01:16:36,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:36,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,265 INFO L478 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 79 treesize of output 55 [2018-12-02 01:16:36,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:36,267 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,279 INFO L478 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 44 treesize of output 49 [2018-12-02 01:16:36,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,283 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:16:36,283 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,319 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,321 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2018-12-02 01:16:36,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-12-02 01:16:36,341 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,346 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,351 INFO L478 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 15 treesize of output 13 [2018-12-02 01:16:36,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 9 [2018-12-02 01:16:36,352 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,353 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,358 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:207, output treesize:32 [2018-12-02 01:16:36,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 37 treesize of output 33 [2018-12-02 01:16:36,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,380 INFO L478 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 22 treesize of output 16 [2018-12-02 01:16:36,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 01:16:36,386 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,390 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-12-02 01:16:36,555 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-02 01:16:36,555 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:16:36,577 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,578 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 73 treesize of output 65 [2018-12-02 01:16:36,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:16:36,583 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,591 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:16:36,592 INFO L478 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 64 treesize of output 80 [2018-12-02 01:16:36,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:36,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-12-02 01:16:36,595 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 14 [2018-12-02 01:16:36,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:16:36,603 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,607 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-12-02 01:16:36,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:16:36,615 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,616 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:36,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,617 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:84, output treesize:15 [2018-12-02 01:16:36,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 01:16:36,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 41 treesize of output 37 [2018-12-02 01:16:36,637 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,638 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,640 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 01:16:36,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,678 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,680 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:15 [2018-12-02 01:16:36,694 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-12-02 01:16:36,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 41 treesize of output 37 [2018-12-02 01:16:36,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,702 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:37 [2018-12-02 01:16:36,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,736 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,737 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 01:16:36,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:16:36,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:16:36,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,799 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:56, output treesize:20 [2018-12-02 01:16:36,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:16:36,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,831 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,832 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:15 [2018-12-02 01:16:36,843 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,851 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,860 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,861 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:36,862 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:76, output treesize:25 [2018-12-02 01:16:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 357 proven. 91 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2018-12-02 01:16:37,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:16:37,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2018-12-02 01:16:37,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:16:37,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 01:16:37,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 01:16:37,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-12-02 01:16:37,007 INFO L87 Difference]: Start difference. First operand 6885 states and 10933 transitions. Second operand 13 states. [2018-12-02 01:16:39,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:39,508 INFO L93 Difference]: Finished difference Result 14538 states and 22982 transitions. [2018-12-02 01:16:39,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 01:16:39,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 265 [2018-12-02 01:16:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:39,515 INFO L225 Difference]: With dead ends: 14538 [2018-12-02 01:16:39,515 INFO L226 Difference]: Without dead ends: 7680 [2018-12-02 01:16:39,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 512 SyntacticMatches, 20 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2018-12-02 01:16:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7680 states. [2018-12-02 01:16:40,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7680 to 6625. [2018-12-02 01:16:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-12-02 01:16:40,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10510 transitions. [2018-12-02 01:16:40,042 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10510 transitions. Word has length 265 [2018-12-02 01:16:40,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:40,042 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 10510 transitions. [2018-12-02 01:16:40,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 01:16:40,042 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10510 transitions. [2018-12-02 01:16:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-02 01:16:40,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:40,044 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:40,044 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:40,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:40,044 INFO L82 PathProgramCache]: Analyzing trace with hash -426046733, now seen corresponding path program 1 times [2018-12-02 01:16:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:40,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:40,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:40,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:40,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 01:16:40,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:40,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:40,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:40,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:40,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:40,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:40,099 INFO L87 Difference]: Start difference. First operand 6625 states and 10510 transitions. Second operand 4 states. [2018-12-02 01:16:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:40,799 INFO L93 Difference]: Finished difference Result 13274 states and 21053 transitions. [2018-12-02 01:16:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:40,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 280 [2018-12-02 01:16:40,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:40,806 INFO L225 Difference]: With dead ends: 13274 [2018-12-02 01:16:40,806 INFO L226 Difference]: Without dead ends: 6676 [2018-12-02 01:16:40,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-02 01:16:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 6625. [2018-12-02 01:16:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-12-02 01:16:41,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10507 transitions. [2018-12-02 01:16:41,332 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10507 transitions. Word has length 280 [2018-12-02 01:16:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:41,332 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 10507 transitions. [2018-12-02 01:16:41,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:41,332 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10507 transitions. [2018-12-02 01:16:41,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-12-02 01:16:41,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:41,335 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:41,336 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:41,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:41,336 INFO L82 PathProgramCache]: Analyzing trace with hash -805126766, now seen corresponding path program 1 times [2018-12-02 01:16:41,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:41,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:41,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:41,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:41,337 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:41,394 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2018-12-02 01:16:41,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:41,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:41,395 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:41,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:41,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:41,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:41,395 INFO L87 Difference]: Start difference. First operand 6625 states and 10507 transitions. Second operand 4 states. [2018-12-02 01:16:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:42,052 INFO L93 Difference]: Finished difference Result 13262 states and 21032 transitions. [2018-12-02 01:16:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:42,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 281 [2018-12-02 01:16:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:42,057 INFO L225 Difference]: With dead ends: 13262 [2018-12-02 01:16:42,058 INFO L226 Difference]: Without dead ends: 6664 [2018-12-02 01:16:42,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6664 states. [2018-12-02 01:16:42,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6664 to 6625. [2018-12-02 01:16:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-12-02 01:16:42,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10504 transitions. [2018-12-02 01:16:42,562 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10504 transitions. Word has length 281 [2018-12-02 01:16:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:42,562 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 10504 transitions. [2018-12-02 01:16:42,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10504 transitions. [2018-12-02 01:16:42,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 01:16:42,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:42,564 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:42,564 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:42,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:42,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1029589901, now seen corresponding path program 1 times [2018-12-02 01:16:42,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:42,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:42,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:42,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 781 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2018-12-02 01:16:42,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:42,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 01:16:42,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:42,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 01:16:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 01:16:42,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:42,679 INFO L87 Difference]: Start difference. First operand 6625 states and 10504 transitions. Second operand 5 states. [2018-12-02 01:16:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:43,776 INFO L93 Difference]: Finished difference Result 13895 states and 21901 transitions. [2018-12-02 01:16:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:43,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 283 [2018-12-02 01:16:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:43,782 INFO L225 Difference]: With dead ends: 13895 [2018-12-02 01:16:43,782 INFO L226 Difference]: Without dead ends: 7297 [2018-12-02 01:16:43,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 01:16:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7297 states. [2018-12-02 01:16:44,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7297 to 6625. [2018-12-02 01:16:44,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6625 states. [2018-12-02 01:16:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6625 states to 6625 states and 10456 transitions. [2018-12-02 01:16:44,294 INFO L78 Accepts]: Start accepts. Automaton has 6625 states and 10456 transitions. Word has length 283 [2018-12-02 01:16:44,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:44,294 INFO L480 AbstractCegarLoop]: Abstraction has 6625 states and 10456 transitions. [2018-12-02 01:16:44,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 01:16:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6625 states and 10456 transitions. [2018-12-02 01:16:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-02 01:16:44,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:44,296 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:44,296 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:44,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash 136627828, now seen corresponding path program 1 times [2018-12-02 01:16:44,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:44,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:44,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:44,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:44,380 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 548 proven. 15 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-12-02 01:16:44,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:44,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:16:44,380 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 284 with the following transitions: [2018-12-02 01:16:44,380 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [67], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [142], [144], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:16:44,382 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:16:44,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:16:44,650 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:16:44,651 INFO L272 AbstractInterpreter]: Visited 99 different actions 339 times. Merged at 80 different actions 215 times. Never widened. Performed 2711 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2711 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 18 different actions. Largest state had 151 variables. [2018-12-02 01:16:44,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:44,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:16:44,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:44,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:16:44,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:44,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:16:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:44,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:16:44,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-02 01:16:44,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 67 treesize of output 59 [2018-12-02 01:16:44,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-02 01:16:44,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-12-02 01:16:44,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 01:16:44,781 INFO L478 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 78 treesize of output 66 [2018-12-02 01:16:44,781 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,785 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 01:16:44,812 INFO L478 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 62 treesize of output 46 [2018-12-02 01:16:44,812 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-12-02 01:16:44,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 13 [2018-12-02 01:16:44,818 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,819 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2018-12-02 01:16:44,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 53 treesize of output 41 [2018-12-02 01:16:44,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,826 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:44,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-02 01:16:44,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:44,848 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,849 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,864 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 53 [2018-12-02 01:16:44,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-12-02 01:16:44,866 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 48 [2018-12-02 01:16:44,896 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 77 [2018-12-02 01:16:44,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2018-12-02 01:16:44,940 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:44,960 INFO L478 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 33 treesize of output 44 [2018-12-02 01:16:44,960 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:44,969 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:45,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,010 INFO L478 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 3 case distinctions, treesize of input 37 treesize of output 61 [2018-12-02 01:16:45,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 50 treesize of output 37 [2018-12-02 01:16:45,013 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,027 INFO L478 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 33 treesize of output 44 [2018-12-02 01:16:45,028 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,033 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,039 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,042 INFO L478 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 46 treesize of output 36 [2018-12-02 01:16:45,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:45,044 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 44 [2018-12-02 01:16:45,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:45,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 31 treesize of output 18 [2018-12-02 01:16:45,052 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,054 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,056 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:45,063 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 01:16:45,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:16:45,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:16:45,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:45,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 01:16:45,115 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 01:16:45,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:16:45,167 INFO L134 CoverageAnalysis]: Checked inductivity of 869 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 01:16:45,182 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:16:45,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 01:16:45,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:45,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:16:45,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:16:45,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:16:45,182 INFO L87 Difference]: Start difference. First operand 6625 states and 10456 transitions. Second operand 6 states. [2018-12-02 01:16:46,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:46,266 INFO L93 Difference]: Finished difference Result 13562 states and 21368 transitions. [2018-12-02 01:16:46,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:16:46,266 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 283 [2018-12-02 01:16:46,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:46,273 INFO L225 Difference]: With dead ends: 13562 [2018-12-02 01:16:46,273 INFO L226 Difference]: Without dead ends: 6964 [2018-12-02 01:16:46,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 561 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 01:16:46,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6964 states. [2018-12-02 01:16:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6964 to 6745. [2018-12-02 01:16:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6745 states. [2018-12-02 01:16:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6745 states to 6745 states and 10660 transitions. [2018-12-02 01:16:46,785 INFO L78 Accepts]: Start accepts. Automaton has 6745 states and 10660 transitions. Word has length 283 [2018-12-02 01:16:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:46,785 INFO L480 AbstractCegarLoop]: Abstraction has 6745 states and 10660 transitions. [2018-12-02 01:16:46,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:16:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 6745 states and 10660 transitions. [2018-12-02 01:16:46,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 01:16:46,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:46,789 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:46,789 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -929531809, now seen corresponding path program 1 times [2018-12-02 01:16:46,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:46,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:46,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:46,885 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 548 proven. 16 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2018-12-02 01:16:46,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:46,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:16:46,886 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 285 with the following transitions: [2018-12-02 01:16:46,886 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [16], [27], [29], [33], [42], [44], [49], [54], [59], [64], [67], [69], [72], [74], [79], [84], [87], [89], [94], [99], [102], [104], [109], [112], [114], [119], [122], [124], [129], [132], [134], [139], [144], [147], [149], [152], [154], [159], [164], [169], [174], [179], [184], [187], [224], [227], [231], [235], [250], [256], [259], [264], [269], [274], [278], [281], [289], [291], [294], [302], [307], [309], [311], [314], [323], [325], [328], [332], [335], [364], [369], [379], [381], [384], [395], [397], [407], [409], [414], [420], [425], [436], [438], [472], [477], [482], [579], [613], [615], [627], [630], [631], [632], [634] [2018-12-02 01:16:46,887 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 01:16:46,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 01:16:47,128 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 01:16:47,128 INFO L272 AbstractInterpreter]: Visited 99 different actions 336 times. Merged at 79 different actions 212 times. Never widened. Performed 2691 root evaluator evaluations with a maximum evaluation depth of 5. Performed 2691 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 33 fixpoints after 17 different actions. Largest state had 151 variables. [2018-12-02 01:16:47,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:47,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 01:16:47,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:47,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:16:47,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:47,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 01:16:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:47,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:16:47,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2018-12-02 01:16:47,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-12-02 01:16:47,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,254 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 78 [2018-12-02 01:16:47,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 67 treesize of output 59 [2018-12-02 01:16:47,258 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:47,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:47,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 78 [2018-12-02 01:16:47,266 INFO L478 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 78 treesize of output 66 [2018-12-02 01:16:47,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:47,272 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:16:47,310 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 83 [2018-12-02 01:16:47,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2018-12-02 01:16:47,312 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 66 [2018-12-02 01:16:47,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 65 treesize of output 62 [2018-12-02 01:16:47,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 37 treesize of output 24 [2018-12-02 01:16:47,375 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,379 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,414 INFO L478 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 3 case distinctions, treesize of input 51 treesize of output 82 [2018-12-02 01:16:47,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2018-12-02 01:16:47,416 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,436 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,438 INFO L478 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 47 treesize of output 56 [2018-12-02 01:16:47,439 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,447 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:47,465 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,469 INFO L478 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 70 treesize of output 60 [2018-12-02 01:16:47,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:47,470 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 49 treesize of output 56 [2018-12-02 01:16:47,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 37 treesize of output 24 [2018-12-02 01:16:47,480 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,483 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,485 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 55 treesize of output 45 [2018-12-02 01:16:47,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:16:47,489 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:16:47,494 INFO L478 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 35 treesize of output 41 [2018-12-02 01:16:47,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 15 [2018-12-02 01:16:47,496 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,498 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,501 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 18 [2018-12-02 01:16:47,513 INFO L478 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-12-02 01:16:47,513 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,514 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 21 [2018-12-02 01:16:47,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:16:47,518 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,520 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:16:47,524 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 3 variables, input treesize:81, output treesize:19 [2018-12-02 01:16:47,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-02 01:16:47,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-12-02 01:16:47,549 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:16:47,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2018-12-02 01:16:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 01:16:47,581 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:16:47,661 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 555 proven. 0 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2018-12-02 01:16:47,676 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 01:16:47,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [6] total 13 [2018-12-02 01:16:47,676 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:47,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 01:16:47,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 01:16:47,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 01:16:47,677 INFO L87 Difference]: Start difference. First operand 6745 states and 10660 transitions. Second operand 6 states. [2018-12-02 01:16:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:48,570 INFO L93 Difference]: Finished difference Result 13674 states and 21560 transitions. [2018-12-02 01:16:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 01:16:48,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 284 [2018-12-02 01:16:48,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:48,575 INFO L225 Difference]: With dead ends: 13674 [2018-12-02 01:16:48,576 INFO L226 Difference]: Without dead ends: 6956 [2018-12-02 01:16:48,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 563 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-02 01:16:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6956 states. [2018-12-02 01:16:49,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6956 to 6749. [2018-12-02 01:16:49,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6749 states. [2018-12-02 01:16:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 10664 transitions. [2018-12-02 01:16:49,087 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 10664 transitions. Word has length 284 [2018-12-02 01:16:49,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:49,087 INFO L480 AbstractCegarLoop]: Abstraction has 6749 states and 10664 transitions. [2018-12-02 01:16:49,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 01:16:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 10664 transitions. [2018-12-02 01:16:49,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-02 01:16:49,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:49,090 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:49,090 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:49,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1342397091, now seen corresponding path program 1 times [2018-12-02 01:16:49,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:49,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:49,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:49,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-12-02 01:16:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 01:16:49,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 01:16:49,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 01:16:49,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 01:16:49,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 01:16:49,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 01:16:49,176 INFO L87 Difference]: Start difference. First operand 6749 states and 10664 transitions. Second operand 4 states. [2018-12-02 01:16:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:16:50,145 INFO L93 Difference]: Finished difference Result 13799 states and 21759 transitions. [2018-12-02 01:16:50,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 01:16:50,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 284 [2018-12-02 01:16:50,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:16:50,151 INFO L225 Difference]: With dead ends: 13799 [2018-12-02 01:16:50,151 INFO L226 Difference]: Without dead ends: 7077 [2018-12-02 01:16:50,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 01:16:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7077 states. [2018-12-02 01:16:50,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7077 to 6752. [2018-12-02 01:16:50,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6752 states. [2018-12-02 01:16:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6752 states to 6752 states and 10642 transitions. [2018-12-02 01:16:50,665 INFO L78 Accepts]: Start accepts. Automaton has 6752 states and 10642 transitions. Word has length 284 [2018-12-02 01:16:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:16:50,665 INFO L480 AbstractCegarLoop]: Abstraction has 6752 states and 10642 transitions. [2018-12-02 01:16:50,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 01:16:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 6752 states and 10642 transitions. [2018-12-02 01:16:50,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-02 01:16:50,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:16:50,668 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 8, 8, 8, 7, 7, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1] [2018-12-02 01:16:50,668 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:16:50,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:16:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1273389362, now seen corresponding path program 2 times [2018-12-02 01:16:50,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:16:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:50,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 01:16:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:16:50,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:16:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 01:16:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 504 proven. 269 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2018-12-02 01:16:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:51,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 01:16:51,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 01:16:51,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 01:16:51,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 01:16:51,084 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 01:16:51,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 01:16:51,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 01:17:00,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-02 01:17:00,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 01:17:00,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 01:17:00,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 109 treesize of output 80 [2018-12-02 01:17:00,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-02 01:17:00,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:00,145 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 72 [2018-12-02 01:17:00,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-12-02 01:17:00,149 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:00,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 treesize of output 73 [2018-12-02 01:17:00,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:00,364 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 46 [2018-12-02 01:17:00,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,375 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 120 [2018-12-02 01:17:00,383 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:00,434 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:00,442 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 52 [2018-12-02 01:17:00,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,447 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,448 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 73 [2018-12-02 01:17:00,448 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:00,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:00,596 INFO L478 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 47 treesize of output 67 [2018-12-02 01:17:00,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,606 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 113 [2018-12-02 01:17:00,613 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:00,688 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,696 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 01:17:00,701 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:00,767 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:17:00,895 INFO L478 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 44 treesize of output 66 [2018-12-02 01:17:00,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,900 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 68 [2018-12-02 01:17:00,900 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:00,942 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:00,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 99 [2018-12-02 01:17:00,956 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,006 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:17:01,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:17:01,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-12-02 01:17:01,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:17:01,240 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,241 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,315 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 137 [2018-12-02 01:17:01,328 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 124 treesize of output 116 [2018-12-02 01:17:01,328 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 89 [2018-12-02 01:17:01,401 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,435 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,441 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 122 [2018-12-02 01:17:01,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 136 [2018-12-02 01:17:01,446 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,457 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,463 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 128 [2018-12-02 01:17:01,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 142 [2018-12-02 01:17:01,467 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,478 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 112 [2018-12-02 01:17:01,550 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 103 [2018-12-02 01:17:01,552 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,562 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 106 [2018-12-02 01:17:01,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 97 [2018-12-02 01:17:01,571 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,583 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 94 [2018-12-02 01:17:01,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:17:01,588 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,595 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 97 [2018-12-02 01:17:01,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2018-12-02 01:17:01,603 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,610 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 67 [2018-12-02 01:17:01,664 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:01,665 INFO L478 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 0 case distinctions, treesize of input 49 treesize of output 9 [2018-12-02 01:17:01,665 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,670 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,674 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 87 [2018-12-02 01:17:01,676 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 48 treesize of output 94 [2018-12-02 01:17:01,683 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,699 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,703 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 91 [2018-12-02 01:17:01,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 67 treesize of output 121 [2018-12-02 01:17:01,707 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,713 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,728 INFO L478 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 89 treesize of output 103 [2018-12-02 01:17:01,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2018-12-02 01:17:01,730 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,756 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 94 [2018-12-02 01:17:01,757 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,770 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:01,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-12-02 01:17:01,814 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-12-02 01:17:01,815 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,819 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,823 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 77 [2018-12-02 01:17:01,825 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-12-02 01:17:01,826 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,833 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 44 [2018-12-02 01:17:01,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:17:01,836 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,839 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,842 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 73 [2018-12-02 01:17:01,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 49 [2018-12-02 01:17:01,845 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,850 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-02 01:17:01,873 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 6 variables, input treesize:268, output treesize:211 [2018-12-02 01:17:01,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,938 INFO L478 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 129 treesize of output 126 [2018-12-02 01:17:01,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:01,942 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:01,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 98 [2018-12-02 01:17:01,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:01,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 95 [2018-12-02 01:17:02,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:02,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-02 01:17:02,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,656 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:02,656 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 137 [2018-12-02 01:17:02,659 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:02,660 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:02,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:02,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:02,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 131 [2018-12-02 01:17:02,662 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,679 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2018-12-02 01:17:02,885 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:02,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-02 01:17:02,887 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:02,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2018-12-02 01:17:03,070 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2018-12-02 01:17:03,071 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,082 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,234 INFO L478 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 3 case distinctions, treesize of input 93 treesize of output 123 [2018-12-02 01:17:03,236 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,239 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 161 [2018-12-02 01:17:03,241 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,303 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 158 [2018-12-02 01:17:03,304 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,335 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:03,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 109 [2018-12-02 01:17:03,490 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 76 [2018-12-02 01:17:03,491 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,500 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 95 [2018-12-02 01:17:03,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-12-02 01:17:03,618 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,628 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,719 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 80 [2018-12-02 01:17:03,721 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-12-02 01:17:03,723 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,731 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 88 [2018-12-02 01:17:03,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2018-12-02 01:17:03,806 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,813 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,870 INFO L478 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 62 treesize of output 80 [2018-12-02 01:17:03,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 119 [2018-12-02 01:17:03,883 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:03,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,922 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,923 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:03,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 133 [2018-12-02 01:17:03,937 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-12-02 01:17:03,975 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:17:04,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 73 [2018-12-02 01:17:04,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-12-02 01:17:04,038 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,046 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:17:04,089 INFO L202 ElimStorePlain]: Needed 27 recursive calls to eliminate 12 variables, input treesize:483, output treesize:352 [2018-12-02 01:17:04,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 64 [2018-12-02 01:17:04,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 92 [2018-12-02 01:17:04,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-12-02 01:17:04,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-12-02 01:17:04,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-02 01:17:04,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-12-02 01:17:04,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,350 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 75 [2018-12-02 01:17:04,360 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-02 01:17:04,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 01:17:04,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 62 [2018-12-02 01:17:04,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,438 INFO L478 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 58 treesize of output 62 [2018-12-02 01:17:04,438 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 17 [2018-12-02 01:17:04,452 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 33 [2018-12-02 01:17:04,469 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,479 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:04,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 68 treesize of output 52 [2018-12-02 01:17:04,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-12-02 01:17:04,517 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,526 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 01:17:04,533 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,538 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-12-02 01:17:04,584 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:393, output treesize:148 [2018-12-02 01:17:04,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-12-02 01:17:04,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:17:04,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 75 [2018-12-02 01:17:04,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2018-12-02 01:17:04,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-12-02 01:17:04,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-12-02 01:17:04,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,715 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 28 [2018-12-02 01:17:04,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:04,731 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-12-02 01:17:04,731 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,734 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:04,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:04,742 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:131, output treesize:55 [2018-12-02 01:17:04,744 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:04,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:05,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:05,709 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:06,533 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:06,611 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:07,351 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:07,419 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:08,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 274 treesize of output 240 [2018-12-02 01:17:08,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:17:08,044 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,119 INFO L478 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 40 treesize of output 64 [2018-12-02 01:17:08,122 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,124 INFO L478 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 38 treesize of output 68 [2018-12-02 01:17:08,128 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,129 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,131 INFO L478 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 45 treesize of output 112 [2018-12-02 01:17:08,132 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,154 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 37 treesize of output 39 [2018-12-02 01:17:08,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:08,192 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:17:08,192 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,210 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,228 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,265 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:08,739 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:08,824 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:09,342 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 220 [2018-12-02 01:17:09,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 214 [2018-12-02 01:17:09,347 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:10,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:10,229 INFO L478 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 180 treesize of output 242 [2018-12-02 01:17:10,229 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,182 INFO L478 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 214 treesize of output 197 [2018-12-02 01:17:11,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 176 [2018-12-02 01:17:11,191 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,200 INFO L478 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 168 treesize of output 192 [2018-12-02 01:17:11,200 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,221 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,249 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,718 INFO L478 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 207 treesize of output 215 [2018-12-02 01:17:11,723 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,725 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 234 [2018-12-02 01:17:11,735 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,736 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:11,743 INFO L478 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 192 treesize of output 220 [2018-12-02 01:17:11,744 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,782 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:11,931 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,098 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,420 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:12,472 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:12,721 INFO L478 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 255 treesize of output 221 [2018-12-02 01:17:12,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:17:12,726 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,787 INFO L478 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 169 treesize of output 166 [2018-12-02 01:17:12,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:12,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 156 treesize of output 166 [2018-12-02 01:17:12,800 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:12,802 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:12,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:12,810 INFO L478 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 158 treesize of output 178 [2018-12-02 01:17:12,810 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,830 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,847 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:12,881 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,050 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 171 [2018-12-02 01:17:13,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:17:13,052 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,083 INFO L478 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 40 treesize of output 47 [2018-12-02 01:17:13,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12-02 01:17:13,089 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,090 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,090 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-12-02 01:17:13,090 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,098 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,105 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,126 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,246 INFO L478 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 170 treesize of output 164 [2018-12-02 01:17:13,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 1 [2018-12-02 01:17:13,249 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,264 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,348 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:13,361 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:13,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 98 [2018-12-02 01:17:13,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,448 INFO L478 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 68 treesize of output 78 [2018-12-02 01:17:13,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 86 [2018-12-02 01:17:13,455 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,464 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,476 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,544 INFO L478 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 191 treesize of output 171 [2018-12-02 01:17:13,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 159 [2018-12-02 01:17:13,551 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 166 [2018-12-02 01:17:13,714 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,883 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 166 [2018-12-02 01:17:13,887 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,890 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 182 [2018-12-02 01:17:13,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 107 [2018-12-02 01:17:13,903 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,924 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:13,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:13,997 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,000 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 148 [2018-12-02 01:17:14,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,004 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,005 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 142 [2018-12-02 01:17:14,013 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,033 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,102 INFO L267 ElimStorePlain]: Start of recursive call 50: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,159 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:14,193 INFO L202 ElimStorePlain]: Needed 54 recursive calls to eliminate 14 variables, input treesize:551, output treesize:135 [2018-12-02 01:17:14,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 80 [2018-12-02 01:17:14,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-12-02 01:17:14,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 72 treesize of output 85 [2018-12-02 01:17:14,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,397 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 87 [2018-12-02 01:17:14,397 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 53 [2018-12-02 01:17:14,427 INFO L478 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 41 treesize of output 29 [2018-12-02 01:17:14,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,433 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2018-12-02 01:17:14,454 INFO L478 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 59 treesize of output 47 [2018-12-02 01:17:14,455 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,493 INFO L478 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 3 case distinctions, treesize of input 68 treesize of output 92 [2018-12-02 01:17:14,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,496 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,497 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 121 [2018-12-02 01:17:14,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 112 [2018-12-02 01:17:14,530 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,554 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:14,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58 [2018-12-02 01:17:14,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-12-02 01:17:14,583 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,595 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-12-02 01:17:14,599 INFO L478 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 41 treesize of output 29 [2018-12-02 01:17:14,600 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,606 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:14,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-02 01:17:14,629 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 6 variables, input treesize:171, output treesize:140 [2018-12-02 01:17:14,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 39 [2018-12-02 01:17:14,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-12-02 01:17:14,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 31 [2018-12-02 01:17:14,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 5 [2018-12-02 01:17:14,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,743 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:14,744 INFO L478 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 16 treesize of output 8 [2018-12-02 01:17:14,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:14,755 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:91, output treesize:3 [2018-12-02 01:17:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 678 proven. 73 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 01:17:14,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 01:17:15,055 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,061 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,142 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,147 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,165 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,169 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,182 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,186 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,204 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,207 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 159 treesize of output 127 [2018-12-02 01:17:15,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-12-02 01:17:15,233 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 01:17:15,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 125 [2018-12-02 01:17:15,254 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,255 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,255 INFO L478 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 72 treesize of output 101 [2018-12-02 01:17:15,272 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,273 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,273 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,274 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,275 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 156 [2018-12-02 01:17:15,276 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,282 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,290 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,292 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 01:17:15,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 152 [2018-12-02 01:17:15,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 1 [2018-12-02 01:17:15,295 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-12-02 01:17:15,300 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,304 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,315 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 01:17:15,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-02 01:17:15,324 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:322, output treesize:192 [2018-12-02 01:17:15,363 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,401 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:177, output treesize:247 [2018-12-02 01:17:15,517 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-12-02 01:17:15,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:199, output treesize:269 [2018-12-02 01:17:15,611 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-02 01:17:15,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 8 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 01:17:15,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 13 variables, input treesize:535, output treesize:1 [2018-12-02 01:17:15,753 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 682 proven. 69 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2018-12-02 01:17:15,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 01:17:15,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 30 [2018-12-02 01:17:15,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 01:17:15,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 01:17:15,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 01:17:15,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2018-12-02 01:17:15,773 INFO L87 Difference]: Start difference. First operand 6752 states and 10642 transitions. Second operand 21 states. [2018-12-02 01:17:21,714 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 75 [2018-12-02 01:17:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 01:17:25,111 INFO L93 Difference]: Finished difference Result 15019 states and 23193 transitions. [2018-12-02 01:17:25,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-02 01:17:25,111 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 294 [2018-12-02 01:17:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 01:17:25,117 INFO L225 Difference]: With dead ends: 15019 [2018-12-02 01:17:25,117 INFO L226 Difference]: Without dead ends: 8294 [2018-12-02 01:17:25,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 568 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=616, Invalid=2576, Unknown=0, NotChecked=0, Total=3192 [2018-12-02 01:17:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8294 states. [2018-12-02 01:17:25,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8294 to 5242. [2018-12-02 01:17:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2018-12-02 01:17:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 8278 transitions. [2018-12-02 01:17:25,543 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 8278 transitions. Word has length 294 [2018-12-02 01:17:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 01:17:25,544 INFO L480 AbstractCegarLoop]: Abstraction has 5242 states and 8278 transitions. [2018-12-02 01:17:25,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 01:17:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 8278 transitions. [2018-12-02 01:17:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-02 01:17:25,546 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 01:17:25,546 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 01:17:25,546 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ssl3_acceptErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 01:17:25,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 01:17:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1145986397, now seen corresponding path program 1 times [2018-12-02 01:17:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 01:17:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:25,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 01:17:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 01:17:25,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 01:17:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:17:25,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 01:17:25,804 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 01:17:25,859 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-02 01:17:25,860 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# [2018-12-02 01:17:25,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:17:25 BoogieIcfgContainer [2018-12-02 01:17:25,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 01:17:25,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 01:17:25,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 01:17:25,941 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 01:17:25,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:14:53" (3/4) ... [2018-12-02 01:17:25,944 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 01:17:25,944 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 01:17:25,944 INFO L168 Benchmark]: Toolchain (without parser) took 153899.88 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 960.5 MB). Free memory was 948.1 MB in the beginning and 977.8 MB in the end (delta: -29.7 MB). Peak memory consumption was 930.8 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:25,944 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: Boogie Preprocessor took 46.42 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: RCFGBuilder took 533.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: TraceAbstraction took 152935.39 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 848.8 MB). Free memory was 998.0 MB in the beginning and 977.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 869.0 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:25,945 INFO L168 Benchmark]: Witness Printer took 2.90 ms. Allocated memory is still 2.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:17:25,946 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -145.9 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.42 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: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 533.73 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 998.0 MB in the end (delta: 88.0 MB). Peak memory consumption was 88.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 152935.39 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 848.8 MB). Free memory was 998.0 MB in the beginning and 977.8 MB in the end (delta: 20.2 MB). Peak memory consumption was 869.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.90 ms. Allocated memory is still 2.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967311 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 4294967336 could not be translated for associated CType STRUCT~~ssl_method_st?version~INT?ssl_new~*((*~SSL~0 ) : INT)?ssl_clear~*((*~SSL~0 ) : VOID)?ssl_free~*((*~SSL~0 ) : VOID)?ssl_accept~*((*~SSL~0 ) : INT)?ssl_connect~*((*~SSL~0 ) : INT)?ssl_read~*((*~SSL~0 *VOID INT ) : INT)?ssl_peek~*((*~SSL~0 *VOID INT ) : INT)?ssl_write~*((*~SSL~0 *VOID INT ) : INT)?ssl_shutdown~*((*~SSL~0 ) : INT)?ssl_renegotiate~*((*~SSL~0 ) : INT)?ssl_renegotiate_check~*((*~SSL~0 ) : INT)?ssl_ctrl~*((*~SSL~0 INT LONG *CHAR ) : LONG)?ssl_ctx_ctrl~*((*~SSL_CTX~0 INT LONG *CHAR ) : LONG)?get_cipher_by_char~*((*UCHAR ) : *~SSL_CIPHER~0)?put_cipher_by_char~*((*~SSL_CIPHER~0 *UCHAR ) : INT)?ssl_pending~*((*~SSL~0 ) : INT)?num_ciphers~*(() : INT)?get_cipher~*((UINT ) : *~SSL_CIPHER~0)?get_ssl_method~*((INT ) : *ssl_method_st)?get_timeout~*(() : LONG)?ssl3_enc~*ssl3_enc_method?ssl_version~*(() : INT)?ssl_callback_ctrl~*((*~SSL~0 INT *(() : VOID) ) : LONG)?ssl_ctx_callback_ctrl~*((*~SSL_CTX~0 INT *(() : VOID) ) : LONG)# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1723]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1434. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [\old(init)=4294967352, \old(SSLv3_server_data)=null, \old(SSLv3_server_data)=null, init=1, SSLv3_server_data={4294967309:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) VAL [init=1, malloc(sizeof(SSL))={4294967330:0}, malloc(sizeof(SSL_CTX))={4294967353:0}, malloc(sizeof(SSL_SESSION))={4294967299:0}, malloc(sizeof(struct ssl3_state_st))={4294967347:0}, s={4294967330:0}, SSLv3_server_data={4294967309:0}] [L1074] CALL ssl3_accept(s) VAL [init=1, s={4294967330:0}, SSLv3_server_data={4294967309: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] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] 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] EXPR s->info_callback VAL [={0:0}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->info_callback={5:-4}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] EXPR s->cert VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->cert={3:-2}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=0, got_new_session=0, init=1, ret=-1, s={4294967330:0}, s={4294967330:0}, s->state=8464, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [={5:-4}, blastFlag=1, got_new_session=0, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8464, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=1, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8496, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->hit=0, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1357] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8496, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8512, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8512, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1371] s->state = 8528 [L1372] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=1, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8512, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8528, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND TRUE s->state == 8528 [L1376] EXPR s->s3 [L1376] EXPR (s->s3)->tmp.new_cipher [L1376] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1376] l = ((s->s3)->tmp.new_cipher)->algorithms [L1377] EXPR s->options VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->options=4294967338, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1377] COND TRUE s->options & 2097152UL [L1378] EXPR s->s3 [L1378] (s->s3)->tmp.use_rsa_tmp = 1 [L1382] EXPR s->s3 [L1382] (s->s3)->tmp.use_rsa_tmp VAL [={5:-4}, (s->s3)->tmp.use_rsa_tmp=1, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1382] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1400] ret = __VERIFIER_nondet_int() [L1401] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1418] s->state = 8544 [L1419] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8528, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->state=8544, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND TRUE s->state == 8544 [L1423] EXPR s->verify_mode VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->verify_mode=4294967296, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1423] COND TRUE s->verify_mode & 1 [L1424] EXPR s->session [L1424] EXPR (s->session)->peer VAL [={5:-4}, (s->session)->peer={1:4294967295}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->session={4294967299:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1424] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1434] EXPR s->s3 [L1434] EXPR (s->s3)->tmp.new_cipher [L1434] EXPR ((s->s3)->tmp.new_cipher)->algorithms VAL [={5:-4}, ((s->s3)->tmp.new_cipher)->algorithms=8544, (s->s3)->tmp.new_cipher={4294967330:40}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=11, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1434] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1444] EXPR s->s3 [L1444] (s->s3)->tmp.cert_request = 1 [L1445] ret = __VERIFIER_nondet_int() [L1446] COND FALSE !(ret <= 0) [L1451] s->state = 8448 [L1452] EXPR s->s3 [L1452] (s->s3)->tmp.next_state = 8576 [L1453] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8544, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8448, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND TRUE s->state == 8448 [L1475] COND FALSE !(num1 > 0L) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1488] EXPR s->s3 [L1488] EXPR (s->s3)->tmp.next_state [L1488] s->state = (s->s3)->tmp.next_state [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8448, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8576, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND TRUE s->state == 8576 [L1492] ret = __VERIFIER_nondet_int() [L1493] COND FALSE !(ret <= 0) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1498] COND FALSE !(ret == 2) [L1501] ret = __VERIFIER_nondet_int() [L1502] COND FALSE !(ret <= 0) [L1507] s->init_num = 0 [L1508] s->state = 8592 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8576, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8592, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND TRUE s->state == 8592 [L1513] ret = __VERIFIER_nondet_int() [L1514] COND FALSE !(ret <= 0) [L1519] s->state = 8608 [L1520] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8592, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8608, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND TRUE s->state == 8608 [L1524] ret = __VERIFIER_nondet_int() [L1525] COND FALSE !(ret <= 0) [L1530] s->state = 8640 [L1531] s->init_num = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] EXPR s->s3 [L1682] EXPR (s->s3)->tmp.reuse_message VAL [={5:-4}, (s->s3)->tmp.reuse_message=4294967332, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->s3={4294967347:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1682] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1711] skip = 0 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1136] COND TRUE 1 VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8608, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, s->state=8640, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1223] COND TRUE s->state == 8640 [L1535] ret = __VERIFIER_nondet_int() [L1536] COND FALSE !(blastFlag == 4) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1539] COND FALSE !(blastFlag == 7) VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] [L1723] __VERIFIER_error() VAL [={5:-4}, blastFlag=2, got_new_session=1, init=1, l=8528, num1=0, ret=1, s={4294967330:0}, s={4294967330:0}, skip=0, SSLv3_server_data={4294967309:0}, state=8640, Time=1, tmp=1, tmp___1=1, tmp___10=0, tmp___2=0, tmp___3=0, tmp___4=0, tmp___5=0, tmp___6=0, tmp___8=0, tmp___9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 159 locations, 1 error locations. UNSAFE Result, 152.8s OverallTime, 152 OverallIterations, 12 TraceHistogramMax, 78.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33800 SDtfs, 20188 SDslu, 64097 SDs, 0 SdLazy, 48661 SolverSat, 4163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 41.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6065 GetRequests, 5092 SyntacticMatches, 287 SemanticMatches, 686 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6917occurred in iteration=136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 14.5s AutomataMinimizationTime, 151 MinimizatonAttempts, 33630 StatesRemovedByMinimization, 148 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 11.8s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 26003 NumberOfCodeBlocks, 25825 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 27995 ConstructedInterpolants, 410 QuantifiedInterpolants, 39373111 SizeOfPredicates, 104 NumberOfNonLiveVariables, 9505 ConjunctsInSsa, 309 ConjunctsInUnsatCore, 171 InterpolantComputations, 149 PerfectInterpolantSequences, 45518/48090 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-635dfa2 [2018-12-02 01:17:28,333 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 01:17:28,333 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 01:17:28,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 01:17:28,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 01:17:28,340 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 01:17:28,341 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 01:17:28,341 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 01:17:28,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 01:17:28,343 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 01:17:28,343 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 01:17:28,343 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 01:17:28,343 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 01:17:28,344 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 01:17:28,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 01:17:28,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 01:17:28,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 01:17:28,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 01:17:28,347 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 01:17:28,348 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 01:17:28,348 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 01:17:28,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 01:17:28,350 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 01:17:28,350 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 01:17:28,350 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 01:17:28,350 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 01:17:28,351 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 01:17:28,351 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 01:17:28,352 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 01:17:28,352 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 01:17:28,352 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 01:17:28,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 01:17:28,353 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 01:17:28,353 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 01:17:28,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 01:17:28,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 01:17:28,354 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 01:17:28,361 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 01:17:28,361 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 01:17:28,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 01:17:28,361 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 01:17:28,361 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 01:17:28,362 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 01:17:28,362 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 01:17:28,362 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 01:17:28,363 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 01:17:28,363 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 01:17:28,364 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 01:17:28,364 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 01:17:28,364 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_51b9dafc-ed4e-4376-87a7-36b6cc301c22/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 -> df2b0e0d9b5ef7fc63f69443b04bd0a125d39bfd [2018-12-02 01:17:28,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 01:17:28,390 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 01:17:28,392 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 01:17:28,393 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 01:17:28,393 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 01:17:28,393 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c [2018-12-02 01:17:28,431 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/9ba9ac3b1/f2657dfbdb84460f83c95af2818893b1/FLAG0c06aca41 [2018-12-02 01:17:28,834 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 01:17:28,834 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/sv-benchmarks/c/ssh/s3_srvr.blast.08_false-unreach-call.i.cil.c [2018-12-02 01:17:28,844 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/9ba9ac3b1/f2657dfbdb84460f83c95af2818893b1/FLAG0c06aca41 [2018-12-02 01:17:28,852 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_51b9dafc-ed4e-4376-87a7-36b6cc301c22/bin-2019/utaipan/data/9ba9ac3b1/f2657dfbdb84460f83c95af2818893b1 [2018-12-02 01:17:28,853 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 01:17:28,854 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 01:17:28,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 01:17:28,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 01:17:28,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 01:17:28,857 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:28" (1/1) ... [2018-12-02 01:17:28,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3103db51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:28, skipping insertion in model container [2018-12-02 01:17:28,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:28" (1/1) ... [2018-12-02 01:17:28,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 01:17:28,894 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 01:17:29,115 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:17:29,127 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 01:17:29,219 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 01:17:29,220 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.MemoryHandler.getInitializationForOnHeapVariableOfAggregateOrUnionType(MemoryHandler.java:2813) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.makeOnHeapDefaultInitializationViaConstArray(InitializationHandler.java:814) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:254) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.InitializationHandler.initialize(InitializationHandler.java:194) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.createUltimateInitProcedure(PostProcessor.java:639) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.PostProcessor.postProcess(PostProcessor.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:566) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainDispatcher.dispatch(MainDispatcher.java:269) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.performMainRun(MainTranslator.java:230) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:117) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:129) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-02 01:17:29,222 INFO L168 Benchmark]: Toolchain (without parser) took 368.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:29,223 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 01:17:29,224 INFO L168 Benchmark]: CACSL2BoogieTranslator took 367.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2018-12-02 01:17:29,225 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 367.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: AssertionError: null: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CTranslationUtil.extractNonAggregateNonUnionTypes(CTranslationUtil.java:470) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...