./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:07:14,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:07:14,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:07:14,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:07:14,772 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:07:14,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:07:14,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:07:14,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:07:14,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:07:14,778 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:07:14,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:07:14,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:07:14,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:07:14,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:07:14,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:07:14,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:07:14,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:07:14,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:07:14,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:07:14,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:07:14,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:07:14,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:07:14,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:07:14,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:07:14,794 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:07:14,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:07:14,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:07:14,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:07:14,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:07:14,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:07:14,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:07:14,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:07:14,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:07:14,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:07:14,799 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:07:14,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:07:14,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:07:14,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:07:14,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:07:14,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:07:14,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:07:14,801 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:07:14,814 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:07:14,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:07:14,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:07:14,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:07:14,815 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:07:14,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:07:14,815 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:07:14,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:07:14,816 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:07:14,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:07:14,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:07:14,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:07:14,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer 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 -> Automizer 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 -> bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b [2019-12-07 17:07:14,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:07:14,935 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:07:14,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:07:14,938 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:07:14,939 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:07:14,939 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:07:14,984 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/c8643386c/0340de2668364253b591829ca40dcaf1/FLAGce496cd6e [2019-12-07 17:07:15,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:07:15,375 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:07:15,387 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/c8643386c/0340de2668364253b591829ca40dcaf1/FLAGce496cd6e [2019-12-07 17:07:15,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/c8643386c/0340de2668364253b591829ca40dcaf1 [2019-12-07 17:07:15,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:07:15,399 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:07:15,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:15,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:07:15,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:07:15,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c6d1690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15, skipping insertion in model container [2019-12-07 17:07:15,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:07:15,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:07:15,708 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:15,718 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:07:15,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:15,794 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:07:15,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15 WrapperNode [2019-12-07 17:07:15,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:15,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:07:15,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:07:15,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:07:15,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,817 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:07:15,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:07:15,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:07:15,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:07:15,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... [2019-12-07 17:07:15,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:07:15,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:07:15,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:07:15,900 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:07:15,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/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 [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:07:15,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:07:15,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:07:16,051 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:07:16,551 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:07:16,551 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:07:16,552 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:07:16,552 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:07:16,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:07:16 BoogieIcfgContainer [2019-12-07 17:07:16,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:07:16,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:07:16,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:07:16,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:07:16,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:07:15" (1/3) ... [2019-12-07 17:07:16,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38094780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:07:16, skipping insertion in model container [2019-12-07 17:07:16,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:15" (2/3) ... [2019-12-07 17:07:16,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38094780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:07:16, skipping insertion in model container [2019-12-07 17:07:16,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:07:16" (3/3) ... [2019-12-07 17:07:16,558 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:07:16,564 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:07:16,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:07:16,577 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:07:16,592 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:07:16,593 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:07:16,593 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:07:16,593 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:07:16,593 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:07:16,593 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:07:16,593 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:07:16,593 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:07:16,606 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-12-07 17:07:16,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:07:16,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:16,612 INFO L410 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] [2019-12-07 17:07:16,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 102131601, now seen corresponding path program 1 times [2019-12-07 17:07:16,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:16,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504427426] [2019-12-07 17:07:16,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:16,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:16,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504427426] [2019-12-07 17:07:16,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:16,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:16,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456888077] [2019-12-07 17:07:16,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:16,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:16,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:16,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:16,832 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-12-07 17:07:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:17,160 INFO L93 Difference]: Finished difference Result 335 states and 571 transitions. [2019-12-07 17:07:17,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:17,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 17:07:17,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:17,171 INFO L225 Difference]: With dead ends: 335 [2019-12-07 17:07:17,171 INFO L226 Difference]: Without dead ends: 169 [2019-12-07 17:07:17,174 INFO L630 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 [2019-12-07 17:07:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-12-07 17:07:17,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-12-07 17:07:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 238 transitions. [2019-12-07 17:07:17,208 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 238 transitions. Word has length 43 [2019-12-07 17:07:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:17,209 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 238 transitions. [2019-12-07 17:07:17,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 238 transitions. [2019-12-07 17:07:17,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:07:17,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:17,211 INFO L410 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] [2019-12-07 17:07:17,211 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash -946849282, now seen corresponding path program 1 times [2019-12-07 17:07:17,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:17,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597459371] [2019-12-07 17:07:17,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:17,292 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:17,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597459371] [2019-12-07 17:07:17,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:17,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:17,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865710262] [2019-12-07 17:07:17,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:17,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:17,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:17,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:17,294 INFO L87 Difference]: Start difference. First operand 152 states and 238 transitions. Second operand 4 states. [2019-12-07 17:07:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:17,536 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2019-12-07 17:07:17,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:17,536 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 17:07:17,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:17,538 INFO L225 Difference]: With dead ends: 302 [2019-12-07 17:07:17,539 INFO L226 Difference]: Without dead ends: 169 [2019-12-07 17:07:17,540 INFO L630 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 [2019-12-07 17:07:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-12-07 17:07:17,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2019-12-07 17:07:17,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 237 transitions. [2019-12-07 17:07:17,552 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 237 transitions. Word has length 56 [2019-12-07 17:07:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:17,553 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 237 transitions. [2019-12-07 17:07:17,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:17,553 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 237 transitions. [2019-12-07 17:07:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:07:17,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:17,555 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:17,555 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:17,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:17,555 INFO L82 PathProgramCache]: Analyzing trace with hash 186857616, now seen corresponding path program 1 times [2019-12-07 17:07:17,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:17,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879480402] [2019-12-07 17:07:17,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:17,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879480402] [2019-12-07 17:07:17,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:17,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:17,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577607122] [2019-12-07 17:07:17,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:17,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:17,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:17,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:17,644 INFO L87 Difference]: Start difference. First operand 152 states and 237 transitions. Second operand 4 states. [2019-12-07 17:07:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:17,855 INFO L93 Difference]: Finished difference Result 301 states and 465 transitions. [2019-12-07 17:07:17,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:17,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:07:17,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:17,857 INFO L225 Difference]: With dead ends: 301 [2019-12-07 17:07:17,857 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 17:07:17,857 INFO L630 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 [2019-12-07 17:07:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 17:07:17,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2019-12-07 17:07:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:17,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2019-12-07 17:07:17,864 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 57 [2019-12-07 17:07:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:17,865 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2019-12-07 17:07:17,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:17,865 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2019-12-07 17:07:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:07:17,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:17,866 INFO L410 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] [2019-12-07 17:07:17,866 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:17,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:17,867 INFO L82 PathProgramCache]: Analyzing trace with hash -781576005, now seen corresponding path program 1 times [2019-12-07 17:07:17,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:17,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981035836] [2019-12-07 17:07:17,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:17,912 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:17,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981035836] [2019-12-07 17:07:17,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:17,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:17,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153233222] [2019-12-07 17:07:17,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:17,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:17,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:17,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:17,914 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand 4 states. [2019-12-07 17:07:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:18,109 INFO L93 Difference]: Finished difference Result 299 states and 462 transitions. [2019-12-07 17:07:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:18,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:07:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:18,110 INFO L225 Difference]: With dead ends: 299 [2019-12-07 17:07:18,110 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 17:07:18,111 INFO L630 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 [2019-12-07 17:07:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 17:07:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2019-12-07 17:07:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 235 transitions. [2019-12-07 17:07:18,117 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 235 transitions. Word has length 57 [2019-12-07 17:07:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:18,117 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 235 transitions. [2019-12-07 17:07:18,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 235 transitions. [2019-12-07 17:07:18,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:07:18,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:18,119 INFO L410 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] [2019-12-07 17:07:18,119 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:18,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:18,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1221644283, now seen corresponding path program 1 times [2019-12-07 17:07:18,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:18,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821064876] [2019-12-07 17:07:18,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:18,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:18,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821064876] [2019-12-07 17:07:18,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:18,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:18,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853295329] [2019-12-07 17:07:18,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:18,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:18,162 INFO L87 Difference]: Start difference. First operand 152 states and 235 transitions. Second operand 4 states. [2019-12-07 17:07:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:18,357 INFO L93 Difference]: Finished difference Result 298 states and 460 transitions. [2019-12-07 17:07:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:18,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:07:18,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:18,358 INFO L225 Difference]: With dead ends: 298 [2019-12-07 17:07:18,358 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 17:07:18,359 INFO L630 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 [2019-12-07 17:07:18,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 17:07:18,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-12-07 17:07:18,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 234 transitions. [2019-12-07 17:07:18,365 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 234 transitions. Word has length 57 [2019-12-07 17:07:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:18,365 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 234 transitions. [2019-12-07 17:07:18,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 234 transitions. [2019-12-07 17:07:18,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:07:18,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:18,366 INFO L410 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] [2019-12-07 17:07:18,366 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:18,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:18,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2073761060, now seen corresponding path program 1 times [2019-12-07 17:07:18,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:18,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33436660] [2019-12-07 17:07:18,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:18,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33436660] [2019-12-07 17:07:18,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:18,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:18,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898693531] [2019-12-07 17:07:18,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:18,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:18,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:18,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:18,412 INFO L87 Difference]: Start difference. First operand 152 states and 234 transitions. Second operand 4 states. [2019-12-07 17:07:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:18,603 INFO L93 Difference]: Finished difference Result 298 states and 459 transitions. [2019-12-07 17:07:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:18,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:07:18,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:18,605 INFO L225 Difference]: With dead ends: 298 [2019-12-07 17:07:18,605 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 17:07:18,605 INFO L630 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 [2019-12-07 17:07:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 17:07:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-12-07 17:07:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 233 transitions. [2019-12-07 17:07:18,609 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 233 transitions. Word has length 57 [2019-12-07 17:07:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:18,609 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 233 transitions. [2019-12-07 17:07:18,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:18,609 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 233 transitions. [2019-12-07 17:07:18,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:07:18,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:18,610 INFO L410 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] [2019-12-07 17:07:18,610 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:18,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1080146745, now seen corresponding path program 1 times [2019-12-07 17:07:18,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:18,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504854664] [2019-12-07 17:07:18,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:18,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504854664] [2019-12-07 17:07:18,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:18,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:18,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114612542] [2019-12-07 17:07:18,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:18,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:18,655 INFO L87 Difference]: Start difference. First operand 152 states and 233 transitions. Second operand 4 states. [2019-12-07 17:07:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:18,838 INFO L93 Difference]: Finished difference Result 298 states and 458 transitions. [2019-12-07 17:07:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:18,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 17:07:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:18,839 INFO L225 Difference]: With dead ends: 298 [2019-12-07 17:07:18,839 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 17:07:18,839 INFO L630 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 [2019-12-07 17:07:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 17:07:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-12-07 17:07:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:18,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 232 transitions. [2019-12-07 17:07:18,843 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 232 transitions. Word has length 58 [2019-12-07 17:07:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:18,844 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 232 transitions. [2019-12-07 17:07:18,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 232 transitions. [2019-12-07 17:07:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:07:18,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:18,844 INFO L410 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] [2019-12-07 17:07:18,844 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1197721801, now seen corresponding path program 1 times [2019-12-07 17:07:18,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:18,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054593398] [2019-12-07 17:07:18,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:18,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:18,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054593398] [2019-12-07 17:07:18,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:18,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:18,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526947554] [2019-12-07 17:07:18,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:18,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:18,881 INFO L87 Difference]: Start difference. First operand 152 states and 232 transitions. Second operand 4 states. [2019-12-07 17:07:19,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:19,097 INFO L93 Difference]: Finished difference Result 298 states and 457 transitions. [2019-12-07 17:07:19,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:19,098 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 17:07:19,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:19,099 INFO L225 Difference]: With dead ends: 298 [2019-12-07 17:07:19,099 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 17:07:19,099 INFO L630 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 [2019-12-07 17:07:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 17:07:19,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2019-12-07 17:07:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 231 transitions. [2019-12-07 17:07:19,102 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 231 transitions. Word has length 59 [2019-12-07 17:07:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:19,103 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 231 transitions. [2019-12-07 17:07:19,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:19,103 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 231 transitions. [2019-12-07 17:07:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:07:19,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:19,103 INFO L410 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] [2019-12-07 17:07:19,103 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:19,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:19,104 INFO L82 PathProgramCache]: Analyzing trace with hash 61965388, now seen corresponding path program 1 times [2019-12-07 17:07:19,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:19,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281678663] [2019-12-07 17:07:19,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:19,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281678663] [2019-12-07 17:07:19,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:19,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:19,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954485846] [2019-12-07 17:07:19,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:19,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:19,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:19,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:19,138 INFO L87 Difference]: Start difference. First operand 152 states and 231 transitions. Second operand 4 states. [2019-12-07 17:07:19,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:19,315 INFO L93 Difference]: Finished difference Result 288 states and 443 transitions. [2019-12-07 17:07:19,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:19,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 17:07:19,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:19,317 INFO L225 Difference]: With dead ends: 288 [2019-12-07 17:07:19,317 INFO L226 Difference]: Without dead ends: 155 [2019-12-07 17:07:19,317 INFO L630 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 [2019-12-07 17:07:19,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-12-07 17:07:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-12-07 17:07:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-07 17:07:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 230 transitions. [2019-12-07 17:07:19,321 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 230 transitions. Word has length 60 [2019-12-07 17:07:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:19,321 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 230 transitions. [2019-12-07 17:07:19,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 230 transitions. [2019-12-07 17:07:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:07:19,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:19,321 INFO L410 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] [2019-12-07 17:07:19,322 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash -549908044, now seen corresponding path program 1 times [2019-12-07 17:07:19,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:19,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525020373] [2019-12-07 17:07:19,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:19,357 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:19,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525020373] [2019-12-07 17:07:19,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:19,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:19,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526874505] [2019-12-07 17:07:19,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:19,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:19,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:19,358 INFO L87 Difference]: Start difference. First operand 152 states and 230 transitions. Second operand 4 states. [2019-12-07 17:07:19,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:19,609 INFO L93 Difference]: Finished difference Result 328 states and 504 transitions. [2019-12-07 17:07:19,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:19,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 17:07:19,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:19,611 INFO L225 Difference]: With dead ends: 328 [2019-12-07 17:07:19,611 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 17:07:19,612 INFO L630 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 [2019-12-07 17:07:19,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 17:07:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-12-07 17:07:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 268 transitions. [2019-12-07 17:07:19,617 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 268 transitions. Word has length 60 [2019-12-07 17:07:19,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:19,618 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 268 transitions. [2019-12-07 17:07:19,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 268 transitions. [2019-12-07 17:07:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 17:07:19,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:19,619 INFO L410 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] [2019-12-07 17:07:19,619 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2128896187, now seen corresponding path program 1 times [2019-12-07 17:07:19,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:19,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694699211] [2019-12-07 17:07:19,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:19,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694699211] [2019-12-07 17:07:19,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:19,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:19,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348925154] [2019-12-07 17:07:19,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:19,664 INFO L87 Difference]: Start difference. First operand 174 states and 268 transitions. Second operand 4 states. [2019-12-07 17:07:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:19,881 INFO L93 Difference]: Finished difference Result 350 states and 541 transitions. [2019-12-07 17:07:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:19,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 17:07:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:19,882 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:07:19,882 INFO L226 Difference]: Without dead ends: 195 [2019-12-07 17:07:19,883 INFO L630 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 [2019-12-07 17:07:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-12-07 17:07:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-12-07 17:07:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 267 transitions. [2019-12-07 17:07:19,886 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 267 transitions. Word has length 73 [2019-12-07 17:07:19,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:19,887 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 267 transitions. [2019-12-07 17:07:19,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 267 transitions. [2019-12-07 17:07:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:07:19,887 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:19,887 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:07:19,888 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:19,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1045686643, now seen corresponding path program 1 times [2019-12-07 17:07:19,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:19,888 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357191165] [2019-12-07 17:07:19,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:19,915 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:19,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357191165] [2019-12-07 17:07:19,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:19,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:19,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533866108] [2019-12-07 17:07:19,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:19,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:19,916 INFO L87 Difference]: Start difference. First operand 174 states and 267 transitions. Second operand 4 states. [2019-12-07 17:07:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:20,116 INFO L93 Difference]: Finished difference Result 349 states and 538 transitions. [2019-12-07 17:07:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:20,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:07:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:20,117 INFO L225 Difference]: With dead ends: 349 [2019-12-07 17:07:20,118 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 17:07:20,118 INFO L630 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 [2019-12-07 17:07:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 17:07:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2019-12-07 17:07:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 266 transitions. [2019-12-07 17:07:20,122 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 266 transitions. Word has length 74 [2019-12-07 17:07:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:20,122 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 266 transitions. [2019-12-07 17:07:20,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 266 transitions. [2019-12-07 17:07:20,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:07:20,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:20,123 INFO L410 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] [2019-12-07 17:07:20,123 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:20,123 INFO L82 PathProgramCache]: Analyzing trace with hash 77253022, now seen corresponding path program 1 times [2019-12-07 17:07:20,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:20,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74362907] [2019-12-07 17:07:20,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:20,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74362907] [2019-12-07 17:07:20,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:20,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:20,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757474981] [2019-12-07 17:07:20,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:20,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:20,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:20,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:20,155 INFO L87 Difference]: Start difference. First operand 174 states and 266 transitions. Second operand 4 states. [2019-12-07 17:07:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:20,400 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2019-12-07 17:07:20,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:20,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:07:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:20,402 INFO L225 Difference]: With dead ends: 347 [2019-12-07 17:07:20,402 INFO L226 Difference]: Without dead ends: 192 [2019-12-07 17:07:20,402 INFO L630 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 [2019-12-07 17:07:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-07 17:07:20,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2019-12-07 17:07:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:20,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 265 transitions. [2019-12-07 17:07:20,406 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 265 transitions. Word has length 74 [2019-12-07 17:07:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:20,406 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 265 transitions. [2019-12-07 17:07:20,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 265 transitions. [2019-12-07 17:07:20,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:07:20,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:20,407 INFO L410 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] [2019-12-07 17:07:20,407 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:20,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:20,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2080473310, now seen corresponding path program 1 times [2019-12-07 17:07:20,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:20,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308066516] [2019-12-07 17:07:20,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:20,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308066516] [2019-12-07 17:07:20,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:20,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:20,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331262591] [2019-12-07 17:07:20,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:20,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:20,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:20,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:20,439 INFO L87 Difference]: Start difference. First operand 174 states and 265 transitions. Second operand 4 states. [2019-12-07 17:07:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:20,661 INFO L93 Difference]: Finished difference Result 346 states and 531 transitions. [2019-12-07 17:07:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:20,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:07:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:20,663 INFO L225 Difference]: With dead ends: 346 [2019-12-07 17:07:20,663 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:07:20,663 INFO L630 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 [2019-12-07 17:07:20,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:07:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-12-07 17:07:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 264 transitions. [2019-12-07 17:07:20,676 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 264 transitions. Word has length 74 [2019-12-07 17:07:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:20,676 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 264 transitions. [2019-12-07 17:07:20,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 264 transitions. [2019-12-07 17:07:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:07:20,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:20,677 INFO L410 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] [2019-12-07 17:07:20,677 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1362377209, now seen corresponding path program 1 times [2019-12-07 17:07:20,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:20,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737291455] [2019-12-07 17:07:20,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:20,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737291455] [2019-12-07 17:07:20,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:20,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:20,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125989006] [2019-12-07 17:07:20,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:20,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:20,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:20,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:20,710 INFO L87 Difference]: Start difference. First operand 174 states and 264 transitions. Second operand 4 states. [2019-12-07 17:07:20,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:20,936 INFO L93 Difference]: Finished difference Result 346 states and 529 transitions. [2019-12-07 17:07:20,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:20,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:07:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:20,938 INFO L225 Difference]: With dead ends: 346 [2019-12-07 17:07:20,938 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:07:20,938 INFO L630 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 [2019-12-07 17:07:20,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:07:20,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-12-07 17:07:20,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 263 transitions. [2019-12-07 17:07:20,942 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 263 transitions. Word has length 74 [2019-12-07 17:07:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:20,942 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 263 transitions. [2019-12-07 17:07:20,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:20,943 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 263 transitions. [2019-12-07 17:07:20,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 17:07:20,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:20,943 INFO L410 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] [2019-12-07 17:07:20,944 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:20,944 INFO L82 PathProgramCache]: Analyzing trace with hash -226250684, now seen corresponding path program 1 times [2019-12-07 17:07:20,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:20,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645085415] [2019-12-07 17:07:20,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:20,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645085415] [2019-12-07 17:07:20,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:20,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:20,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890789732] [2019-12-07 17:07:20,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:20,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:20,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:20,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:20,979 INFO L87 Difference]: Start difference. First operand 174 states and 263 transitions. Second operand 4 states. [2019-12-07 17:07:21,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:21,166 INFO L93 Difference]: Finished difference Result 346 states and 527 transitions. [2019-12-07 17:07:21,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:21,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 17:07:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:21,167 INFO L225 Difference]: With dead ends: 346 [2019-12-07 17:07:21,167 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:07:21,168 INFO L630 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 [2019-12-07 17:07:21,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:07:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-12-07 17:07:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:21,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2019-12-07 17:07:21,171 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 75 [2019-12-07 17:07:21,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:21,171 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2019-12-07 17:07:21,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:21,171 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2019-12-07 17:07:21,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 17:07:21,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:21,172 INFO L410 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] [2019-12-07 17:07:21,172 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:21,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:21,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1898695916, now seen corresponding path program 1 times [2019-12-07 17:07:21,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:21,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015512441] [2019-12-07 17:07:21,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:21,198 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:21,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015512441] [2019-12-07 17:07:21,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:21,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:21,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401686256] [2019-12-07 17:07:21,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:21,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:21,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:21,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:21,199 INFO L87 Difference]: Start difference. First operand 174 states and 262 transitions. Second operand 4 states. [2019-12-07 17:07:21,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:21,436 INFO L93 Difference]: Finished difference Result 346 states and 525 transitions. [2019-12-07 17:07:21,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:21,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 17:07:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:21,437 INFO L225 Difference]: With dead ends: 346 [2019-12-07 17:07:21,437 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 17:07:21,438 INFO L630 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 [2019-12-07 17:07:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 17:07:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 174. [2019-12-07 17:07:21,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:21,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 261 transitions. [2019-12-07 17:07:21,441 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 261 transitions. Word has length 76 [2019-12-07 17:07:21,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:21,441 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 261 transitions. [2019-12-07 17:07:21,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 261 transitions. [2019-12-07 17:07:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 17:07:21,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:21,442 INFO L410 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] [2019-12-07 17:07:21,442 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash 317326473, now seen corresponding path program 1 times [2019-12-07 17:07:21,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:21,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711432329] [2019-12-07 17:07:21,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:07:21,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711432329] [2019-12-07 17:07:21,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:21,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:21,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233508685] [2019-12-07 17:07:21,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:21,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:21,472 INFO L87 Difference]: Start difference. First operand 174 states and 261 transitions. Second operand 4 states. [2019-12-07 17:07:21,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:21,673 INFO L93 Difference]: Finished difference Result 336 states and 510 transitions. [2019-12-07 17:07:21,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:21,673 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 17:07:21,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:21,674 INFO L225 Difference]: With dead ends: 336 [2019-12-07 17:07:21,674 INFO L226 Difference]: Without dead ends: 181 [2019-12-07 17:07:21,675 INFO L630 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 [2019-12-07 17:07:21,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-12-07 17:07:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2019-12-07 17:07:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 17:07:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2019-12-07 17:07:21,678 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 77 [2019-12-07 17:07:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:21,678 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2019-12-07 17:07:21,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2019-12-07 17:07:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:07:21,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:21,679 INFO L410 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] [2019-12-07 17:07:21,679 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:21,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:21,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1100428173, now seen corresponding path program 1 times [2019-12-07 17:07:21,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:21,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832058846] [2019-12-07 17:07:21,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:21,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832058846] [2019-12-07 17:07:21,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:21,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:21,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322724451] [2019-12-07 17:07:21,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:21,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:21,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:21,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:21,728 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand 4 states. [2019-12-07 17:07:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:22,014 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2019-12-07 17:07:22,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:22,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 17:07:22,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:22,016 INFO L225 Difference]: With dead ends: 441 [2019-12-07 17:07:22,016 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 17:07:22,016 INFO L630 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 [2019-12-07 17:07:22,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 17:07:22,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 215. [2019-12-07 17:07:22,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-12-07 17:07:22,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 334 transitions. [2019-12-07 17:07:22,020 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 334 transitions. Word has length 82 [2019-12-07 17:07:22,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:22,020 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 334 transitions. [2019-12-07 17:07:22,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 334 transitions. [2019-12-07 17:07:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:07:22,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:22,021 INFO L410 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] [2019-12-07 17:07:22,021 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:22,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:22,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1524074895, now seen corresponding path program 1 times [2019-12-07 17:07:22,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:22,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123046948] [2019-12-07 17:07:22,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:22,068 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:22,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123046948] [2019-12-07 17:07:22,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:22,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:22,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73283220] [2019-12-07 17:07:22,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:22,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:22,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:22,070 INFO L87 Difference]: Start difference. First operand 215 states and 334 transitions. Second operand 4 states. [2019-12-07 17:07:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:22,350 INFO L93 Difference]: Finished difference Result 461 states and 723 transitions. [2019-12-07 17:07:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:22,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 17:07:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:22,352 INFO L225 Difference]: With dead ends: 461 [2019-12-07 17:07:22,352 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 17:07:22,352 INFO L630 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 [2019-12-07 17:07:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 17:07:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2019-12-07 17:07:22,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 17:07:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 376 transitions. [2019-12-07 17:07:22,356 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 376 transitions. Word has length 82 [2019-12-07 17:07:22,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:22,356 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 376 transitions. [2019-12-07 17:07:22,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:22,356 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 376 transitions. [2019-12-07 17:07:22,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:07:22,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:22,357 INFO L410 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] [2019-12-07 17:07:22,357 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 866488115, now seen corresponding path program 1 times [2019-12-07 17:07:22,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:22,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383911749] [2019-12-07 17:07:22,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:22,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383911749] [2019-12-07 17:07:22,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:22,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:22,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561408601] [2019-12-07 17:07:22,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:22,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:22,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:22,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:22,398 INFO L87 Difference]: Start difference. First operand 239 states and 376 transitions. Second operand 4 states. [2019-12-07 17:07:22,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:22,689 INFO L93 Difference]: Finished difference Result 522 states and 819 transitions. [2019-12-07 17:07:22,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:22,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 17:07:22,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:22,691 INFO L225 Difference]: With dead ends: 522 [2019-12-07 17:07:22,691 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 17:07:22,691 INFO L630 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 [2019-12-07 17:07:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 17:07:22,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-12-07 17:07:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 377 transitions. [2019-12-07 17:07:22,697 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 377 transitions. Word has length 83 [2019-12-07 17:07:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:22,697 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 377 transitions. [2019-12-07 17:07:22,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 377 transitions. [2019-12-07 17:07:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:07:22,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:22,698 INFO L410 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] [2019-12-07 17:07:22,698 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:22,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:22,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1900267394, now seen corresponding path program 1 times [2019-12-07 17:07:22,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:22,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226139656] [2019-12-07 17:07:22,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:22,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226139656] [2019-12-07 17:07:22,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:22,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:22,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584704385] [2019-12-07 17:07:22,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:22,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:22,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:22,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:22,743 INFO L87 Difference]: Start difference. First operand 240 states and 377 transitions. Second operand 4 states. [2019-12-07 17:07:23,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:23,049 INFO L93 Difference]: Finished difference Result 523 states and 819 transitions. [2019-12-07 17:07:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:23,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:07:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:23,051 INFO L225 Difference]: With dead ends: 523 [2019-12-07 17:07:23,051 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 17:07:23,052 INFO L630 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 [2019-12-07 17:07:23,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 17:07:23,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 240. [2019-12-07 17:07:23,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 376 transitions. [2019-12-07 17:07:23,055 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 376 transitions. Word has length 95 [2019-12-07 17:07:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:23,056 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 376 transitions. [2019-12-07 17:07:23,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 376 transitions. [2019-12-07 17:07:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:07:23,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:23,056 INFO L410 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] [2019-12-07 17:07:23,057 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:23,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:23,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1518680896, now seen corresponding path program 1 times [2019-12-07 17:07:23,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:23,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929008235] [2019-12-07 17:07:23,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:23,098 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:23,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929008235] [2019-12-07 17:07:23,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:23,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:23,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752800925] [2019-12-07 17:07:23,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:23,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:23,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:23,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:23,100 INFO L87 Difference]: Start difference. First operand 240 states and 376 transitions. Second operand 4 states. [2019-12-07 17:07:23,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:23,337 INFO L93 Difference]: Finished difference Result 487 states and 764 transitions. [2019-12-07 17:07:23,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:23,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:07:23,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:23,339 INFO L225 Difference]: With dead ends: 487 [2019-12-07 17:07:23,339 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 17:07:23,340 INFO L630 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 [2019-12-07 17:07:23,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 17:07:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 240. [2019-12-07 17:07:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 375 transitions. [2019-12-07 17:07:23,343 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 375 transitions. Word has length 95 [2019-12-07 17:07:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:23,344 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 375 transitions. [2019-12-07 17:07:23,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 375 transitions. [2019-12-07 17:07:23,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:23,344 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:23,344 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:23,344 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:23,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:23,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1746838644, now seen corresponding path program 1 times [2019-12-07 17:07:23,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:23,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732714620] [2019-12-07 17:07:23,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:23,380 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:23,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732714620] [2019-12-07 17:07:23,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:23,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:23,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322939912] [2019-12-07 17:07:23,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:23,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:23,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:23,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:23,382 INFO L87 Difference]: Start difference. First operand 240 states and 375 transitions. Second operand 4 states. [2019-12-07 17:07:23,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:23,677 INFO L93 Difference]: Finished difference Result 522 states and 814 transitions. [2019-12-07 17:07:23,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:23,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:07:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:23,678 INFO L225 Difference]: With dead ends: 522 [2019-12-07 17:07:23,678 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 17:07:23,679 INFO L630 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 [2019-12-07 17:07:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 17:07:23,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 240. [2019-12-07 17:07:23,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 374 transitions. [2019-12-07 17:07:23,682 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 374 transitions. Word has length 96 [2019-12-07 17:07:23,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:23,682 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 374 transitions. [2019-12-07 17:07:23,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:23,682 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 374 transitions. [2019-12-07 17:07:23,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:23,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:23,683 INFO L410 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] [2019-12-07 17:07:23,683 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1579695031, now seen corresponding path program 1 times [2019-12-07 17:07:23,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:23,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724521280] [2019-12-07 17:07:23,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:23,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724521280] [2019-12-07 17:07:23,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:23,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:23,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17619007] [2019-12-07 17:07:23,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:23,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:23,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:23,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:23,717 INFO L87 Difference]: Start difference. First operand 240 states and 374 transitions. Second operand 4 states. [2019-12-07 17:07:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:24,036 INFO L93 Difference]: Finished difference Result 520 states and 810 transitions. [2019-12-07 17:07:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:24,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:07:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:24,037 INFO L225 Difference]: With dead ends: 520 [2019-12-07 17:07:24,037 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 17:07:24,038 INFO L630 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 [2019-12-07 17:07:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 17:07:24,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 240. [2019-12-07 17:07:24,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:24,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 373 transitions. [2019-12-07 17:07:24,041 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 373 transitions. Word has length 96 [2019-12-07 17:07:24,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:24,041 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 373 transitions. [2019-12-07 17:07:24,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 373 transitions. [2019-12-07 17:07:24,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:24,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:24,042 INFO L410 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] [2019-12-07 17:07:24,042 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:24,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -712051977, now seen corresponding path program 1 times [2019-12-07 17:07:24,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:24,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195472965] [2019-12-07 17:07:24,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:24,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195472965] [2019-12-07 17:07:24,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:24,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:24,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454185577] [2019-12-07 17:07:24,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:24,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:24,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:24,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:24,101 INFO L87 Difference]: Start difference. First operand 240 states and 373 transitions. Second operand 4 states. [2019-12-07 17:07:24,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:24,378 INFO L93 Difference]: Finished difference Result 519 states and 807 transitions. [2019-12-07 17:07:24,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:24,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:07:24,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:24,379 INFO L225 Difference]: With dead ends: 519 [2019-12-07 17:07:24,379 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 17:07:24,380 INFO L630 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 [2019-12-07 17:07:24,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 17:07:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 240. [2019-12-07 17:07:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-12-07 17:07:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 372 transitions. [2019-12-07 17:07:24,383 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 372 transitions. Word has length 96 [2019-12-07 17:07:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:24,383 INFO L462 AbstractCegarLoop]: Abstraction has 240 states and 372 transitions. [2019-12-07 17:07:24,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 372 transitions. [2019-12-07 17:07:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:24,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:24,384 INFO L410 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] [2019-12-07 17:07:24,384 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:24,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:24,384 INFO L82 PathProgramCache]: Analyzing trace with hash 140064800, now seen corresponding path program 1 times [2019-12-07 17:07:24,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:24,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851025602] [2019-12-07 17:07:24,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:07:24,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851025602] [2019-12-07 17:07:24,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:24,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:07:24,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908457982] [2019-12-07 17:07:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:07:24,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:07:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:07:24,424 INFO L87 Difference]: Start difference. First operand 240 states and 372 transitions. Second operand 5 states. [2019-12-07 17:07:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:24,731 INFO L93 Difference]: Finished difference Result 482 states and 752 transitions. [2019-12-07 17:07:24,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:07:24,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-07 17:07:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:24,732 INFO L225 Difference]: With dead ends: 482 [2019-12-07 17:07:24,732 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 17:07:24,733 INFO L630 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 [2019-12-07 17:07:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 17:07:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-12-07 17:07:24,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 398 transitions. [2019-12-07 17:07:24,737 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 398 transitions. Word has length 96 [2019-12-07 17:07:24,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:24,737 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 398 transitions. [2019-12-07 17:07:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:07:24,737 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 398 transitions. [2019-12-07 17:07:24,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:24,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:24,737 INFO L410 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] [2019-12-07 17:07:24,738 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:24,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:24,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1328486855, now seen corresponding path program 1 times [2019-12-07 17:07:24,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:24,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334630399] [2019-12-07 17:07:24,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:24,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334630399] [2019-12-07 17:07:24,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:24,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:24,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429662936] [2019-12-07 17:07:24,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:24,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:24,774 INFO L87 Difference]: Start difference. First operand 260 states and 398 transitions. Second operand 4 states. [2019-12-07 17:07:25,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:25,001 INFO L93 Difference]: Finished difference Result 524 states and 804 transitions. [2019-12-07 17:07:25,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:25,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:07:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:25,003 INFO L225 Difference]: With dead ends: 524 [2019-12-07 17:07:25,003 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 17:07:25,003 INFO L630 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 [2019-12-07 17:07:25,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 17:07:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 260. [2019-12-07 17:07:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 397 transitions. [2019-12-07 17:07:25,008 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 397 transitions. Word has length 96 [2019-12-07 17:07:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:25,008 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 397 transitions. [2019-12-07 17:07:25,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 397 transitions. [2019-12-07 17:07:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:07:25,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:25,009 INFO L410 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] [2019-12-07 17:07:25,009 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash 674733433, now seen corresponding path program 1 times [2019-12-07 17:07:25,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:25,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115822131] [2019-12-07 17:07:25,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:25,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115822131] [2019-12-07 17:07:25,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:25,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:25,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574861442] [2019-12-07 17:07:25,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:25,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:25,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:25,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:25,043 INFO L87 Difference]: Start difference. First operand 260 states and 397 transitions. Second operand 4 states. [2019-12-07 17:07:25,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:25,253 INFO L93 Difference]: Finished difference Result 523 states and 801 transitions. [2019-12-07 17:07:25,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:25,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:07:25,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:25,255 INFO L225 Difference]: With dead ends: 523 [2019-12-07 17:07:25,255 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 17:07:25,255 INFO L630 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 [2019-12-07 17:07:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 17:07:25,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-12-07 17:07:25,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 396 transitions. [2019-12-07 17:07:25,261 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 396 transitions. Word has length 96 [2019-12-07 17:07:25,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:25,261 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 396 transitions. [2019-12-07 17:07:25,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:25,261 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 396 transitions. [2019-12-07 17:07:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:07:25,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:25,262 INFO L410 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] [2019-12-07 17:07:25,262 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:25,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash -232829186, now seen corresponding path program 1 times [2019-12-07 17:07:25,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:25,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326866859] [2019-12-07 17:07:25,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:25,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326866859] [2019-12-07 17:07:25,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:25,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:25,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405011882] [2019-12-07 17:07:25,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:25,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:25,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:25,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:25,302 INFO L87 Difference]: Start difference. First operand 260 states and 396 transitions. Second operand 4 states. [2019-12-07 17:07:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:25,575 INFO L93 Difference]: Finished difference Result 559 states and 852 transitions. [2019-12-07 17:07:25,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:25,576 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:07:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:25,577 INFO L225 Difference]: With dead ends: 559 [2019-12-07 17:07:25,577 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 17:07:25,578 INFO L630 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 [2019-12-07 17:07:25,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 17:07:25,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-12-07 17:07:25,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 395 transitions. [2019-12-07 17:07:25,583 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 395 transitions. Word has length 97 [2019-12-07 17:07:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:25,583 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 395 transitions. [2019-12-07 17:07:25,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 395 transitions. [2019-12-07 17:07:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:07:25,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:25,584 INFO L410 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] [2019-12-07 17:07:25,584 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -192154436, now seen corresponding path program 1 times [2019-12-07 17:07:25,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:25,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193720963] [2019-12-07 17:07:25,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:25,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193720963] [2019-12-07 17:07:25,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:25,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:25,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164627133] [2019-12-07 17:07:25,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:25,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:25,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:25,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:25,626 INFO L87 Difference]: Start difference. First operand 260 states and 395 transitions. Second operand 4 states. [2019-12-07 17:07:25,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:25,847 INFO L93 Difference]: Finished difference Result 523 states and 797 transitions. [2019-12-07 17:07:25,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:25,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:07:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:25,849 INFO L225 Difference]: With dead ends: 523 [2019-12-07 17:07:25,849 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 17:07:25,849 INFO L630 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 [2019-12-07 17:07:25,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 17:07:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-12-07 17:07:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 394 transitions. [2019-12-07 17:07:25,861 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 394 transitions. Word has length 97 [2019-12-07 17:07:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:25,861 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 394 transitions. [2019-12-07 17:07:25,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:25,861 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 394 transitions. [2019-12-07 17:07:25,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:07:25,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:25,862 INFO L410 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] [2019-12-07 17:07:25,862 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2034051891, now seen corresponding path program 1 times [2019-12-07 17:07:25,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:25,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949946305] [2019-12-07 17:07:25,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:25,893 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:25,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949946305] [2019-12-07 17:07:25,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:25,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:25,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397933325] [2019-12-07 17:07:25,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:25,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:25,894 INFO L87 Difference]: Start difference. First operand 260 states and 394 transitions. Second operand 4 states. [2019-12-07 17:07:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:26,159 INFO L93 Difference]: Finished difference Result 559 states and 848 transitions. [2019-12-07 17:07:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:26,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:07:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:26,160 INFO L225 Difference]: With dead ends: 559 [2019-12-07 17:07:26,160 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 17:07:26,161 INFO L630 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 [2019-12-07 17:07:26,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 17:07:26,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-12-07 17:07:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:26,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 393 transitions. [2019-12-07 17:07:26,165 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 393 transitions. Word has length 98 [2019-12-07 17:07:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:26,165 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 393 transitions. [2019-12-07 17:07:26,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:26,165 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 393 transitions. [2019-12-07 17:07:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:07:26,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:26,166 INFO L410 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] [2019-12-07 17:07:26,166 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:26,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:26,166 INFO L82 PathProgramCache]: Analyzing trace with hash -999998155, now seen corresponding path program 1 times [2019-12-07 17:07:26,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:26,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271252101] [2019-12-07 17:07:26,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:26,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271252101] [2019-12-07 17:07:26,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:26,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:26,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045901226] [2019-12-07 17:07:26,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:26,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:26,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:26,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:26,197 INFO L87 Difference]: Start difference. First operand 260 states and 393 transitions. Second operand 4 states. [2019-12-07 17:07:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:26,408 INFO L93 Difference]: Finished difference Result 523 states and 793 transitions. [2019-12-07 17:07:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:26,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:07:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:26,410 INFO L225 Difference]: With dead ends: 523 [2019-12-07 17:07:26,410 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 17:07:26,410 INFO L630 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 [2019-12-07 17:07:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 17:07:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-12-07 17:07:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 392 transitions. [2019-12-07 17:07:26,414 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 392 transitions. Word has length 98 [2019-12-07 17:07:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:26,415 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 392 transitions. [2019-12-07 17:07:26,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 392 transitions. [2019-12-07 17:07:26,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:07:26,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:26,415 INFO L410 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] [2019-12-07 17:07:26,415 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:26,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:26,416 INFO L82 PathProgramCache]: Analyzing trace with hash -154140935, now seen corresponding path program 1 times [2019-12-07 17:07:26,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:26,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101156787] [2019-12-07 17:07:26,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:26,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101156787] [2019-12-07 17:07:26,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:26,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:26,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085337049] [2019-12-07 17:07:26,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:26,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:26,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:26,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:26,448 INFO L87 Difference]: Start difference. First operand 260 states and 392 transitions. Second operand 4 states. [2019-12-07 17:07:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:26,733 INFO L93 Difference]: Finished difference Result 559 states and 844 transitions. [2019-12-07 17:07:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:26,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 17:07:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:26,734 INFO L225 Difference]: With dead ends: 559 [2019-12-07 17:07:26,734 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 17:07:26,735 INFO L630 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 [2019-12-07 17:07:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 17:07:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 260. [2019-12-07 17:07:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 391 transitions. [2019-12-07 17:07:26,739 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 391 transitions. Word has length 99 [2019-12-07 17:07:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:26,739 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 391 transitions. [2019-12-07 17:07:26,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 391 transitions. [2019-12-07 17:07:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:07:26,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:26,740 INFO L410 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] [2019-12-07 17:07:26,740 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:26,740 INFO L82 PathProgramCache]: Analyzing trace with hash 279588151, now seen corresponding path program 1 times [2019-12-07 17:07:26,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:26,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045297454] [2019-12-07 17:07:26,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:26,770 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:26,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045297454] [2019-12-07 17:07:26,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:26,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:26,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015108960] [2019-12-07 17:07:26,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:26,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:26,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:26,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:26,771 INFO L87 Difference]: Start difference. First operand 260 states and 391 transitions. Second operand 4 states. [2019-12-07 17:07:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:26,978 INFO L93 Difference]: Finished difference Result 523 states and 789 transitions. [2019-12-07 17:07:26,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:26,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 17:07:26,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:26,980 INFO L225 Difference]: With dead ends: 523 [2019-12-07 17:07:26,980 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 17:07:26,980 INFO L630 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 [2019-12-07 17:07:26,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 17:07:26,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 260. [2019-12-07 17:07:26,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:26,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 390 transitions. [2019-12-07 17:07:26,985 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 390 transitions. Word has length 99 [2019-12-07 17:07:26,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:26,985 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 390 transitions. [2019-12-07 17:07:26,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 390 transitions. [2019-12-07 17:07:26,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:07:26,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:26,986 INFO L410 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] [2019-12-07 17:07:26,986 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:26,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:26,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1284296014, now seen corresponding path program 1 times [2019-12-07 17:07:26,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:26,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359330124] [2019-12-07 17:07:26,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:27,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359330124] [2019-12-07 17:07:27,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:27,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:27,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352449384] [2019-12-07 17:07:27,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:27,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:27,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:27,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:27,019 INFO L87 Difference]: Start difference. First operand 260 states and 390 transitions. Second operand 4 states. [2019-12-07 17:07:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:27,277 INFO L93 Difference]: Finished difference Result 549 states and 828 transitions. [2019-12-07 17:07:27,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:27,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 17:07:27,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:27,279 INFO L225 Difference]: With dead ends: 549 [2019-12-07 17:07:27,279 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 17:07:27,279 INFO L630 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 [2019-12-07 17:07:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 17:07:27,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-12-07 17:07:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 389 transitions. [2019-12-07 17:07:27,285 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 389 transitions. Word has length 100 [2019-12-07 17:07:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:27,286 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 389 transitions. [2019-12-07 17:07:27,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 389 transitions. [2019-12-07 17:07:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:07:27,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:27,287 INFO L410 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] [2019-12-07 17:07:27,287 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:27,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1844995792, now seen corresponding path program 1 times [2019-12-07 17:07:27,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:27,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372242558] [2019-12-07 17:07:27,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:27,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372242558] [2019-12-07 17:07:27,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:27,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:27,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212708593] [2019-12-07 17:07:27,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:27,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:27,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:27,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:27,323 INFO L87 Difference]: Start difference. First operand 260 states and 389 transitions. Second operand 4 states. [2019-12-07 17:07:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:27,534 INFO L93 Difference]: Finished difference Result 513 states and 773 transitions. [2019-12-07 17:07:27,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:27,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 17:07:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:27,536 INFO L225 Difference]: With dead ends: 513 [2019-12-07 17:07:27,536 INFO L226 Difference]: Without dead ends: 272 [2019-12-07 17:07:27,536 INFO L630 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 [2019-12-07 17:07:27,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-12-07 17:07:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 260. [2019-12-07 17:07:27,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 388 transitions. [2019-12-07 17:07:27,541 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 388 transitions. Word has length 100 [2019-12-07 17:07:27,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:27,541 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 388 transitions. [2019-12-07 17:07:27,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 388 transitions. [2019-12-07 17:07:27,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:07:27,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:27,542 INFO L410 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] [2019-12-07 17:07:27,542 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1320897196, now seen corresponding path program 1 times [2019-12-07 17:07:27,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46635545] [2019-12-07 17:07:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:27,581 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:07:27,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46635545] [2019-12-07 17:07:27,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:27,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:27,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539142617] [2019-12-07 17:07:27,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:27,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:27,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:27,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:27,583 INFO L87 Difference]: Start difference. First operand 260 states and 388 transitions. Second operand 4 states. [2019-12-07 17:07:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:27,890 INFO L93 Difference]: Finished difference Result 549 states and 824 transitions. [2019-12-07 17:07:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:27,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 17:07:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:27,891 INFO L225 Difference]: With dead ends: 549 [2019-12-07 17:07:27,891 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 17:07:27,892 INFO L630 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 [2019-12-07 17:07:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 17:07:27,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 260. [2019-12-07 17:07:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-12-07 17:07:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 387 transitions. [2019-12-07 17:07:27,897 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 387 transitions. Word has length 104 [2019-12-07 17:07:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:27,897 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 387 transitions. [2019-12-07 17:07:27,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 387 transitions. [2019-12-07 17:07:27,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:07:27,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:27,898 INFO L410 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] [2019-12-07 17:07:27,899 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1738293802, now seen corresponding path program 1 times [2019-12-07 17:07:27,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:27,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644329990] [2019-12-07 17:07:27,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-12-07 17:07:27,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644329990] [2019-12-07 17:07:27,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:27,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:27,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066832350] [2019-12-07 17:07:27,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:27,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:27,932 INFO L87 Difference]: Start difference. First operand 260 states and 387 transitions. Second operand 3 states. [2019-12-07 17:07:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:27,985 INFO L93 Difference]: Finished difference Result 740 states and 1116 transitions. [2019-12-07 17:07:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:27,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 17:07:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:27,988 INFO L225 Difference]: With dead ends: 740 [2019-12-07 17:07:27,988 INFO L226 Difference]: Without dead ends: 499 [2019-12-07 17:07:27,988 INFO L630 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 [2019-12-07 17:07:27,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-12-07 17:07:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2019-12-07 17:07:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2019-12-07 17:07:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 738 transitions. [2019-12-07 17:07:27,995 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 738 transitions. Word has length 104 [2019-12-07 17:07:27,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:27,996 INFO L462 AbstractCegarLoop]: Abstraction has 499 states and 738 transitions. [2019-12-07 17:07:27,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:27,996 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 738 transitions. [2019-12-07 17:07:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 17:07:27,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:27,997 INFO L410 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] [2019-12-07 17:07:27,997 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:27,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:27,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1062546720, now seen corresponding path program 1 times [2019-12-07 17:07:27,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984792106] [2019-12-07 17:07:27,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:07:28,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984792106] [2019-12-07 17:07:28,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:28,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:28,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312791611] [2019-12-07 17:07:28,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:28,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:28,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:28,031 INFO L87 Difference]: Start difference. First operand 499 states and 738 transitions. Second operand 3 states. [2019-12-07 17:07:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:28,089 INFO L93 Difference]: Finished difference Result 1218 states and 1818 transitions. [2019-12-07 17:07:28,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:28,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-12-07 17:07:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:28,093 INFO L225 Difference]: With dead ends: 1218 [2019-12-07 17:07:28,093 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 17:07:28,094 INFO L630 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 [2019-12-07 17:07:28,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 17:07:28,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2019-12-07 17:07:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-12-07 17:07:28,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1090 transitions. [2019-12-07 17:07:28,108 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1090 transitions. Word has length 106 [2019-12-07 17:07:28,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:28,109 INFO L462 AbstractCegarLoop]: Abstraction has 738 states and 1090 transitions. [2019-12-07 17:07:28,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:28,109 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1090 transitions. [2019-12-07 17:07:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 17:07:28,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:28,110 INFO L410 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] [2019-12-07 17:07:28,111 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:28,111 INFO L82 PathProgramCache]: Analyzing trace with hash 915253032, now seen corresponding path program 1 times [2019-12-07 17:07:28,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:28,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123854819] [2019-12-07 17:07:28,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:28,167 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:28,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123854819] [2019-12-07 17:07:28,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:28,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:28,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079507163] [2019-12-07 17:07:28,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:28,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:28,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:28,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:28,169 INFO L87 Difference]: Start difference. First operand 738 states and 1090 transitions. Second operand 4 states. [2019-12-07 17:07:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:28,454 INFO L93 Difference]: Finished difference Result 1646 states and 2452 transitions. [2019-12-07 17:07:28,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:28,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 17:07:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:28,459 INFO L225 Difference]: With dead ends: 1646 [2019-12-07 17:07:28,459 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 17:07:28,460 INFO L630 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 [2019-12-07 17:07:28,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 17:07:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 822. [2019-12-07 17:07:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:28,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1237 transitions. [2019-12-07 17:07:28,479 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1237 transitions. Word has length 135 [2019-12-07 17:07:28,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:28,479 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1237 transitions. [2019-12-07 17:07:28,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:28,480 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1237 transitions. [2019-12-07 17:07:28,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:07:28,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:28,481 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 17:07:28,482 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:28,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:28,482 INFO L82 PathProgramCache]: Analyzing trace with hash 518604743, now seen corresponding path program 1 times [2019-12-07 17:07:28,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:28,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656634601] [2019-12-07 17:07:28,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:28,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:28,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656634601] [2019-12-07 17:07:28,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:28,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:28,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899458205] [2019-12-07 17:07:28,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:28,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:28,530 INFO L87 Difference]: Start difference. First operand 822 states and 1237 transitions. Second operand 4 states. [2019-12-07 17:07:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:28,828 INFO L93 Difference]: Finished difference Result 1730 states and 2596 transitions. [2019-12-07 17:07:28,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:28,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 17:07:28,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:28,832 INFO L225 Difference]: With dead ends: 1730 [2019-12-07 17:07:28,832 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 17:07:28,833 INFO L630 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 [2019-12-07 17:07:28,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 17:07:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 822. [2019-12-07 17:07:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:28,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1234 transitions. [2019-12-07 17:07:28,846 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1234 transitions. Word has length 148 [2019-12-07 17:07:28,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:28,846 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1234 transitions. [2019-12-07 17:07:28,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1234 transitions. [2019-12-07 17:07:28,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 17:07:28,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:28,847 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 17:07:28,847 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:28,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:28,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1697825810, now seen corresponding path program 1 times [2019-12-07 17:07:28,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:28,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863600814] [2019-12-07 17:07:28,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:28,891 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:28,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863600814] [2019-12-07 17:07:28,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:28,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:28,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442697991] [2019-12-07 17:07:28,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:28,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:28,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:28,892 INFO L87 Difference]: Start difference. First operand 822 states and 1234 transitions. Second operand 4 states. [2019-12-07 17:07:29,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:29,163 INFO L93 Difference]: Finished difference Result 1724 states and 2584 transitions. [2019-12-07 17:07:29,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:29,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 17:07:29,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:29,166 INFO L225 Difference]: With dead ends: 1724 [2019-12-07 17:07:29,166 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:07:29,167 INFO L630 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 [2019-12-07 17:07:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:07:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 822. [2019-12-07 17:07:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:29,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1231 transitions. [2019-12-07 17:07:29,180 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1231 transitions. Word has length 149 [2019-12-07 17:07:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:29,180 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1231 transitions. [2019-12-07 17:07:29,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1231 transitions. [2019-12-07 17:07:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 17:07:29,181 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:29,181 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 17:07:29,181 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:29,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:29,182 INFO L82 PathProgramCache]: Analyzing trace with hash -593921198, now seen corresponding path program 1 times [2019-12-07 17:07:29,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:29,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898759584] [2019-12-07 17:07:29,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:29,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898759584] [2019-12-07 17:07:29,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:29,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:29,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476790501] [2019-12-07 17:07:29,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:29,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:29,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:29,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:29,223 INFO L87 Difference]: Start difference. First operand 822 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:07:29,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:29,482 INFO L93 Difference]: Finished difference Result 1721 states and 2575 transitions. [2019-12-07 17:07:29,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:29,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 17:07:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:29,486 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:07:29,486 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 17:07:29,487 INFO L630 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 [2019-12-07 17:07:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 17:07:29,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-12-07 17:07:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1228 transitions. [2019-12-07 17:07:29,498 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1228 transitions. Word has length 149 [2019-12-07 17:07:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:29,498 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1228 transitions. [2019-12-07 17:07:29,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1228 transitions. [2019-12-07 17:07:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:07:29,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:29,500 INFO L410 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] [2019-12-07 17:07:29,500 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash -865742333, now seen corresponding path program 1 times [2019-12-07 17:07:29,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:29,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838893923] [2019-12-07 17:07:29,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:29,539 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:29,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838893923] [2019-12-07 17:07:29,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:29,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:29,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655604075] [2019-12-07 17:07:29,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:29,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:29,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:29,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:29,540 INFO L87 Difference]: Start difference. First operand 822 states and 1228 transitions. Second operand 4 states. [2019-12-07 17:07:29,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:29,776 INFO L93 Difference]: Finished difference Result 1721 states and 2569 transitions. [2019-12-07 17:07:29,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:29,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:07:29,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:29,780 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:07:29,780 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 17:07:29,781 INFO L630 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 [2019-12-07 17:07:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 17:07:29,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-12-07 17:07:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1225 transitions. [2019-12-07 17:07:29,792 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1225 transitions. Word has length 150 [2019-12-07 17:07:29,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:29,792 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1225 transitions. [2019-12-07 17:07:29,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:29,793 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1225 transitions. [2019-12-07 17:07:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:07:29,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:29,794 INFO L410 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] [2019-12-07 17:07:29,794 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:29,794 INFO L82 PathProgramCache]: Analyzing trace with hash -406386482, now seen corresponding path program 1 times [2019-12-07 17:07:29,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:29,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646213776] [2019-12-07 17:07:29,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:29,835 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:29,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646213776] [2019-12-07 17:07:29,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:29,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:29,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153985612] [2019-12-07 17:07:29,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:29,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:29,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:29,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:29,836 INFO L87 Difference]: Start difference. First operand 822 states and 1225 transitions. Second operand 4 states. [2019-12-07 17:07:30,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:30,126 INFO L93 Difference]: Finished difference Result 1721 states and 2563 transitions. [2019-12-07 17:07:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:30,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 17:07:30,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:30,130 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:07:30,130 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 17:07:30,131 INFO L630 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 [2019-12-07 17:07:30,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 17:07:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-12-07 17:07:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:30,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1222 transitions. [2019-12-07 17:07:30,142 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1222 transitions. Word has length 151 [2019-12-07 17:07:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:30,142 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1222 transitions. [2019-12-07 17:07:30,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:30,142 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1222 transitions. [2019-12-07 17:07:30,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 17:07:30,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:30,143 INFO L410 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] [2019-12-07 17:07:30,143 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:30,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:30,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1501680830, now seen corresponding path program 1 times [2019-12-07 17:07:30,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:30,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492459237] [2019-12-07 17:07:30,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:30,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492459237] [2019-12-07 17:07:30,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:30,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:30,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035580225] [2019-12-07 17:07:30,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:30,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:30,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:30,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:30,184 INFO L87 Difference]: Start difference. First operand 822 states and 1222 transitions. Second operand 4 states. [2019-12-07 17:07:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:30,443 INFO L93 Difference]: Finished difference Result 1721 states and 2557 transitions. [2019-12-07 17:07:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:30,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 17:07:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:30,447 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:07:30,447 INFO L226 Difference]: Without dead ends: 918 [2019-12-07 17:07:30,447 INFO L630 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 [2019-12-07 17:07:30,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-12-07 17:07:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 822. [2019-12-07 17:07:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:30,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1219 transitions. [2019-12-07 17:07:30,459 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1219 transitions. Word has length 152 [2019-12-07 17:07:30,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:30,459 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1219 transitions. [2019-12-07 17:07:30,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:30,459 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1219 transitions. [2019-12-07 17:07:30,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:07:30,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:30,461 INFO L410 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] [2019-12-07 17:07:30,461 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:30,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:30,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1075163177, now seen corresponding path program 1 times [2019-12-07 17:07:30,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:30,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942132416] [2019-12-07 17:07:30,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:30,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942132416] [2019-12-07 17:07:30,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:30,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:30,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779433890] [2019-12-07 17:07:30,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:30,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:30,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:30,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:30,504 INFO L87 Difference]: Start difference. First operand 822 states and 1219 transitions. Second operand 4 states. [2019-12-07 17:07:30,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:30,739 INFO L93 Difference]: Finished difference Result 1691 states and 2515 transitions. [2019-12-07 17:07:30,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:30,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 17:07:30,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:30,742 INFO L225 Difference]: With dead ends: 1691 [2019-12-07 17:07:30,742 INFO L226 Difference]: Without dead ends: 888 [2019-12-07 17:07:30,743 INFO L630 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 [2019-12-07 17:07:30,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-12-07 17:07:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 822. [2019-12-07 17:07:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1216 transitions. [2019-12-07 17:07:30,755 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1216 transitions. Word has length 153 [2019-12-07 17:07:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:30,755 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1216 transitions. [2019-12-07 17:07:30,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1216 transitions. [2019-12-07 17:07:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 17:07:30,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:30,757 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:30,757 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:30,757 INFO L82 PathProgramCache]: Analyzing trace with hash 496677551, now seen corresponding path program 1 times [2019-12-07 17:07:30,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:30,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656922301] [2019-12-07 17:07:30,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:30,816 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:30,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656922301] [2019-12-07 17:07:30,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:30,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:30,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101432209] [2019-12-07 17:07:30,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:30,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:30,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:30,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:30,817 INFO L87 Difference]: Start difference. First operand 822 states and 1216 transitions. Second operand 4 states. [2019-12-07 17:07:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:31,062 INFO L93 Difference]: Finished difference Result 1691 states and 2509 transitions. [2019-12-07 17:07:31,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:31,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 17:07:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:31,065 INFO L225 Difference]: With dead ends: 1691 [2019-12-07 17:07:31,066 INFO L226 Difference]: Without dead ends: 888 [2019-12-07 17:07:31,066 INFO L630 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 [2019-12-07 17:07:31,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-12-07 17:07:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 822. [2019-12-07 17:07:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1213 transitions. [2019-12-07 17:07:31,081 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1213 transitions. Word has length 157 [2019-12-07 17:07:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:31,082 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1213 transitions. [2019-12-07 17:07:31,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1213 transitions. [2019-12-07 17:07:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:07:31,083 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:31,083 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 17:07:31,083 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:31,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 225955140, now seen corresponding path program 1 times [2019-12-07 17:07:31,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:31,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193999888] [2019-12-07 17:07:31,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:31,139 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:07:31,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193999888] [2019-12-07 17:07:31,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:31,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:31,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138929202] [2019-12-07 17:07:31,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:31,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:31,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:31,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:31,140 INFO L87 Difference]: Start difference. First operand 822 states and 1213 transitions. Second operand 4 states. [2019-12-07 17:07:31,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:31,366 INFO L93 Difference]: Finished difference Result 1676 states and 2482 transitions. [2019-12-07 17:07:31,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:31,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 17:07:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:31,369 INFO L225 Difference]: With dead ends: 1676 [2019-12-07 17:07:31,369 INFO L226 Difference]: Without dead ends: 873 [2019-12-07 17:07:31,370 INFO L630 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 [2019-12-07 17:07:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2019-12-07 17:07:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 822. [2019-12-07 17:07:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2019-12-07 17:07:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1210 transitions. [2019-12-07 17:07:31,382 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1210 transitions. Word has length 158 [2019-12-07 17:07:31,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:31,382 INFO L462 AbstractCegarLoop]: Abstraction has 822 states and 1210 transitions. [2019-12-07 17:07:31,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1210 transitions. [2019-12-07 17:07:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:07:31,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:31,383 INFO L410 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] [2019-12-07 17:07:31,383 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:31,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1486337636, now seen corresponding path program 1 times [2019-12-07 17:07:31,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:31,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278491163] [2019-12-07 17:07:31,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:07:31,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278491163] [2019-12-07 17:07:31,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:31,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:31,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562968359] [2019-12-07 17:07:31,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:31,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:31,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:31,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:31,432 INFO L87 Difference]: Start difference. First operand 822 states and 1210 transitions. Second operand 4 states. [2019-12-07 17:07:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:31,704 INFO L93 Difference]: Finished difference Result 1826 states and 2710 transitions. [2019-12-07 17:07:31,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:31,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 17:07:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:31,708 INFO L225 Difference]: With dead ends: 1826 [2019-12-07 17:07:31,708 INFO L226 Difference]: Without dead ends: 1023 [2019-12-07 17:07:31,709 INFO L630 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 [2019-12-07 17:07:31,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-12-07 17:07:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 912. [2019-12-07 17:07:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 912 states. [2019-12-07 17:07:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1369 transitions. [2019-12-07 17:07:31,722 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1369 transitions. Word has length 160 [2019-12-07 17:07:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:31,722 INFO L462 AbstractCegarLoop]: Abstraction has 912 states and 1369 transitions. [2019-12-07 17:07:31,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1369 transitions. [2019-12-07 17:07:31,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 17:07:31,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:31,723 INFO L410 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] [2019-12-07 17:07:31,723 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1561643199, now seen corresponding path program 1 times [2019-12-07 17:07:31,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:31,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501123601] [2019-12-07 17:07:31,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:31,775 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:07:31,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501123601] [2019-12-07 17:07:31,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:31,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:31,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575200587] [2019-12-07 17:07:31,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:31,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:31,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:31,776 INFO L87 Difference]: Start difference. First operand 912 states and 1369 transitions. Second operand 3 states. [2019-12-07 17:07:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:31,824 INFO L93 Difference]: Finished difference Result 2102 states and 3173 transitions. [2019-12-07 17:07:31,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:31,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 17:07:31,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:31,829 INFO L225 Difference]: With dead ends: 2102 [2019-12-07 17:07:31,830 INFO L226 Difference]: Without dead ends: 1209 [2019-12-07 17:07:31,831 INFO L630 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 [2019-12-07 17:07:31,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-12-07 17:07:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2019-12-07 17:07:31,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-12-07 17:07:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1816 transitions. [2019-12-07 17:07:31,849 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1816 transitions. Word has length 166 [2019-12-07 17:07:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:31,849 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1816 transitions. [2019-12-07 17:07:31,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:31,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1816 transitions. [2019-12-07 17:07:31,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 17:07:31,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:31,851 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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] [2019-12-07 17:07:31,851 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:31,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1154466172, now seen corresponding path program 1 times [2019-12-07 17:07:31,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:31,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615757867] [2019-12-07 17:07:31,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 17:07:31,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615757867] [2019-12-07 17:07:31,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:31,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:31,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880766605] [2019-12-07 17:07:31,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:31,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:31,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:31,903 INFO L87 Difference]: Start difference. First operand 1209 states and 1816 transitions. Second operand 4 states. [2019-12-07 17:07:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:32,143 INFO L93 Difference]: Finished difference Result 2467 states and 3714 transitions. [2019-12-07 17:07:32,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:32,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-12-07 17:07:32,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:32,148 INFO L225 Difference]: With dead ends: 2467 [2019-12-07 17:07:32,148 INFO L226 Difference]: Without dead ends: 1277 [2019-12-07 17:07:32,149 INFO L630 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 [2019-12-07 17:07:32,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2019-12-07 17:07:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1209. [2019-12-07 17:07:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-12-07 17:07:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1812 transitions. [2019-12-07 17:07:32,165 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1812 transitions. Word has length 189 [2019-12-07 17:07:32,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:32,166 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1812 transitions. [2019-12-07 17:07:32,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:32,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1812 transitions. [2019-12-07 17:07:32,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 17:07:32,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:32,167 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 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] [2019-12-07 17:07:32,167 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:32,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash -774173575, now seen corresponding path program 1 times [2019-12-07 17:07:32,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:32,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219244211] [2019-12-07 17:07:32,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 17:07:32,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219244211] [2019-12-07 17:07:32,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:32,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:32,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602027824] [2019-12-07 17:07:32,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:32,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:32,218 INFO L87 Difference]: Start difference. First operand 1209 states and 1812 transitions. Second operand 4 states. [2019-12-07 17:07:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:32,466 INFO L93 Difference]: Finished difference Result 2451 states and 3682 transitions. [2019-12-07 17:07:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:32,467 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-12-07 17:07:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:32,471 INFO L225 Difference]: With dead ends: 2451 [2019-12-07 17:07:32,471 INFO L226 Difference]: Without dead ends: 1261 [2019-12-07 17:07:32,472 INFO L630 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 [2019-12-07 17:07:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-12-07 17:07:32,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1209. [2019-12-07 17:07:32,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1209 states. [2019-12-07 17:07:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1808 transitions. [2019-12-07 17:07:32,490 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1808 transitions. Word has length 190 [2019-12-07 17:07:32,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:32,490 INFO L462 AbstractCegarLoop]: Abstraction has 1209 states and 1808 transitions. [2019-12-07 17:07:32,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1808 transitions. [2019-12-07 17:07:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-12-07 17:07:32,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:32,492 INFO L410 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:32,492 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash 2142683072, now seen corresponding path program 1 times [2019-12-07 17:07:32,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:32,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303443880] [2019-12-07 17:07:32,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:07:32,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303443880] [2019-12-07 17:07:32,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:32,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:32,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721706339] [2019-12-07 17:07:32,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:32,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:32,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:32,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:32,551 INFO L87 Difference]: Start difference. First operand 1209 states and 1808 transitions. Second operand 3 states. [2019-12-07 17:07:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:32,606 INFO L93 Difference]: Finished difference Result 2696 states and 4049 transitions. [2019-12-07 17:07:32,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:32,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-12-07 17:07:32,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:32,612 INFO L225 Difference]: With dead ends: 2696 [2019-12-07 17:07:32,612 INFO L226 Difference]: Without dead ends: 1506 [2019-12-07 17:07:32,613 INFO L630 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 [2019-12-07 17:07:32,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-12-07 17:07:32,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2019-12-07 17:07:32,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-12-07 17:07:32,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2254 transitions. [2019-12-07 17:07:32,634 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2254 transitions. Word has length 198 [2019-12-07 17:07:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:32,634 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 2254 transitions. [2019-12-07 17:07:32,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2254 transitions. [2019-12-07 17:07:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-12-07 17:07:32,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:32,636 INFO L410 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:32,636 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:32,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:32,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1472006410, now seen corresponding path program 1 times [2019-12-07 17:07:32,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:32,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143169345] [2019-12-07 17:07:32,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-12-07 17:07:32,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143169345] [2019-12-07 17:07:32,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:32,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:32,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565311544] [2019-12-07 17:07:32,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:32,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:32,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:32,689 INFO L87 Difference]: Start difference. First operand 1506 states and 2254 transitions. Second operand 3 states. [2019-12-07 17:07:32,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:32,757 INFO L93 Difference]: Finished difference Result 3290 states and 4941 transitions. [2019-12-07 17:07:32,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:32,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2019-12-07 17:07:32,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:32,761 INFO L225 Difference]: With dead ends: 3290 [2019-12-07 17:07:32,761 INFO L226 Difference]: Without dead ends: 1803 [2019-12-07 17:07:32,763 INFO L630 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 [2019-12-07 17:07:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2019-12-07 17:07:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1803. [2019-12-07 17:07:32,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1803 states. [2019-12-07 17:07:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2701 transitions. [2019-12-07 17:07:32,790 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2701 transitions. Word has length 200 [2019-12-07 17:07:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:32,790 INFO L462 AbstractCegarLoop]: Abstraction has 1803 states and 2701 transitions. [2019-12-07 17:07:32,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2701 transitions. [2019-12-07 17:07:32,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-12-07 17:07:32,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:32,793 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 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] [2019-12-07 17:07:32,793 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:32,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:32,793 INFO L82 PathProgramCache]: Analyzing trace with hash -976858043, now seen corresponding path program 1 times [2019-12-07 17:07:32,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:32,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179338991] [2019-12-07 17:07:32,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:32,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-12-07 17:07:32,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179338991] [2019-12-07 17:07:32,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:32,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:32,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984911125] [2019-12-07 17:07:32,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:32,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:32,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:32,861 INFO L87 Difference]: Start difference. First operand 1803 states and 2701 transitions. Second operand 3 states. [2019-12-07 17:07:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:32,919 INFO L93 Difference]: Finished difference Result 3884 states and 5835 transitions. [2019-12-07 17:07:32,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:32,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-12-07 17:07:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:32,922 INFO L225 Difference]: With dead ends: 3884 [2019-12-07 17:07:32,922 INFO L226 Difference]: Without dead ends: 2100 [2019-12-07 17:07:32,923 INFO L630 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 [2019-12-07 17:07:32,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-12-07 17:07:32,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-12-07 17:07:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-12-07 17:07:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 3149 transitions. [2019-12-07 17:07:32,954 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 3149 transitions. Word has length 233 [2019-12-07 17:07:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:32,954 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 3149 transitions. [2019-12-07 17:07:32,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 3149 transitions. [2019-12-07 17:07:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-12-07 17:07:32,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:32,957 INFO L410 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, 1, 1, 1] [2019-12-07 17:07:32,957 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1698622670, now seen corresponding path program 1 times [2019-12-07 17:07:32,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:32,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956856724] [2019-12-07 17:07:32,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:33,031 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-12-07 17:07:33,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956856724] [2019-12-07 17:07:33,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:33,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:33,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564085947] [2019-12-07 17:07:33,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:33,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:33,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:33,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:33,032 INFO L87 Difference]: Start difference. First operand 2100 states and 3149 transitions. Second operand 3 states. [2019-12-07 17:07:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:33,102 INFO L93 Difference]: Finished difference Result 4472 states and 6722 transitions. [2019-12-07 17:07:33,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:33,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-12-07 17:07:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:33,105 INFO L225 Difference]: With dead ends: 4472 [2019-12-07 17:07:33,106 INFO L226 Difference]: Without dead ends: 2391 [2019-12-07 17:07:33,107 INFO L630 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 [2019-12-07 17:07:33,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2019-12-07 17:07:33,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2391. [2019-12-07 17:07:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2391 states. [2019-12-07 17:07:33,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2391 states to 2391 states and 3581 transitions. [2019-12-07 17:07:33,145 INFO L78 Accepts]: Start accepts. Automaton has 2391 states and 3581 transitions. Word has length 268 [2019-12-07 17:07:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:33,146 INFO L462 AbstractCegarLoop]: Abstraction has 2391 states and 3581 transitions. [2019-12-07 17:07:33,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:33,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2391 states and 3581 transitions. [2019-12-07 17:07:33,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-12-07 17:07:33,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:33,150 INFO L410 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, 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] [2019-12-07 17:07:33,150 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:33,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:33,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1670879313, now seen corresponding path program 1 times [2019-12-07 17:07:33,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:33,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099789794] [2019-12-07 17:07:33,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-12-07 17:07:33,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099789794] [2019-12-07 17:07:33,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:33,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:33,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969651343] [2019-12-07 17:07:33,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:33,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:33,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:33,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:33,259 INFO L87 Difference]: Start difference. First operand 2391 states and 3581 transitions. Second operand 3 states. [2019-12-07 17:07:33,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:33,335 INFO L93 Difference]: Finished difference Result 5060 states and 7595 transitions. [2019-12-07 17:07:33,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:33,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-12-07 17:07:33,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:33,338 INFO L225 Difference]: With dead ends: 5060 [2019-12-07 17:07:33,338 INFO L226 Difference]: Without dead ends: 2688 [2019-12-07 17:07:33,340 INFO L630 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 [2019-12-07 17:07:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2019-12-07 17:07:33,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2688. [2019-12-07 17:07:33,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2688 states. [2019-12-07 17:07:33,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2688 states to 2688 states and 4031 transitions. [2019-12-07 17:07:33,377 INFO L78 Accepts]: Start accepts. Automaton has 2688 states and 4031 transitions. Word has length 307 [2019-12-07 17:07:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:33,377 INFO L462 AbstractCegarLoop]: Abstraction has 2688 states and 4031 transitions. [2019-12-07 17:07:33,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:33,378 INFO L276 IsEmpty]: Start isEmpty. Operand 2688 states and 4031 transitions. [2019-12-07 17:07:33,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-12-07 17:07:33,381 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:33,381 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:33,381 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:33,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:33,381 INFO L82 PathProgramCache]: Analyzing trace with hash -249132093, now seen corresponding path program 1 times [2019-12-07 17:07:33,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:33,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592016921] [2019-12-07 17:07:33,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1160 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-12-07 17:07:33,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592016921] [2019-12-07 17:07:33,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:33,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:33,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578882196] [2019-12-07 17:07:33,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:33,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:33,487 INFO L87 Difference]: Start difference. First operand 2688 states and 4031 transitions. Second operand 3 states. [2019-12-07 17:07:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:33,554 INFO L93 Difference]: Finished difference Result 5654 states and 8495 transitions. [2019-12-07 17:07:33,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:33,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-12-07 17:07:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:33,561 INFO L225 Difference]: With dead ends: 5654 [2019-12-07 17:07:33,561 INFO L226 Difference]: Without dead ends: 2985 [2019-12-07 17:07:33,563 INFO L630 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 [2019-12-07 17:07:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2985 states. [2019-12-07 17:07:33,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2985 to 2985. [2019-12-07 17:07:33,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2985 states. [2019-12-07 17:07:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4482 transitions. [2019-12-07 17:07:33,622 INFO L78 Accepts]: Start accepts. Automaton has 2985 states and 4482 transitions. Word has length 348 [2019-12-07 17:07:33,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:33,622 INFO L462 AbstractCegarLoop]: Abstraction has 2985 states and 4482 transitions. [2019-12-07 17:07:33,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 2985 states and 4482 transitions. [2019-12-07 17:07:33,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-12-07 17:07:33,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:33,626 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:33,626 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:33,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1147799121, now seen corresponding path program 1 times [2019-12-07 17:07:33,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:33,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141694696] [2019-12-07 17:07:33,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2019-12-07 17:07:33,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141694696] [2019-12-07 17:07:33,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:33,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:33,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585369190] [2019-12-07 17:07:33,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:33,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:33,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:33,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:33,766 INFO L87 Difference]: Start difference. First operand 2985 states and 4482 transitions. Second operand 3 states. [2019-12-07 17:07:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:33,853 INFO L93 Difference]: Finished difference Result 6243 states and 9390 transitions. [2019-12-07 17:07:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:33,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 391 [2019-12-07 17:07:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:33,858 INFO L225 Difference]: With dead ends: 6243 [2019-12-07 17:07:33,858 INFO L226 Difference]: Without dead ends: 3277 [2019-12-07 17:07:33,860 INFO L630 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 [2019-12-07 17:07:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2019-12-07 17:07:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 3277. [2019-12-07 17:07:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3277 states. [2019-12-07 17:07:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4915 transitions. [2019-12-07 17:07:33,907 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4915 transitions. Word has length 391 [2019-12-07 17:07:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:33,907 INFO L462 AbstractCegarLoop]: Abstraction has 3277 states and 4915 transitions. [2019-12-07 17:07:33,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4915 transitions. [2019-12-07 17:07:33,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-12-07 17:07:33,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:33,912 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:33,912 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:33,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:33,912 INFO L82 PathProgramCache]: Analyzing trace with hash -103706639, now seen corresponding path program 1 times [2019-12-07 17:07:33,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:33,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242909314] [2019-12-07 17:07:33,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 1445 trivial. 0 not checked. [2019-12-07 17:07:34,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242909314] [2019-12-07 17:07:34,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:34,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:34,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982460132] [2019-12-07 17:07:34,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:34,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:34,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:34,057 INFO L87 Difference]: Start difference. First operand 3277 states and 4915 transitions. Second operand 3 states. [2019-12-07 17:07:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:34,133 INFO L93 Difference]: Finished difference Result 6832 states and 10263 transitions. [2019-12-07 17:07:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:34,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 431 [2019-12-07 17:07:34,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:34,136 INFO L225 Difference]: With dead ends: 6832 [2019-12-07 17:07:34,136 INFO L226 Difference]: Without dead ends: 3574 [2019-12-07 17:07:34,138 INFO L630 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 [2019-12-07 17:07:34,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-12-07 17:07:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3574. [2019-12-07 17:07:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3574 states. [2019-12-07 17:07:34,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3574 states to 3574 states and 5368 transitions. [2019-12-07 17:07:34,187 INFO L78 Accepts]: Start accepts. Automaton has 3574 states and 5368 transitions. Word has length 431 [2019-12-07 17:07:34,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:34,188 INFO L462 AbstractCegarLoop]: Abstraction has 3574 states and 5368 transitions. [2019-12-07 17:07:34,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:34,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3574 states and 5368 transitions. [2019-12-07 17:07:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2019-12-07 17:07:34,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:34,192 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:34,193 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -877290857, now seen corresponding path program 1 times [2019-12-07 17:07:34,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:34,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416064287] [2019-12-07 17:07:34,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:34,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2130 backedges. 358 proven. 0 refuted. 0 times theorem prover too weak. 1772 trivial. 0 not checked. [2019-12-07 17:07:34,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416064287] [2019-12-07 17:07:34,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:34,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:34,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943482393] [2019-12-07 17:07:34,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:34,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:34,396 INFO L87 Difference]: Start difference. First operand 3574 states and 5368 transitions. Second operand 3 states. [2019-12-07 17:07:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:34,475 INFO L93 Difference]: Finished difference Result 3873 states and 5824 transitions. [2019-12-07 17:07:34,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:34,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 473 [2019-12-07 17:07:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:34,477 INFO L225 Difference]: With dead ends: 3873 [2019-12-07 17:07:34,478 INFO L226 Difference]: Without dead ends: 3871 [2019-12-07 17:07:34,478 INFO L630 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 [2019-12-07 17:07:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-07 17:07:34,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3871. [2019-12-07 17:07:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3871 states. [2019-12-07 17:07:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3871 states to 3871 states and 5822 transitions. [2019-12-07 17:07:34,544 INFO L78 Accepts]: Start accepts. Automaton has 3871 states and 5822 transitions. Word has length 473 [2019-12-07 17:07:34,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:34,544 INFO L462 AbstractCegarLoop]: Abstraction has 3871 states and 5822 transitions. [2019-12-07 17:07:34,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:34,545 INFO L276 IsEmpty]: Start isEmpty. Operand 3871 states and 5822 transitions. [2019-12-07 17:07:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:07:34,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:34,550 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:34,550 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:34,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1920823596, now seen corresponding path program 1 times [2019-12-07 17:07:34,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:34,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008117015] [2019-12-07 17:07:34,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:34,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-12-07 17:07:34,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008117015] [2019-12-07 17:07:34,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:34,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:34,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715541452] [2019-12-07 17:07:34,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:34,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:34,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:34,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:34,780 INFO L87 Difference]: Start difference. First operand 3871 states and 5822 transitions. Second operand 4 states. [2019-12-07 17:07:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:35,161 INFO L93 Difference]: Finished difference Result 9109 states and 13733 transitions. [2019-12-07 17:07:35,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:35,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 517 [2019-12-07 17:07:35,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:35,164 INFO L225 Difference]: With dead ends: 9109 [2019-12-07 17:07:35,165 INFO L226 Difference]: Without dead ends: 5257 [2019-12-07 17:07:35,167 INFO L630 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 [2019-12-07 17:07:35,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5257 states. [2019-12-07 17:07:35,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5257 to 4404. [2019-12-07 17:07:35,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-12-07 17:07:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 6797 transitions. [2019-12-07 17:07:35,228 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 6797 transitions. Word has length 517 [2019-12-07 17:07:35,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:35,229 INFO L462 AbstractCegarLoop]: Abstraction has 4404 states and 6797 transitions. [2019-12-07 17:07:35,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 6797 transitions. [2019-12-07 17:07:35,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:07:35,234 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:35,234 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:35,234 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:35,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:35,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1671368488, now seen corresponding path program 1 times [2019-12-07 17:07:35,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:35,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380912797] [2019-12-07 17:07:35,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:36,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1259 proven. 335 refuted. 0 times theorem prover too weak. 934 trivial. 0 not checked. [2019-12-07 17:07:36,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380912797] [2019-12-07 17:07:36,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538590854] [2019-12-07 17:07:36,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:07:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:36,559 INFO L264 TraceCheckSpWp]: Trace formula consists of 1704 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-07 17:07:36,579 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:07:36,641 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,641 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:07:36,642 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,668 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,670 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_164|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 17:07:36,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:07:36,704 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:36,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:07:36,741 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,757 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,783 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:07:36,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:07:36,784 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,795 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:07:36,846 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:07:36,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:07:36,847 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,852 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,852 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:07:36,880 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:07:36,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:07:36,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,887 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,888 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:07:36,891 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-12-07 17:07:36,894 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:36,905 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,938 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:07:36,938 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:07:36,938 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,946 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:07:36,976 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:07:36,976 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:07:36,976 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:36,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:36,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:07:37,005 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:07:37,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:07:37,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,011 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:07:37,017 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 12=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 17:07:37,019 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,029 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,063 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:07:37,063 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:07:37,064 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,070 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,071 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,071 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:07:37,075 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 12=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 17:07:37,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:07:37,077 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,154 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:07:37,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:07:37,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:07:37,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:07:37,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:07:37,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:07:37,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,183 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 17:07:37,257 INFO L614 ElimStorePlain]: treesize reduction 1116, result has 4.5 percent of original size [2019-12-07 17:07:37,257 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,257 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:07:37,259 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_172|]} [2019-12-07 17:07:37,261 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,304 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:07:37,305 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:07:37,305 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,312 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:07:37,316 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_173|]} [2019-12-07 17:07:37,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:07:37,319 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,398 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:07:37,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:07:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:37,401 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,421 INFO L614 ElimStorePlain]: treesize reduction 157, result has 25.2 percent of original size [2019-12-07 17:07:37,421 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,421 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:07:37,424 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_int_178|], 2=[|v_#memory_$Pointer$.base_163|], 12=[|v_#memory_$Pointer$.base_174|]} [2019-12-07 17:07:37,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 97 [2019-12-07 17:07:37,427 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,453 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 34 [2019-12-07 17:07:37,453 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,467 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,468 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 59 [2019-12-07 17:07:37,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:07:37,491 INFO L377 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2019-12-07 17:07:37,492 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,495 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,495 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:37,501 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:181, output treesize:32 [2019-12-07 17:07:37,545 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:07:37,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 17:07:37,545 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:37,551 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:37,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 17:07:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1071 proven. 91 refuted. 0 times theorem prover too weak. 1366 trivial. 0 not checked. [2019-12-07 17:07:38,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:07:38,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-12-07 17:07:38,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624390806] [2019-12-07 17:07:38,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:07:38,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:38,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:07:38,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:07:38,109 INFO L87 Difference]: Start difference. First operand 4404 states and 6797 transitions. Second operand 18 states. [2019-12-07 17:07:51,867 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-12-07 17:07:53,216 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-12-07 17:07:53,840 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 59 [2019-12-07 17:07:54,158 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2019-12-07 17:07:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:55,429 INFO L93 Difference]: Finished difference Result 75265 states and 115861 transitions. [2019-12-07 17:07:55,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-07 17:07:55,429 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 517 [2019-12-07 17:07:55,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:55,567 INFO L225 Difference]: With dead ends: 75265 [2019-12-07 17:07:55,567 INFO L226 Difference]: Without dead ends: 70880 [2019-12-07 17:07:55,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 542 SyntacticMatches, 3 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1607, Invalid=7705, Unknown=0, NotChecked=0, Total=9312 [2019-12-07 17:07:55,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70880 states. [2019-12-07 17:07:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70880 to 44940. [2019-12-07 17:07:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44940 states. [2019-12-07 17:07:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44940 states to 44940 states and 72749 transitions. [2019-12-07 17:07:56,681 INFO L78 Accepts]: Start accepts. Automaton has 44940 states and 72749 transitions. Word has length 517 [2019-12-07 17:07:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:56,681 INFO L462 AbstractCegarLoop]: Abstraction has 44940 states and 72749 transitions. [2019-12-07 17:07:56,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:07:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand 44940 states and 72749 transitions. [2019-12-07 17:07:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2019-12-07 17:07:56,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:56,743 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:56,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:07:56,945 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:56,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:56,946 INFO L82 PathProgramCache]: Analyzing trace with hash 876192904, now seen corresponding path program 1 times [2019-12-07 17:07:56,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:56,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644812143] [2019-12-07 17:07:56,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 428 proven. 27 refuted. 0 times theorem prover too weak. 2091 trivial. 0 not checked. [2019-12-07 17:07:57,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644812143] [2019-12-07 17:07:57,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [100696690] [2019-12-07 17:07:57,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:07:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:57,613 INFO L264 TraceCheckSpWp]: Trace formula consists of 1713 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:07:57,621 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:07:57,626 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 85 [2019-12-07 17:07:57,626 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:57,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:57,669 INFO L343 Elim1Store]: treesize reduction 60, result has 61.3 percent of original size [2019-12-07 17:07:57,669 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 104 [2019-12-07 17:07:57,670 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:57,700 INFO L614 ElimStorePlain]: treesize reduction 34, result has 67.3 percent of original size [2019-12-07 17:07:57,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2019-12-07 17:07:57,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,703 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:57,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:57,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:07:57,718 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:52 [2019-12-07 17:07:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:07:57,798 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:07:57,798 INFO L377 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 28 treesize of output 10 [2019-12-07 17:07:57,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:07:57,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:07:57,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:07:57,799 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:07:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2546 backedges. 1171 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-12-07 17:07:57,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:07:57,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-12-07 17:07:57,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791467274] [2019-12-07 17:07:57,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:07:57,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:57,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:07:57,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:07:57,967 INFO L87 Difference]: Start difference. First operand 44940 states and 72749 transitions. Second operand 7 states. [2019-12-07 17:07:59,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:59,383 INFO L93 Difference]: Finished difference Result 98953 states and 159497 transitions. [2019-12-07 17:07:59,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:07:59,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 520 [2019-12-07 17:07:59,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:59,441 INFO L225 Difference]: With dead ends: 98953 [2019-12-07 17:07:59,442 INFO L226 Difference]: Without dead ends: 54032 [2019-12-07 17:07:59,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 517 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:07:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54032 states. [2019-12-07 17:08:00,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54032 to 48034. [2019-12-07 17:08:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 78300 transitions. [2019-12-07 17:08:00,248 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 78300 transitions. Word has length 520 [2019-12-07 17:08:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:00,248 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 78300 transitions. [2019-12-07 17:08:00,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:08:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 78300 transitions. [2019-12-07 17:08:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-12-07 17:08:00,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:00,282 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:00,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:08:00,483 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1781759454, now seen corresponding path program 1 times [2019-12-07 17:08:00,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:00,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057710224] [2019-12-07 17:08:00,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:00,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 1072 proven. 0 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2019-12-07 17:08:00,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057710224] [2019-12-07 17:08:00,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:00,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:00,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78447738] [2019-12-07 17:08:00,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:00,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:00,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:00,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:00,772 INFO L87 Difference]: Start difference. First operand 48034 states and 78300 transitions. Second operand 4 states. [2019-12-07 17:08:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:01,782 INFO L93 Difference]: Finished difference Result 98701 states and 160241 transitions. [2019-12-07 17:08:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:01,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 526 [2019-12-07 17:08:01,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:01,830 INFO L225 Difference]: With dead ends: 98701 [2019-12-07 17:08:01,830 INFO L226 Difference]: Without dead ends: 50686 [2019-12-07 17:08:01,856 INFO L630 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 [2019-12-07 17:08:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50686 states. [2019-12-07 17:08:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50686 to 48034. [2019-12-07 17:08:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 78209 transitions. [2019-12-07 17:08:02,798 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 78209 transitions. Word has length 526 [2019-12-07 17:08:02,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:02,798 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 78209 transitions. [2019-12-07 17:08:02,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:02,798 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 78209 transitions. [2019-12-07 17:08:02,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 17:08:02,831 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:02,832 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:02,832 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:02,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:02,832 INFO L82 PathProgramCache]: Analyzing trace with hash 118235055, now seen corresponding path program 1 times [2019-12-07 17:08:02,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:02,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871615635] [2019-12-07 17:08:02,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2686 backedges. 957 proven. 0 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2019-12-07 17:08:03,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871615635] [2019-12-07 17:08:03,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:03,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:03,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574202641] [2019-12-07 17:08:03,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:03,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:03,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:03,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:03,018 INFO L87 Difference]: Start difference. First operand 48034 states and 78209 transitions. Second operand 4 states. [2019-12-07 17:08:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:03,922 INFO L93 Difference]: Finished difference Result 97388 states and 158447 transitions. [2019-12-07 17:08:03,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:03,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-12-07 17:08:03,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:03,967 INFO L225 Difference]: With dead ends: 97388 [2019-12-07 17:08:03,967 INFO L226 Difference]: Without dead ends: 49373 [2019-12-07 17:08:03,989 INFO L630 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 [2019-12-07 17:08:04,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49373 states. [2019-12-07 17:08:04,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49373 to 48034. [2019-12-07 17:08:04,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:04,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 78105 transitions. [2019-12-07 17:08:04,893 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 78105 transitions. Word has length 527 [2019-12-07 17:08:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:04,893 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 78105 transitions. [2019-12-07 17:08:04,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 78105 transitions. [2019-12-07 17:08:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 17:08:04,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:04,925 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:04,926 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:04,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:04,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1920084475, now seen corresponding path program 1 times [2019-12-07 17:08:04,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:04,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515672552] [2019-12-07 17:08:04,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2019-12-07 17:08:05,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515672552] [2019-12-07 17:08:05,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:05,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:05,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774141934] [2019-12-07 17:08:05,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:05,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:05,099 INFO L87 Difference]: Start difference. First operand 48034 states and 78105 transitions. Second operand 4 states. [2019-12-07 17:08:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:06,129 INFO L93 Difference]: Finished difference Result 98545 states and 159695 transitions. [2019-12-07 17:08:06,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:06,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-12-07 17:08:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:06,178 INFO L225 Difference]: With dead ends: 98545 [2019-12-07 17:08:06,178 INFO L226 Difference]: Without dead ends: 50530 [2019-12-07 17:08:06,201 INFO L630 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 [2019-12-07 17:08:06,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50530 states. [2019-12-07 17:08:07,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50530 to 48034. [2019-12-07 17:08:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:07,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 78014 transitions. [2019-12-07 17:08:07,144 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 78014 transitions. Word has length 527 [2019-12-07 17:08:07,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:07,144 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 78014 transitions. [2019-12-07 17:08:07,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 78014 transitions. [2019-12-07 17:08:07,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 17:08:07,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:07,177 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:07,177 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:07,178 INFO L82 PathProgramCache]: Analyzing trace with hash -479110469, now seen corresponding path program 1 times [2019-12-07 17:08:07,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:07,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043533448] [2019-12-07 17:08:07,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2729 backedges. 1102 proven. 0 refuted. 0 times theorem prover too weak. 1627 trivial. 0 not checked. [2019-12-07 17:08:07,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043533448] [2019-12-07 17:08:07,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:07,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:07,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269172141] [2019-12-07 17:08:07,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:07,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:07,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:07,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:07,350 INFO L87 Difference]: Start difference. First operand 48034 states and 78014 transitions. Second operand 4 states. [2019-12-07 17:08:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:08,402 INFO L93 Difference]: Finished difference Result 98454 states and 159422 transitions. [2019-12-07 17:08:08,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:08,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-12-07 17:08:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:08,451 INFO L225 Difference]: With dead ends: 98454 [2019-12-07 17:08:08,451 INFO L226 Difference]: Without dead ends: 50439 [2019-12-07 17:08:08,473 INFO L630 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 [2019-12-07 17:08:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50439 states. [2019-12-07 17:08:09,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50439 to 48034. [2019-12-07 17:08:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:09,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77923 transitions. [2019-12-07 17:08:09,454 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77923 transitions. Word has length 527 [2019-12-07 17:08:09,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:09,454 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77923 transitions. [2019-12-07 17:08:09,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:09,454 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77923 transitions. [2019-12-07 17:08:09,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2019-12-07 17:08:09,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:09,487 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:09,487 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:09,488 INFO L82 PathProgramCache]: Analyzing trace with hash -953268136, now seen corresponding path program 1 times [2019-12-07 17:08:09,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:09,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060254353] [2019-12-07 17:08:09,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:09,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 1012 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-12-07 17:08:09,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060254353] [2019-12-07 17:08:09,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:09,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:09,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520739504] [2019-12-07 17:08:09,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:09,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:09,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:09,669 INFO L87 Difference]: Start difference. First operand 48034 states and 77923 transitions. Second operand 4 states. [2019-12-07 17:08:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:10,687 INFO L93 Difference]: Finished difference Result 86928 states and 140473 transitions. [2019-12-07 17:08:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:10,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 527 [2019-12-07 17:08:10,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:10,738 INFO L225 Difference]: With dead ends: 86928 [2019-12-07 17:08:10,738 INFO L226 Difference]: Without dead ends: 50439 [2019-12-07 17:08:10,759 INFO L630 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 [2019-12-07 17:08:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50439 states. [2019-12-07 17:08:11,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50439 to 48034. [2019-12-07 17:08:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:11,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77832 transitions. [2019-12-07 17:08:11,720 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77832 transitions. Word has length 527 [2019-12-07 17:08:11,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:11,720 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77832 transitions. [2019-12-07 17:08:11,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:11,720 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77832 transitions. [2019-12-07 17:08:11,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-12-07 17:08:11,754 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:11,754 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:11,754 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:11,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:11,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1934193217, now seen corresponding path program 1 times [2019-12-07 17:08:11,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:11,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577708635] [2019-12-07 17:08:11,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:11,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2700 backedges. 971 proven. 0 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2019-12-07 17:08:11,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577708635] [2019-12-07 17:08:11,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:11,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:11,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214880393] [2019-12-07 17:08:11,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:11,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:11,923 INFO L87 Difference]: Start difference. First operand 48034 states and 77832 transitions. Second operand 4 states. [2019-12-07 17:08:12,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:12,861 INFO L93 Difference]: Finished difference Result 97388 states and 157693 transitions. [2019-12-07 17:08:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:12,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-12-07 17:08:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:12,912 INFO L225 Difference]: With dead ends: 97388 [2019-12-07 17:08:12,912 INFO L226 Difference]: Without dead ends: 49373 [2019-12-07 17:08:12,937 INFO L630 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 [2019-12-07 17:08:12,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49373 states. [2019-12-07 17:08:13,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49373 to 48034. [2019-12-07 17:08:13,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77728 transitions. [2019-12-07 17:08:13,920 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77728 transitions. Word has length 528 [2019-12-07 17:08:13,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:13,921 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77728 transitions. [2019-12-07 17:08:13,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77728 transitions. [2019-12-07 17:08:13,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-12-07 17:08:13,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:13,954 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:13,954 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:13,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1155284709, now seen corresponding path program 1 times [2019-12-07 17:08:13,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:13,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928120603] [2019-12-07 17:08:13,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-12-07 17:08:14,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928120603] [2019-12-07 17:08:14,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:14,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:14,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721211728] [2019-12-07 17:08:14,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:14,131 INFO L87 Difference]: Start difference. First operand 48034 states and 77728 transitions. Second operand 4 states. [2019-12-07 17:08:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:15,159 INFO L93 Difference]: Finished difference Result 86928 states and 140135 transitions. [2019-12-07 17:08:15,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:15,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-12-07 17:08:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:15,204 INFO L225 Difference]: With dead ends: 86928 [2019-12-07 17:08:15,204 INFO L226 Difference]: Without dead ends: 50439 [2019-12-07 17:08:15,223 INFO L630 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 [2019-12-07 17:08:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50439 states. [2019-12-07 17:08:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50439 to 48034. [2019-12-07 17:08:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:16,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77637 transitions. [2019-12-07 17:08:16,042 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77637 transitions. Word has length 528 [2019-12-07 17:08:16,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:16,042 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77637 transitions. [2019-12-07 17:08:16,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:16,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77637 transitions. [2019-12-07 17:08:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-12-07 17:08:16,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:16,076 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:16,076 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:16,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1225434698, now seen corresponding path program 1 times [2019-12-07 17:08:16,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:16,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581036511] [2019-12-07 17:08:16,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:16,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 985 proven. 0 refuted. 0 times theorem prover too weak. 1729 trivial. 0 not checked. [2019-12-07 17:08:16,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581036511] [2019-12-07 17:08:16,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:16,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042780653] [2019-12-07 17:08:16,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:16,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:16,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:16,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:16,384 INFO L87 Difference]: Start difference. First operand 48034 states and 77637 transitions. Second operand 4 states. [2019-12-07 17:08:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:17,300 INFO L93 Difference]: Finished difference Result 97076 states and 156903 transitions. [2019-12-07 17:08:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:17,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 529 [2019-12-07 17:08:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:17,340 INFO L225 Difference]: With dead ends: 97076 [2019-12-07 17:08:17,341 INFO L226 Difference]: Without dead ends: 49061 [2019-12-07 17:08:17,363 INFO L630 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 [2019-12-07 17:08:17,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49061 states. [2019-12-07 17:08:18,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49061 to 48034. [2019-12-07 17:08:18,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77533 transitions. [2019-12-07 17:08:18,186 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77533 transitions. Word has length 529 [2019-12-07 17:08:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:18,186 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77533 transitions. [2019-12-07 17:08:18,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77533 transitions. [2019-12-07 17:08:18,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2019-12-07 17:08:18,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:18,220 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:18,220 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:18,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1046783507, now seen corresponding path program 1 times [2019-12-07 17:08:18,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:18,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970188889] [2019-12-07 17:08:18,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:18,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2662 backedges. 1042 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-12-07 17:08:18,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970188889] [2019-12-07 17:08:18,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:18,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:18,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483948196] [2019-12-07 17:08:18,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:18,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:18,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:18,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:18,390 INFO L87 Difference]: Start difference. First operand 48034 states and 77533 transitions. Second operand 4 states. [2019-12-07 17:08:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:19,804 INFO L93 Difference]: Finished difference Result 86928 states and 139797 transitions. [2019-12-07 17:08:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:19,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 529 [2019-12-07 17:08:19,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:19,847 INFO L225 Difference]: With dead ends: 86928 [2019-12-07 17:08:19,847 INFO L226 Difference]: Without dead ends: 50439 [2019-12-07 17:08:19,861 INFO L630 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 [2019-12-07 17:08:19,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50439 states. [2019-12-07 17:08:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50439 to 48034. [2019-12-07 17:08:20,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77442 transitions. [2019-12-07 17:08:20,671 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77442 transitions. Word has length 529 [2019-12-07 17:08:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:20,672 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77442 transitions. [2019-12-07 17:08:20,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77442 transitions. [2019-12-07 17:08:20,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2019-12-07 17:08:20,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:20,705 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:20,705 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 466068854, now seen corresponding path program 1 times [2019-12-07 17:08:20,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:20,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584032392] [2019-12-07 17:08:20,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:20,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:20,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2677 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2019-12-07 17:08:20,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584032392] [2019-12-07 17:08:20,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:20,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:20,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980590849] [2019-12-07 17:08:20,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:20,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:20,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:20,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:20,877 INFO L87 Difference]: Start difference. First operand 48034 states and 77442 transitions. Second operand 4 states. [2019-12-07 17:08:21,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:21,892 INFO L93 Difference]: Finished difference Result 86668 states and 139329 transitions. [2019-12-07 17:08:21,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:21,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 530 [2019-12-07 17:08:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:21,943 INFO L225 Difference]: With dead ends: 86668 [2019-12-07 17:08:21,943 INFO L226 Difference]: Without dead ends: 50179 [2019-12-07 17:08:21,966 INFO L630 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 [2019-12-07 17:08:22,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50179 states. [2019-12-07 17:08:22,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50179 to 48034. [2019-12-07 17:08:22,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48034 states. [2019-12-07 17:08:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48034 states to 48034 states and 77351 transitions. [2019-12-07 17:08:22,965 INFO L78 Accepts]: Start accepts. Automaton has 48034 states and 77351 transitions. Word has length 530 [2019-12-07 17:08:22,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:22,965 INFO L462 AbstractCegarLoop]: Abstraction has 48034 states and 77351 transitions. [2019-12-07 17:08:22,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 48034 states and 77351 transitions. [2019-12-07 17:08:22,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2019-12-07 17:08:22,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:22,995 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:22,995 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:22,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1907560199, now seen corresponding path program 1 times [2019-12-07 17:08:22,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:22,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950627669] [2019-12-07 17:08:22,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:23,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2699 backedges. 1263 proven. 0 refuted. 0 times theorem prover too weak. 1436 trivial. 0 not checked. [2019-12-07 17:08:23,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950627669] [2019-12-07 17:08:23,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:23,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:23,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871544255] [2019-12-07 17:08:23,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:23,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:23,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:23,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:23,184 INFO L87 Difference]: Start difference. First operand 48034 states and 77351 transitions. Second operand 4 states. [2019-12-07 17:08:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:24,347 INFO L93 Difference]: Finished difference Result 101886 states and 163920 transitions. [2019-12-07 17:08:24,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:24,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 532 [2019-12-07 17:08:24,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:24,397 INFO L225 Difference]: With dead ends: 101886 [2019-12-07 17:08:24,397 INFO L226 Difference]: Without dead ends: 53871 [2019-12-07 17:08:24,419 INFO L630 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 [2019-12-07 17:08:24,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53871 states. [2019-12-07 17:08:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53871 to 48801. [2019-12-07 17:08:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-07 17:08:25,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 78638 transitions. [2019-12-07 17:08:25,278 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 78638 transitions. Word has length 532 [2019-12-07 17:08:25,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:25,278 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 78638 transitions. [2019-12-07 17:08:25,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 78638 transitions. [2019-12-07 17:08:25,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 17:08:25,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:25,312 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:25,312 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:25,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:25,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1116097280, now seen corresponding path program 1 times [2019-12-07 17:08:25,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:25,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705135932] [2019-12-07 17:08:25,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2729 backedges. 1292 proven. 0 refuted. 0 times theorem prover too weak. 1437 trivial. 0 not checked. [2019-12-07 17:08:25,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705135932] [2019-12-07 17:08:25,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:25,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:25,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250730829] [2019-12-07 17:08:25,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:25,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:25,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:25,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:25,500 INFO L87 Difference]: Start difference. First operand 48801 states and 78638 transitions. Second operand 4 states. [2019-12-07 17:08:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:26,890 INFO L93 Difference]: Finished difference Result 104035 states and 165862 transitions. [2019-12-07 17:08:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:26,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2019-12-07 17:08:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:26,939 INFO L225 Difference]: With dead ends: 104035 [2019-12-07 17:08:26,939 INFO L226 Difference]: Without dead ends: 55253 [2019-12-07 17:08:26,958 INFO L630 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 [2019-12-07 17:08:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55253 states. [2019-12-07 17:08:27,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55253 to 48801. [2019-12-07 17:08:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-07 17:08:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 78521 transitions. [2019-12-07 17:08:27,823 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 78521 transitions. Word has length 533 [2019-12-07 17:08:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:27,823 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 78521 transitions. [2019-12-07 17:08:27,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 78521 transitions. [2019-12-07 17:08:27,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 17:08:27,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:27,857 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:27,857 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:27,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:27,857 INFO L82 PathProgramCache]: Analyzing trace with hash 641939613, now seen corresponding path program 1 times [2019-12-07 17:08:27,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:27,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459902604] [2019-12-07 17:08:27,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:28,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2632 backedges. 1070 proven. 0 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked. [2019-12-07 17:08:28,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459902604] [2019-12-07 17:08:28,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:28,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:28,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995155454] [2019-12-07 17:08:28,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:28,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:28,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:28,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:28,099 INFO L87 Difference]: Start difference. First operand 48801 states and 78521 transitions. Second operand 4 states. [2019-12-07 17:08:29,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:29,469 INFO L93 Difference]: Finished difference Result 103970 states and 165563 transitions. [2019-12-07 17:08:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:29,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 533 [2019-12-07 17:08:29,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:29,519 INFO L225 Difference]: With dead ends: 103970 [2019-12-07 17:08:29,519 INFO L226 Difference]: Without dead ends: 55188 [2019-12-07 17:08:29,543 INFO L630 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 [2019-12-07 17:08:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55188 states. [2019-12-07 17:08:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55188 to 48918. [2019-12-07 17:08:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48918 states. [2019-12-07 17:08:30,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48918 states to 48918 states and 78638 transitions. [2019-12-07 17:08:30,614 INFO L78 Accepts]: Start accepts. Automaton has 48918 states and 78638 transitions. Word has length 533 [2019-12-07 17:08:30,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:30,614 INFO L462 AbstractCegarLoop]: Abstraction has 48918 states and 78638 transitions. [2019-12-07 17:08:30,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:30,614 INFO L276 IsEmpty]: Start isEmpty. Operand 48918 states and 78638 transitions. [2019-12-07 17:08:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 17:08:30,641 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:30,642 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:30,642 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:30,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:30,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1952831979, now seen corresponding path program 1 times [2019-12-07 17:08:30,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:30,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327753088] [2019-12-07 17:08:30,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:30,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 403 proven. 0 refuted. 0 times theorem prover too weak. 2231 trivial. 0 not checked. [2019-12-07 17:08:30,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327753088] [2019-12-07 17:08:30,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:30,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:08:30,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202416686] [2019-12-07 17:08:30,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:08:30,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:08:30,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:08:30,952 INFO L87 Difference]: Start difference. First operand 48918 states and 78638 transitions. Second operand 7 states. [2019-12-07 17:08:34,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:34,830 INFO L93 Difference]: Finished difference Result 141831 states and 224274 transitions. [2019-12-07 17:08:34,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:08:34,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 533 [2019-12-07 17:08:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:34,915 INFO L225 Difference]: With dead ends: 141831 [2019-12-07 17:08:34,915 INFO L226 Difference]: Without dead ends: 92867 [2019-12-07 17:08:34,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:08:35,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92867 states. [2019-12-07 17:08:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92867 to 52545. [2019-12-07 17:08:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52545 states. [2019-12-07 17:08:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52545 states to 52545 states and 85255 transitions. [2019-12-07 17:08:36,256 INFO L78 Accepts]: Start accepts. Automaton has 52545 states and 85255 transitions. Word has length 533 [2019-12-07 17:08:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:36,257 INFO L462 AbstractCegarLoop]: Abstraction has 52545 states and 85255 transitions. [2019-12-07 17:08:36,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:08:36,257 INFO L276 IsEmpty]: Start isEmpty. Operand 52545 states and 85255 transitions. [2019-12-07 17:08:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 17:08:36,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:36,291 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:36,291 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:36,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1704685485, now seen corresponding path program 1 times [2019-12-07 17:08:36,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:36,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180483484] [2019-12-07 17:08:36,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2019-12-07 17:08:36,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180483484] [2019-12-07 17:08:36,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:36,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:08:36,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969406965] [2019-12-07 17:08:36,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:08:36,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:08:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:08:36,544 INFO L87 Difference]: Start difference. First operand 52545 states and 85255 transitions. Second operand 6 states. [2019-12-07 17:08:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:39,340 INFO L93 Difference]: Finished difference Result 121694 states and 193614 transitions. [2019-12-07 17:08:39,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:08:39,341 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 533 [2019-12-07 17:08:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:39,402 INFO L225 Difference]: With dead ends: 121694 [2019-12-07 17:08:39,402 INFO L226 Difference]: Without dead ends: 69168 [2019-12-07 17:08:39,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:08:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69168 states. [2019-12-07 17:08:40,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69168 to 52545. [2019-12-07 17:08:40,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52545 states. [2019-12-07 17:08:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52545 states to 52545 states and 84657 transitions. [2019-12-07 17:08:40,751 INFO L78 Accepts]: Start accepts. Automaton has 52545 states and 84657 transitions. Word has length 533 [2019-12-07 17:08:40,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:40,752 INFO L462 AbstractCegarLoop]: Abstraction has 52545 states and 84657 transitions. [2019-12-07 17:08:40,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:08:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 52545 states and 84657 transitions. [2019-12-07 17:08:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-12-07 17:08:40,783 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:40,783 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:40,783 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:40,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1644132623, now seen corresponding path program 2 times [2019-12-07 17:08:40,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:40,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946329719] [2019-12-07 17:08:40,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2634 backedges. 820 proven. 0 refuted. 0 times theorem prover too weak. 1814 trivial. 0 not checked. [2019-12-07 17:08:40,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946329719] [2019-12-07 17:08:40,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:40,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:08:40,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336124975] [2019-12-07 17:08:40,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:08:40,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:40,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:08:40,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:08:40,966 INFO L87 Difference]: Start difference. First operand 52545 states and 84657 transitions. Second operand 6 states. [2019-12-07 17:08:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:43,520 INFO L93 Difference]: Finished difference Result 124436 states and 197935 transitions. [2019-12-07 17:08:43,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:08:43,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 533 [2019-12-07 17:08:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:43,583 INFO L225 Difference]: With dead ends: 124436 [2019-12-07 17:08:43,583 INFO L226 Difference]: Without dead ends: 71910 [2019-12-07 17:08:43,612 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:08:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71910 states. [2019-12-07 17:08:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71910 to 55587. [2019-12-07 17:08:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:08:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88999 transitions. [2019-12-07 17:08:44,879 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88999 transitions. Word has length 533 [2019-12-07 17:08:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:44,880 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88999 transitions. [2019-12-07 17:08:44,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:08:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88999 transitions. [2019-12-07 17:08:44,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2019-12-07 17:08:44,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:44,927 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:44,927 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:44,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1101399502, now seen corresponding path program 1 times [2019-12-07 17:08:44,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:44,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903148709] [2019-12-07 17:08:44,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:45,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1301 proven. 0 refuted. 0 times theorem prover too weak. 1437 trivial. 0 not checked. [2019-12-07 17:08:45,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903148709] [2019-12-07 17:08:45,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:45,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:45,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413825914] [2019-12-07 17:08:45,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:45,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:45,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:45,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:45,188 INFO L87 Difference]: Start difference. First operand 55587 states and 88999 transitions. Second operand 4 states. [2019-12-07 17:08:46,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:46,981 INFO L93 Difference]: Finished difference Result 116723 states and 185313 transitions. [2019-12-07 17:08:46,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:46,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 534 [2019-12-07 17:08:46,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:47,042 INFO L225 Difference]: With dead ends: 116723 [2019-12-07 17:08:47,042 INFO L226 Difference]: Without dead ends: 61155 [2019-12-07 17:08:47,073 INFO L630 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 [2019-12-07 17:08:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61155 states. [2019-12-07 17:08:48,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61155 to 55587. [2019-12-07 17:08:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:08:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88882 transitions. [2019-12-07 17:08:48,300 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88882 transitions. Word has length 534 [2019-12-07 17:08:48,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:48,300 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88882 transitions. [2019-12-07 17:08:48,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88882 transitions. [2019-12-07 17:08:48,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-12-07 17:08:48,347 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:48,348 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:48,348 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:48,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:48,348 INFO L82 PathProgramCache]: Analyzing trace with hash -37943259, now seen corresponding path program 1 times [2019-12-07 17:08:48,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:48,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118743502] [2019-12-07 17:08:48,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:48,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2660 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-12-07 17:08:48,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118743502] [2019-12-07 17:08:48,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:48,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:48,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031243030] [2019-12-07 17:08:48,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:48,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:48,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:48,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:48,515 INFO L87 Difference]: Start difference. First operand 55587 states and 88882 transitions. Second operand 4 states. [2019-12-07 17:08:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:50,344 INFO L93 Difference]: Finished difference Result 105964 states and 168181 transitions. [2019-12-07 17:08:50,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:50,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-12-07 17:08:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:50,398 INFO L225 Difference]: With dead ends: 105964 [2019-12-07 17:08:50,398 INFO L226 Difference]: Without dead ends: 63794 [2019-12-07 17:08:50,417 INFO L630 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 [2019-12-07 17:08:50,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63794 states. [2019-12-07 17:08:51,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63794 to 55587. [2019-12-07 17:08:51,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:08:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88765 transitions. [2019-12-07 17:08:51,659 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88765 transitions. Word has length 535 [2019-12-07 17:08:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:51,659 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88765 transitions. [2019-12-07 17:08:51,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:51,659 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88765 transitions. [2019-12-07 17:08:51,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2019-12-07 17:08:51,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:51,707 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:51,707 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:51,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:51,707 INFO L82 PathProgramCache]: Analyzing trace with hash -427267070, now seen corresponding path program 1 times [2019-12-07 17:08:51,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:51,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476179924] [2019-12-07 17:08:51,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:51,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2658 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-12-07 17:08:51,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476179924] [2019-12-07 17:08:51,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:51,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:51,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077551875] [2019-12-07 17:08:51,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:51,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:51,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:51,933 INFO L87 Difference]: Start difference. First operand 55587 states and 88765 transitions. Second operand 4 states. [2019-12-07 17:08:53,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:53,684 INFO L93 Difference]: Finished difference Result 103274 states and 163746 transitions. [2019-12-07 17:08:53,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:53,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 535 [2019-12-07 17:08:53,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:53,746 INFO L225 Difference]: With dead ends: 103274 [2019-12-07 17:08:53,746 INFO L226 Difference]: Without dead ends: 61104 [2019-12-07 17:08:53,772 INFO L630 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 [2019-12-07 17:08:53,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61104 states. [2019-12-07 17:08:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61104 to 55587. [2019-12-07 17:08:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:08:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88583 transitions. [2019-12-07 17:08:55,081 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88583 transitions. Word has length 535 [2019-12-07 17:08:55,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:55,081 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88583 transitions. [2019-12-07 17:08:55,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88583 transitions. [2019-12-07 17:08:55,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 17:08:55,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:55,128 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:55,128 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:55,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:55,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1698100955, now seen corresponding path program 1 times [2019-12-07 17:08:55,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:55,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863302036] [2019-12-07 17:08:55,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2675 backedges. 696 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-12-07 17:08:55,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863302036] [2019-12-07 17:08:55,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:55,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:55,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177028237] [2019-12-07 17:08:55,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:55,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:55,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:55,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:55,296 INFO L87 Difference]: Start difference. First operand 55587 states and 88583 transitions. Second operand 4 states. [2019-12-07 17:08:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:08:57,155 INFO L93 Difference]: Finished difference Result 105964 states and 167661 transitions. [2019-12-07 17:08:57,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:08:57,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-12-07 17:08:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:08:57,211 INFO L225 Difference]: With dead ends: 105964 [2019-12-07 17:08:57,211 INFO L226 Difference]: Without dead ends: 63794 [2019-12-07 17:08:57,237 INFO L630 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 [2019-12-07 17:08:57,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63794 states. [2019-12-07 17:08:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63794 to 55587. [2019-12-07 17:08:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:08:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88466 transitions. [2019-12-07 17:08:58,597 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88466 transitions. Word has length 536 [2019-12-07 17:08:58,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:08:58,598 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88466 transitions. [2019-12-07 17:08:58,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:08:58,598 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88466 transitions. [2019-12-07 17:08:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 17:08:58,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:08:58,644 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:08:58,644 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:08:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:08:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1553031008, now seen corresponding path program 1 times [2019-12-07 17:08:58,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:08:58,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352793607] [2019-12-07 17:08:58,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:08:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:08:58,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 1042 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-12-07 17:08:58,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352793607] [2019-12-07 17:08:58,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:08:58,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:08:58,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189587616] [2019-12-07 17:08:58,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:08:58,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:08:58,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:08:58,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:08:58,889 INFO L87 Difference]: Start difference. First operand 55587 states and 88466 transitions. Second operand 4 states. [2019-12-07 17:09:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:00,753 INFO L93 Difference]: Finished difference Result 103274 states and 163226 transitions. [2019-12-07 17:09:00,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:00,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-12-07 17:09:00,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:00,808 INFO L225 Difference]: With dead ends: 103274 [2019-12-07 17:09:00,809 INFO L226 Difference]: Without dead ends: 61104 [2019-12-07 17:09:00,831 INFO L630 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 [2019-12-07 17:09:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61104 states. [2019-12-07 17:09:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61104 to 55587. [2019-12-07 17:09:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88284 transitions. [2019-12-07 17:09:02,135 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88284 transitions. Word has length 536 [2019-12-07 17:09:02,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:02,136 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88284 transitions. [2019-12-07 17:09:02,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:02,136 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88284 transitions. [2019-12-07 17:09:02,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 17:09:02,182 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:02,183 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:02,183 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:02,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:02,183 INFO L82 PathProgramCache]: Analyzing trace with hash -355316280, now seen corresponding path program 1 times [2019-12-07 17:09:02,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:02,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807123697] [2019-12-07 17:09:02,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:02,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:02,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1164 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2019-12-07 17:09:02,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807123697] [2019-12-07 17:09:02,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:02,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:02,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559739241] [2019-12-07 17:09:02,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:02,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:02,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:02,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:02,429 INFO L87 Difference]: Start difference. First operand 55587 states and 88284 transitions. Second operand 4 states. [2019-12-07 17:09:04,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:04,043 INFO L93 Difference]: Finished difference Result 113300 states and 179650 transitions. [2019-12-07 17:09:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:04,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-12-07 17:09:04,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:04,095 INFO L225 Difference]: With dead ends: 113300 [2019-12-07 17:09:04,095 INFO L226 Difference]: Without dead ends: 57732 [2019-12-07 17:09:04,121 INFO L630 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 [2019-12-07 17:09:04,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57732 states. [2019-12-07 17:09:05,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57732 to 55587. [2019-12-07 17:09:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88193 transitions. [2019-12-07 17:09:05,420 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88193 transitions. Word has length 536 [2019-12-07 17:09:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:05,421 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88193 transitions. [2019-12-07 17:09:05,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88193 transitions. [2019-12-07 17:09:05,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-12-07 17:09:05,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:05,468 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:05,468 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:05,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1463288332, now seen corresponding path program 1 times [2019-12-07 17:09:05,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:05,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710841935] [2019-12-07 17:09:05,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2824 backedges. 1188 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2019-12-07 17:09:05,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710841935] [2019-12-07 17:09:05,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:05,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:05,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678434997] [2019-12-07 17:09:05,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:05,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:05,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:05,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:05,650 INFO L87 Difference]: Start difference. First operand 55587 states and 88193 transitions. Second operand 4 states. [2019-12-07 17:09:07,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:07,313 INFO L93 Difference]: Finished difference Result 113300 states and 179468 transitions. [2019-12-07 17:09:07,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:07,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 536 [2019-12-07 17:09:07,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:07,360 INFO L225 Difference]: With dead ends: 113300 [2019-12-07 17:09:07,360 INFO L226 Difference]: Without dead ends: 57732 [2019-12-07 17:09:07,378 INFO L630 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 [2019-12-07 17:09:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57732 states. [2019-12-07 17:09:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57732 to 55587. [2019-12-07 17:09:08,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 88102 transitions. [2019-12-07 17:09:08,657 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 88102 transitions. Word has length 536 [2019-12-07 17:09:08,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:08,657 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 88102 transitions. [2019-12-07 17:09:08,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 88102 transitions. [2019-12-07 17:09:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 17:09:08,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:08,705 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:08,705 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:08,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:08,705 INFO L82 PathProgramCache]: Analyzing trace with hash 173912234, now seen corresponding path program 1 times [2019-12-07 17:09:08,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:08,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734034848] [2019-12-07 17:09:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2690 backedges. 711 proven. 0 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2019-12-07 17:09:08,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734034848] [2019-12-07 17:09:08,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:08,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:08,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110775356] [2019-12-07 17:09:08,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:08,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:08,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:08,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:08,875 INFO L87 Difference]: Start difference. First operand 55587 states and 88102 transitions. Second operand 4 states. [2019-12-07 17:09:10,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:10,844 INFO L93 Difference]: Finished difference Result 105704 states and 166517 transitions. [2019-12-07 17:09:10,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:10,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2019-12-07 17:09:10,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:10,903 INFO L225 Difference]: With dead ends: 105704 [2019-12-07 17:09:10,903 INFO L226 Difference]: Without dead ends: 63534 [2019-12-07 17:09:10,926 INFO L630 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 [2019-12-07 17:09:10,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63534 states. [2019-12-07 17:09:12,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63534 to 55587. [2019-12-07 17:09:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 87985 transitions. [2019-12-07 17:09:12,332 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 87985 transitions. Word has length 537 [2019-12-07 17:09:12,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:12,332 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 87985 transitions. [2019-12-07 17:09:12,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:12,332 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 87985 transitions. [2019-12-07 17:09:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 17:09:12,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:12,379 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:12,379 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:12,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1682938425, now seen corresponding path program 1 times [2019-12-07 17:09:12,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:12,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895054321] [2019-12-07 17:09:12,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:12,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2688 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 1631 trivial. 0 not checked. [2019-12-07 17:09:12,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895054321] [2019-12-07 17:09:12,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:12,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:12,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096484517] [2019-12-07 17:09:12,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:12,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:12,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:12,620 INFO L87 Difference]: Start difference. First operand 55587 states and 87985 transitions. Second operand 4 states. [2019-12-07 17:09:14,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:14,573 INFO L93 Difference]: Finished difference Result 103014 states and 162082 transitions. [2019-12-07 17:09:14,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:14,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2019-12-07 17:09:14,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:14,626 INFO L225 Difference]: With dead ends: 103014 [2019-12-07 17:09:14,626 INFO L226 Difference]: Without dead ends: 60844 [2019-12-07 17:09:14,649 INFO L630 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 [2019-12-07 17:09:14,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60844 states. [2019-12-07 17:09:16,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60844 to 55587. [2019-12-07 17:09:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:16,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 87803 transitions. [2019-12-07 17:09:16,087 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 87803 transitions. Word has length 537 [2019-12-07 17:09:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:16,087 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 87803 transitions. [2019-12-07 17:09:16,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 87803 transitions. [2019-12-07 17:09:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 17:09:16,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:16,131 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:16,131 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:16,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash -412976251, now seen corresponding path program 1 times [2019-12-07 17:09:16,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:16,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613744450] [2019-12-07 17:09:16,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2813 backedges. 1177 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2019-12-07 17:09:16,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613744450] [2019-12-07 17:09:16,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:16,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:16,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876245365] [2019-12-07 17:09:16,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:16,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:16,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:16,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:16,321 INFO L87 Difference]: Start difference. First operand 55587 states and 87803 transitions. Second operand 4 states. [2019-12-07 17:09:17,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:17,974 INFO L93 Difference]: Finished difference Result 112936 states and 178156 transitions. [2019-12-07 17:09:17,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:17,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2019-12-07 17:09:17,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:18,025 INFO L225 Difference]: With dead ends: 112936 [2019-12-07 17:09:18,025 INFO L226 Difference]: Without dead ends: 57368 [2019-12-07 17:09:18,051 INFO L630 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 [2019-12-07 17:09:18,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57368 states. [2019-12-07 17:09:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57368 to 55587. [2019-12-07 17:09:19,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 87712 transitions. [2019-12-07 17:09:19,402 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 87712 transitions. Word has length 537 [2019-12-07 17:09:19,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:19,402 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 87712 transitions. [2019-12-07 17:09:19,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 87712 transitions. [2019-12-07 17:09:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2019-12-07 17:09:19,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:19,449 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:19,449 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:19,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1438761903, now seen corresponding path program 1 times [2019-12-07 17:09:19,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:19,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799220480] [2019-12-07 17:09:19,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2836 backedges. 1200 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked. [2019-12-07 17:09:19,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799220480] [2019-12-07 17:09:19,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:19,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:19,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575397293] [2019-12-07 17:09:19,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:19,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:19,633 INFO L87 Difference]: Start difference. First operand 55587 states and 87712 transitions. Second operand 4 states. [2019-12-07 17:09:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:21,306 INFO L93 Difference]: Finished difference Result 112481 states and 177351 transitions. [2019-12-07 17:09:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:21,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 537 [2019-12-07 17:09:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:21,362 INFO L225 Difference]: With dead ends: 112481 [2019-12-07 17:09:21,363 INFO L226 Difference]: Without dead ends: 56913 [2019-12-07 17:09:21,390 INFO L630 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 [2019-12-07 17:09:21,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56913 states. [2019-12-07 17:09:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56913 to 55587. [2019-12-07 17:09:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 87621 transitions. [2019-12-07 17:09:22,743 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 87621 transitions. Word has length 537 [2019-12-07 17:09:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:22,744 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 87621 transitions. [2019-12-07 17:09:22,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:22,744 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 87621 transitions. [2019-12-07 17:09:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-12-07 17:09:22,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:22,791 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:22,791 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:22,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:22,791 INFO L82 PathProgramCache]: Analyzing trace with hash -199828701, now seen corresponding path program 1 times [2019-12-07 17:09:22,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:22,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656252540] [2019-12-07 17:09:22,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:23,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2800 backedges. 1342 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2019-12-07 17:09:23,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656252540] [2019-12-07 17:09:23,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:23,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:23,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621365748] [2019-12-07 17:09:23,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:23,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:23,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:23,008 INFO L87 Difference]: Start difference. First operand 55587 states and 87621 transitions. Second operand 4 states. [2019-12-07 17:09:25,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:25,024 INFO L93 Difference]: Finished difference Result 115822 states and 181681 transitions. [2019-12-07 17:09:25,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:25,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 542 [2019-12-07 17:09:25,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:25,071 INFO L225 Difference]: With dead ends: 115822 [2019-12-07 17:09:25,071 INFO L226 Difference]: Without dead ends: 60254 [2019-12-07 17:09:25,086 INFO L630 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 [2019-12-07 17:09:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60254 states. [2019-12-07 17:09:26,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60254 to 55587. [2019-12-07 17:09:26,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55587 states. [2019-12-07 17:09:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55587 states to 55587 states and 87504 transitions. [2019-12-07 17:09:26,455 INFO L78 Accepts]: Start accepts. Automaton has 55587 states and 87504 transitions. Word has length 542 [2019-12-07 17:09:26,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:26,455 INFO L462 AbstractCegarLoop]: Abstraction has 55587 states and 87504 transitions. [2019-12-07 17:09:26,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:26,455 INFO L276 IsEmpty]: Start isEmpty. Operand 55587 states and 87504 transitions. [2019-12-07 17:09:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2019-12-07 17:09:26,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:26,502 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 9, 8, 8, 7, 7, 6, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:26,502 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1307800753, now seen corresponding path program 1 times [2019-12-07 17:09:26,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:26,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308069347] [2019-12-07 17:09:26,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2824 backedges. 1289 proven. 0 refuted. 0 times theorem prover too weak. 1535 trivial. 0 not checked. [2019-12-07 17:09:26,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308069347] [2019-12-07 17:09:26,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:26,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:26,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948591086] [2019-12-07 17:09:26,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:26,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:26,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:26,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:26,692 INFO L87 Difference]: Start difference. First operand 55587 states and 87504 transitions. Second operand 4 states. [2019-12-07 17:09:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:28,378 INFO L93 Difference]: Finished difference Result 113066 states and 177532 transitions. [2019-12-07 17:09:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:28,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 542 [2019-12-07 17:09:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:28,436 INFO L225 Difference]: With dead ends: 113066 [2019-12-07 17:09:28,436 INFO L226 Difference]: Without dead ends: 57498 [2019-12-07 17:09:28,465 INFO L630 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 [2019-12-07 17:09:28,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57498 states. [2019-12-07 17:09:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57498 to 55574. [2019-12-07 17:09:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55574 states. [2019-12-07 17:09:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55574 states to 55574 states and 87374 transitions. [2019-12-07 17:09:29,917 INFO L78 Accepts]: Start accepts. Automaton has 55574 states and 87374 transitions. Word has length 542 [2019-12-07 17:09:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:29,917 INFO L462 AbstractCegarLoop]: Abstraction has 55574 states and 87374 transitions. [2019-12-07 17:09:29,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 55574 states and 87374 transitions. [2019-12-07 17:09:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-12-07 17:09:29,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:29,962 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:29,962 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:29,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:29,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1455159510, now seen corresponding path program 1 times [2019-12-07 17:09:29,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:29,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585418827] [2019-12-07 17:09:29,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2844 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 2015 trivial. 0 not checked. [2019-12-07 17:09:30,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585418827] [2019-12-07 17:09:30,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:30,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:30,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809406926] [2019-12-07 17:09:30,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:30,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:30,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:30,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:30,138 INFO L87 Difference]: Start difference. First operand 55574 states and 87374 transitions. Second operand 4 states. [2019-12-07 17:09:32,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:32,272 INFO L93 Difference]: Finished difference Result 103299 states and 161008 transitions. [2019-12-07 17:09:32,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:32,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 548 [2019-12-07 17:09:32,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:32,333 INFO L225 Difference]: With dead ends: 103299 [2019-12-07 17:09:32,333 INFO L226 Difference]: Without dead ends: 61142 [2019-12-07 17:09:32,359 INFO L630 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 [2019-12-07 17:09:32,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61142 states. [2019-12-07 17:09:33,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61142 to 55574. [2019-12-07 17:09:33,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55574 states. [2019-12-07 17:09:33,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55574 states to 55574 states and 87257 transitions. [2019-12-07 17:09:33,786 INFO L78 Accepts]: Start accepts. Automaton has 55574 states and 87257 transitions. Word has length 548 [2019-12-07 17:09:33,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:33,786 INFO L462 AbstractCegarLoop]: Abstraction has 55574 states and 87257 transitions. [2019-12-07 17:09:33,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:33,786 INFO L276 IsEmpty]: Start isEmpty. Operand 55574 states and 87257 transitions. [2019-12-07 17:09:33,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2019-12-07 17:09:33,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:33,833 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 6, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:33,833 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:33,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:33,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1380282242, now seen corresponding path program 1 times [2019-12-07 17:09:33,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:33,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480123857] [2019-12-07 17:09:33,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2898 backedges. 1376 proven. 0 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2019-12-07 17:09:34,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480123857] [2019-12-07 17:09:34,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:34,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:09:34,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243683212] [2019-12-07 17:09:34,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:09:34,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:34,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:09:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:09:34,232 INFO L87 Difference]: Start difference. First operand 55574 states and 87257 transitions. Second operand 7 states. [2019-12-07 17:09:38,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:38,681 INFO L93 Difference]: Finished difference Result 135470 states and 211138 transitions. [2019-12-07 17:09:38,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:09:38,682 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 548 [2019-12-07 17:09:38,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:38,753 INFO L225 Difference]: With dead ends: 135470 [2019-12-07 17:09:38,753 INFO L226 Difference]: Without dead ends: 79915 [2019-12-07 17:09:38,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:09:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79915 states. [2019-12-07 17:09:40,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79915 to 58226. [2019-12-07 17:09:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58226 states. [2019-12-07 17:09:40,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58226 states to 58226 states and 91820 transitions. [2019-12-07 17:09:40,459 INFO L78 Accepts]: Start accepts. Automaton has 58226 states and 91820 transitions. Word has length 548 [2019-12-07 17:09:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:40,459 INFO L462 AbstractCegarLoop]: Abstraction has 58226 states and 91820 transitions. [2019-12-07 17:09:40,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:09:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 58226 states and 91820 transitions. [2019-12-07 17:09:40,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2019-12-07 17:09:40,506 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:40,507 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:40,507 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:40,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:40,507 INFO L82 PathProgramCache]: Analyzing trace with hash 413638657, now seen corresponding path program 1 times [2019-12-07 17:09:40,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:40,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926386453] [2019-12-07 17:09:40,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:40,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:40,791 INFO L134 CoverageAnalysis]: Checked inductivity of 3002 backedges. 1401 proven. 0 refuted. 0 times theorem prover too weak. 1601 trivial. 0 not checked. [2019-12-07 17:09:40,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926386453] [2019-12-07 17:09:40,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:40,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:09:40,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564703762] [2019-12-07 17:09:40,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:09:40,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:40,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:09:40,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:09:40,793 INFO L87 Difference]: Start difference. First operand 58226 states and 91820 transitions. Second operand 5 states. [2019-12-07 17:09:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:43,242 INFO L93 Difference]: Finished difference Result 124549 states and 194995 transitions. [2019-12-07 17:09:43,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:43,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 562 [2019-12-07 17:09:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:43,301 INFO L225 Difference]: With dead ends: 124549 [2019-12-07 17:09:43,301 INFO L226 Difference]: Without dead ends: 66342 [2019-12-07 17:09:43,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:09:43,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66342 states. [2019-12-07 17:09:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66342 to 54313. [2019-12-07 17:09:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54313 states. [2019-12-07 17:09:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54313 states to 54313 states and 84956 transitions. [2019-12-07 17:09:44,949 INFO L78 Accepts]: Start accepts. Automaton has 54313 states and 84956 transitions. Word has length 562 [2019-12-07 17:09:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:44,949 INFO L462 AbstractCegarLoop]: Abstraction has 54313 states and 84956 transitions. [2019-12-07 17:09:44,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:09:44,949 INFO L276 IsEmpty]: Start isEmpty. Operand 54313 states and 84956 transitions. [2019-12-07 17:09:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2019-12-07 17:09:44,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:44,994 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:44,994 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1995628318, now seen corresponding path program 1 times [2019-12-07 17:09:44,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:44,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778862220] [2019-12-07 17:09:44,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:45,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:45,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2980 backedges. 877 proven. 0 refuted. 0 times theorem prover too weak. 2103 trivial. 0 not checked. [2019-12-07 17:09:45,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778862220] [2019-12-07 17:09:45,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:45,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:45,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804101512] [2019-12-07 17:09:45,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:45,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:45,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:45,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:45,176 INFO L87 Difference]: Start difference. First operand 54313 states and 84956 transitions. Second operand 4 states. [2019-12-07 17:09:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:47,492 INFO L93 Difference]: Finished difference Result 100526 states and 156102 transitions. [2019-12-07 17:09:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:47,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 563 [2019-12-07 17:09:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:47,545 INFO L225 Difference]: With dead ends: 100526 [2019-12-07 17:09:47,545 INFO L226 Difference]: Without dead ends: 59240 [2019-12-07 17:09:47,568 INFO L630 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 [2019-12-07 17:09:47,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59240 states. [2019-12-07 17:09:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59240 to 54313. [2019-12-07 17:09:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54313 states. [2019-12-07 17:09:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54313 states to 54313 states and 84839 transitions. [2019-12-07 17:09:49,197 INFO L78 Accepts]: Start accepts. Automaton has 54313 states and 84839 transitions. Word has length 563 [2019-12-07 17:09:49,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:49,198 INFO L462 AbstractCegarLoop]: Abstraction has 54313 states and 84839 transitions. [2019-12-07 17:09:49,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:49,198 INFO L276 IsEmpty]: Start isEmpty. Operand 54313 states and 84839 transitions. [2019-12-07 17:09:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2019-12-07 17:09:49,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:49,242 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:49,242 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:49,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash 852417910, now seen corresponding path program 1 times [2019-12-07 17:09:49,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:49,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298067527] [2019-12-07 17:09:49,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2996 backedges. 893 proven. 0 refuted. 0 times theorem prover too weak. 2103 trivial. 0 not checked. [2019-12-07 17:09:49,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298067527] [2019-12-07 17:09:49,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:49,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:49,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376653893] [2019-12-07 17:09:49,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:49,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:49,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:49,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:49,426 INFO L87 Difference]: Start difference. First operand 54313 states and 84839 transitions. Second operand 4 states. [2019-12-07 17:09:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:51,860 INFO L93 Difference]: Finished difference Result 100526 states and 155894 transitions. [2019-12-07 17:09:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:51,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 564 [2019-12-07 17:09:51,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:51,912 INFO L225 Difference]: With dead ends: 100526 [2019-12-07 17:09:51,912 INFO L226 Difference]: Without dead ends: 59240 [2019-12-07 17:09:51,934 INFO L630 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 [2019-12-07 17:09:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59240 states. [2019-12-07 17:09:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59240 to 54313. [2019-12-07 17:09:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54313 states. [2019-12-07 17:09:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54313 states to 54313 states and 84722 transitions. [2019-12-07 17:09:53,508 INFO L78 Accepts]: Start accepts. Automaton has 54313 states and 84722 transitions. Word has length 564 [2019-12-07 17:09:53,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:53,508 INFO L462 AbstractCegarLoop]: Abstraction has 54313 states and 84722 transitions. [2019-12-07 17:09:53,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:53,508 INFO L276 IsEmpty]: Start isEmpty. Operand 54313 states and 84722 transitions. [2019-12-07 17:09:53,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-12-07 17:09:53,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:53,635 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 14, 14, 14, 13, 13, 12, 12, 12, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:53,635 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:53,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1943367463, now seen corresponding path program 1 times [2019-12-07 17:09:53,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:53,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405627627] [2019-12-07 17:09:53,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3012 backedges. 909 proven. 0 refuted. 0 times theorem prover too weak. 2103 trivial. 0 not checked. [2019-12-07 17:09:53,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405627627] [2019-12-07 17:09:53,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:53,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:53,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521104031] [2019-12-07 17:09:53,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:53,817 INFO L87 Difference]: Start difference. First operand 54313 states and 84722 transitions. Second operand 4 states. [2019-12-07 17:09:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:09:56,198 INFO L93 Difference]: Finished difference Result 100266 states and 155374 transitions. [2019-12-07 17:09:56,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:09:56,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 565 [2019-12-07 17:09:56,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:09:56,249 INFO L225 Difference]: With dead ends: 100266 [2019-12-07 17:09:56,250 INFO L226 Difference]: Without dead ends: 58980 [2019-12-07 17:09:56,273 INFO L630 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 [2019-12-07 17:09:56,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58980 states. [2019-12-07 17:09:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58980 to 54313. [2019-12-07 17:09:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54313 states. [2019-12-07 17:09:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54313 states to 54313 states and 84605 transitions. [2019-12-07 17:09:57,885 INFO L78 Accepts]: Start accepts. Automaton has 54313 states and 84605 transitions. Word has length 565 [2019-12-07 17:09:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:09:57,885 INFO L462 AbstractCegarLoop]: Abstraction has 54313 states and 84605 transitions. [2019-12-07 17:09:57,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:09:57,885 INFO L276 IsEmpty]: Start isEmpty. Operand 54313 states and 84605 transitions. [2019-12-07 17:09:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 576 [2019-12-07 17:09:57,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:09:57,934 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:09:57,934 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:09:57,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:09:57,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1644287046, now seen corresponding path program 1 times [2019-12-07 17:09:57,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:09:57,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641447875] [2019-12-07 17:09:57,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:09:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:09:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3104 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-12-07 17:09:58,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641447875] [2019-12-07 17:09:58,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:09:58,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:09:58,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680734701] [2019-12-07 17:09:58,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:09:58,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:09:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:09:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:09:58,711 INFO L87 Difference]: Start difference. First operand 54313 states and 84605 transitions. Second operand 4 states. [2019-12-07 17:10:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:01,029 INFO L93 Difference]: Finished difference Result 114301 states and 177482 transitions. [2019-12-07 17:10:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:01,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 575 [2019-12-07 17:10:01,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:01,080 INFO L225 Difference]: With dead ends: 114301 [2019-12-07 17:10:01,081 INFO L226 Difference]: Without dead ends: 60007 [2019-12-07 17:10:01,107 INFO L630 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 [2019-12-07 17:10:01,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60007 states. [2019-12-07 17:10:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60007 to 54833. [2019-12-07 17:10:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54833 states. [2019-12-07 17:10:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54833 states to 54833 states and 85463 transitions. [2019-12-07 17:10:02,734 INFO L78 Accepts]: Start accepts. Automaton has 54833 states and 85463 transitions. Word has length 575 [2019-12-07 17:10:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:02,734 INFO L462 AbstractCegarLoop]: Abstraction has 54833 states and 85463 transitions. [2019-12-07 17:10:02,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 54833 states and 85463 transitions. [2019-12-07 17:10:02,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-12-07 17:10:02,781 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:02,781 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:02,781 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:02,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:02,781 INFO L82 PathProgramCache]: Analyzing trace with hash -235732732, now seen corresponding path program 1 times [2019-12-07 17:10:02,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:02,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965203831] [2019-12-07 17:10:02,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3113 backedges. 1398 proven. 0 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2019-12-07 17:10:02,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965203831] [2019-12-07 17:10:02,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:02,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:02,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507069374] [2019-12-07 17:10:02,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:02,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:02,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:02,981 INFO L87 Difference]: Start difference. First operand 54833 states and 85463 transitions. Second operand 4 states. [2019-12-07 17:10:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:04,548 INFO L93 Difference]: Finished difference Result 97003 states and 151149 transitions. [2019-12-07 17:10:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:04,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 576 [2019-12-07 17:10:04,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:04,599 INFO L225 Difference]: With dead ends: 97003 [2019-12-07 17:10:04,599 INFO L226 Difference]: Without dead ends: 55405 [2019-12-07 17:10:04,621 INFO L630 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 [2019-12-07 17:10:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55405 states. [2019-12-07 17:10:06,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55405 to 55041. [2019-12-07 17:10:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55041 states. [2019-12-07 17:10:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55041 states to 55041 states and 85788 transitions. [2019-12-07 17:10:06,223 INFO L78 Accepts]: Start accepts. Automaton has 55041 states and 85788 transitions. Word has length 576 [2019-12-07 17:10:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:06,223 INFO L462 AbstractCegarLoop]: Abstraction has 55041 states and 85788 transitions. [2019-12-07 17:10:06,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 55041 states and 85788 transitions. [2019-12-07 17:10:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-12-07 17:10:06,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:06,270 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:06,271 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:06,271 INFO L82 PathProgramCache]: Analyzing trace with hash -2093510688, now seen corresponding path program 1 times [2019-12-07 17:10:06,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:06,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449520993] [2019-12-07 17:10:06,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1577 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2019-12-07 17:10:06,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449520993] [2019-12-07 17:10:06,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:06,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:06,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378274758] [2019-12-07 17:10:06,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:06,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:06,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:06,468 INFO L87 Difference]: Start difference. First operand 55041 states and 85788 transitions. Second operand 4 states. [2019-12-07 17:10:09,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:09,079 INFO L93 Difference]: Finished difference Result 107455 states and 167175 transitions. [2019-12-07 17:10:09,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:09,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 576 [2019-12-07 17:10:09,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:09,134 INFO L225 Difference]: With dead ends: 107455 [2019-12-07 17:10:09,135 INFO L226 Difference]: Without dead ends: 65649 [2019-12-07 17:10:09,154 INFO L630 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 [2019-12-07 17:10:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65649 states. [2019-12-07 17:10:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65649 to 56445. [2019-12-07 17:10:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56445 states. [2019-12-07 17:10:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56445 states to 56445 states and 87777 transitions. [2019-12-07 17:10:10,856 INFO L78 Accepts]: Start accepts. Automaton has 56445 states and 87777 transitions. Word has length 576 [2019-12-07 17:10:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:10,856 INFO L462 AbstractCegarLoop]: Abstraction has 56445 states and 87777 transitions. [2019-12-07 17:10:10,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 56445 states and 87777 transitions. [2019-12-07 17:10:10,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-12-07 17:10:10,904 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:10,904 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:10,904 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:10,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1877880704, now seen corresponding path program 2 times [2019-12-07 17:10:10,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:10,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438169441] [2019-12-07 17:10:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:10,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3122 backedges. 1660 proven. 0 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2019-12-07 17:10:11,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438169441] [2019-12-07 17:10:11,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:11,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:10:11,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967525209] [2019-12-07 17:10:11,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:10:11,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:11,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:10:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:11,130 INFO L87 Difference]: Start difference. First operand 56445 states and 87777 transitions. Second operand 6 states. [2019-12-07 17:10:15,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:15,301 INFO L93 Difference]: Finished difference Result 131478 states and 202909 transitions. [2019-12-07 17:10:15,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:10:15,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 576 [2019-12-07 17:10:15,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:15,373 INFO L225 Difference]: With dead ends: 131478 [2019-12-07 17:10:15,374 INFO L226 Difference]: Without dead ends: 75052 [2019-12-07 17:10:15,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:15,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75052 states. [2019-12-07 17:10:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75052 to 60540. [2019-12-07 17:10:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60540 states. [2019-12-07 17:10:17,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60540 states to 60540 states and 94498 transitions. [2019-12-07 17:10:17,291 INFO L78 Accepts]: Start accepts. Automaton has 60540 states and 94498 transitions. Word has length 576 [2019-12-07 17:10:17,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:17,291 INFO L462 AbstractCegarLoop]: Abstraction has 60540 states and 94498 transitions. [2019-12-07 17:10:17,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:10:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 60540 states and 94498 transitions. [2019-12-07 17:10:17,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-12-07 17:10:17,341 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:17,341 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:17,341 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:17,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:17,342 INFO L82 PathProgramCache]: Analyzing trace with hash 956541370, now seen corresponding path program 1 times [2019-12-07 17:10:17,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:17,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999740969] [2019-12-07 17:10:17,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 3114 backedges. 1298 proven. 0 refuted. 0 times theorem prover too weak. 1816 trivial. 0 not checked. [2019-12-07 17:10:17,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999740969] [2019-12-07 17:10:17,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:17,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:10:17,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303682545] [2019-12-07 17:10:17,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:10:17,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:17,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:10:17,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:10:17,623 INFO L87 Difference]: Start difference. First operand 60540 states and 94498 transitions. Second operand 5 states. [2019-12-07 17:10:19,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:19,392 INFO L93 Difference]: Finished difference Result 106623 states and 166437 transitions. [2019-12-07 17:10:19,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:10:19,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 577 [2019-12-07 17:10:19,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:19,444 INFO L225 Difference]: With dead ends: 106623 [2019-12-07 17:10:19,444 INFO L226 Difference]: Without dead ends: 60540 [2019-12-07 17:10:19,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:10:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60540 states. [2019-12-07 17:10:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60540 to 60410. [2019-12-07 17:10:21,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60410 states. [2019-12-07 17:10:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60410 states to 60410 states and 94316 transitions. [2019-12-07 17:10:21,277 INFO L78 Accepts]: Start accepts. Automaton has 60410 states and 94316 transitions. Word has length 577 [2019-12-07 17:10:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:21,278 INFO L462 AbstractCegarLoop]: Abstraction has 60410 states and 94316 transitions. [2019-12-07 17:10:21,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:10:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 60410 states and 94316 transitions. [2019-12-07 17:10:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-12-07 17:10:21,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:21,328 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:21,328 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:21,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1281920883, now seen corresponding path program 1 times [2019-12-07 17:10:21,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:21,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107940051] [2019-12-07 17:10:21,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:21,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3138 backedges. 1593 proven. 0 refuted. 0 times theorem prover too weak. 1545 trivial. 0 not checked. [2019-12-07 17:10:21,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107940051] [2019-12-07 17:10:21,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:21,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:21,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860002852] [2019-12-07 17:10:21,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:21,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:21,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:21,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:21,525 INFO L87 Difference]: Start difference. First operand 60410 states and 94316 transitions. Second operand 4 states. [2019-12-07 17:10:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:24,389 INFO L93 Difference]: Finished difference Result 115567 states and 180084 transitions. [2019-12-07 17:10:24,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:24,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 577 [2019-12-07 17:10:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:24,456 INFO L225 Difference]: With dead ends: 115567 [2019-12-07 17:10:24,457 INFO L226 Difference]: Without dead ends: 69614 [2019-12-07 17:10:24,482 INFO L630 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 [2019-12-07 17:10:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69614 states. [2019-12-07 17:10:26,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69614 to 60527. [2019-12-07 17:10:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60527 states. [2019-12-07 17:10:26,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60527 states to 60527 states and 94433 transitions. [2019-12-07 17:10:26,358 INFO L78 Accepts]: Start accepts. Automaton has 60527 states and 94433 transitions. Word has length 577 [2019-12-07 17:10:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:26,358 INFO L462 AbstractCegarLoop]: Abstraction has 60527 states and 94433 transitions. [2019-12-07 17:10:26,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60527 states and 94433 transitions. [2019-12-07 17:10:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2019-12-07 17:10:26,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:26,408 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:26,408 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:26,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash -315134386, now seen corresponding path program 1 times [2019-12-07 17:10:26,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:26,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306758621] [2019-12-07 17:10:26,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3131 backedges. 1131 proven. 59 refuted. 0 times theorem prover too weak. 1941 trivial. 0 not checked. [2019-12-07 17:10:26,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306758621] [2019-12-07 17:10:26,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189536079] [2019-12-07 17:10:26,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:26,958 INFO L264 TraceCheckSpWp]: Trace formula consists of 1886 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:10:26,964 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:26,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:10:26,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:26,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:26,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:26,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:10:26,985 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:10:26,985 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:10:26,985 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:26,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:26,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:26,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:10:26,998 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:10:26,999 INFO L377 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 28 treesize of output 10 [2019-12-07 17:10:26,999 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:27,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:27,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:27,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:10:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3131 backedges. 1131 proven. 59 refuted. 0 times theorem prover too weak. 1941 trivial. 0 not checked. [2019-12-07 17:10:27,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:10:27,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-12-07 17:10:27,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106265769] [2019-12-07 17:10:27,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:27,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:27,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:27,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:27,166 INFO L87 Difference]: Start difference. First operand 60527 states and 94433 transitions. Second operand 8 states. [2019-12-07 17:10:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:30,104 INFO L93 Difference]: Finished difference Result 112746 states and 175557 transitions. [2019-12-07 17:10:30,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:10:30,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 577 [2019-12-07 17:10:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:30,165 INFO L225 Difference]: With dead ends: 112746 [2019-12-07 17:10:30,165 INFO L226 Difference]: Without dead ends: 66702 [2019-12-07 17:10:30,190 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 578 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66702 states. [2019-12-07 17:10:32,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66702 to 60527. [2019-12-07 17:10:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60527 states. [2019-12-07 17:10:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60527 states to 60527 states and 94108 transitions. [2019-12-07 17:10:32,171 INFO L78 Accepts]: Start accepts. Automaton has 60527 states and 94108 transitions. Word has length 577 [2019-12-07 17:10:32,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:32,171 INFO L462 AbstractCegarLoop]: Abstraction has 60527 states and 94108 transitions. [2019-12-07 17:10:32,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:32,171 INFO L276 IsEmpty]: Start isEmpty. Operand 60527 states and 94108 transitions. [2019-12-07 17:10:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2019-12-07 17:10:32,216 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:32,216 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:32,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:32,417 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:32,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:32,417 INFO L82 PathProgramCache]: Analyzing trace with hash 736816701, now seen corresponding path program 1 times [2019-12-07 17:10:32,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:32,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132016480] [2019-12-07 17:10:32,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3147 backedges. 1135 proven. 57 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2019-12-07 17:10:32,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132016480] [2019-12-07 17:10:32,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929614077] [2019-12-07 17:10:32,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:32,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 1889 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:10:32,903 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:32,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:10:32,911 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:32,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:10:32,926 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:10:32,926 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:10:32,926 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:32,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,931 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:10:32,945 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:10:32,945 INFO L377 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 28 treesize of output 10 [2019-12-07 17:10:32,945 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,946 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:32,946 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:32,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:10:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3147 backedges. 1135 proven. 57 refuted. 0 times theorem prover too weak. 1955 trivial. 0 not checked. [2019-12-07 17:10:33,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:10:33,115 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-12-07 17:10:33,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222254442] [2019-12-07 17:10:33,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:33,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:33,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:33,116 INFO L87 Difference]: Start difference. First operand 60527 states and 94108 transitions. Second operand 8 states. [2019-12-07 17:10:36,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:36,047 INFO L93 Difference]: Finished difference Result 112746 states and 174920 transitions. [2019-12-07 17:10:36,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:10:36,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 578 [2019-12-07 17:10:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:36,113 INFO L225 Difference]: With dead ends: 112746 [2019-12-07 17:10:36,113 INFO L226 Difference]: Without dead ends: 66702 [2019-12-07 17:10:36,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:36,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66702 states. [2019-12-07 17:10:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66702 to 59006. [2019-12-07 17:10:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59006 states. [2019-12-07 17:10:38,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 91560 transitions. [2019-12-07 17:10:38,083 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 91560 transitions. Word has length 578 [2019-12-07 17:10:38,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:38,083 INFO L462 AbstractCegarLoop]: Abstraction has 59006 states and 91560 transitions. [2019-12-07 17:10:38,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:38,083 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 91560 transitions. [2019-12-07 17:10:38,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2019-12-07 17:10:38,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:38,132 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:38,332 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:38,333 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:38,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1083688695, now seen corresponding path program 1 times [2019-12-07 17:10:38,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:38,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728585101] [2019-12-07 17:10:38,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:38,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:38,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3163 backedges. 1140 proven. 55 refuted. 0 times theorem prover too weak. 1968 trivial. 0 not checked. [2019-12-07 17:10:38,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728585101] [2019-12-07 17:10:38,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707675640] [2019-12-07 17:10:38,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:38,840 INFO L264 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:10:38,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:38,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:10:38,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:38,855 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,856 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:10:38,868 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:10:38,868 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:10:38,868 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:38,871 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:10:38,882 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:10:38,882 INFO L377 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 28 treesize of output 10 [2019-12-07 17:10:38,882 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:38,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:38,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:10:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3163 backedges. 1140 proven. 55 refuted. 0 times theorem prover too weak. 1968 trivial. 0 not checked. [2019-12-07 17:10:39,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:10:39,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-12-07 17:10:39,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140512168] [2019-12-07 17:10:39,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:39,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:39,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:39,054 INFO L87 Difference]: Start difference. First operand 59006 states and 91560 transitions. Second operand 8 states. [2019-12-07 17:10:42,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:42,072 INFO L93 Difference]: Finished difference Result 110042 states and 170331 transitions. [2019-12-07 17:10:42,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:10:42,073 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 579 [2019-12-07 17:10:42,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:42,129 INFO L225 Difference]: With dead ends: 110042 [2019-12-07 17:10:42,129 INFO L226 Difference]: Without dead ends: 65181 [2019-12-07 17:10:42,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 580 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:42,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65181 states. [2019-12-07 17:10:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65181 to 59006. [2019-12-07 17:10:43,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59006 states. [2019-12-07 17:10:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 91118 transitions. [2019-12-07 17:10:44,028 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 91118 transitions. Word has length 579 [2019-12-07 17:10:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:44,029 INFO L462 AbstractCegarLoop]: Abstraction has 59006 states and 91118 transitions. [2019-12-07 17:10:44,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 91118 transitions. [2019-12-07 17:10:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 581 [2019-12-07 17:10:44,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:44,078 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:44,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:44,279 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1756031848, now seen corresponding path program 1 times [2019-12-07 17:10:44,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:44,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337185149] [2019-12-07 17:10:44,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3179 backedges. 1145 proven. 53 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2019-12-07 17:10:44,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337185149] [2019-12-07 17:10:44,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109634995] [2019-12-07 17:10:44,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:44,818 INFO L264 TraceCheckSpWp]: Trace formula consists of 1895 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:10:44,823 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:10:44,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:10:44,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:44,833 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:10:44,843 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:10:44,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:10:44,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:44,847 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,847 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:10:44,858 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:10:44,858 INFO L377 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 28 treesize of output 10 [2019-12-07 17:10:44,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:10:44,859 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:10:44,859 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:10:45,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3179 backedges. 1145 proven. 53 refuted. 0 times theorem prover too weak. 1981 trivial. 0 not checked. [2019-12-07 17:10:45,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:10:45,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-12-07 17:10:45,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699354413] [2019-12-07 17:10:45,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:10:45,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:45,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:10:45,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:10:45,029 INFO L87 Difference]: Start difference. First operand 59006 states and 91118 transitions. Second operand 8 states. [2019-12-07 17:10:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:47,981 INFO L93 Difference]: Finished difference Result 109522 states and 168862 transitions. [2019-12-07 17:10:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:10:47,982 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 580 [2019-12-07 17:10:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:48,037 INFO L225 Difference]: With dead ends: 109522 [2019-12-07 17:10:48,037 INFO L226 Difference]: Without dead ends: 64661 [2019-12-07 17:10:48,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 581 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:10:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64661 states. [2019-12-07 17:10:49,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64661 to 59006. [2019-12-07 17:10:49,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59006 states. [2019-12-07 17:10:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 90676 transitions. [2019-12-07 17:10:49,971 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 90676 transitions. Word has length 580 [2019-12-07 17:10:49,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:49,972 INFO L462 AbstractCegarLoop]: Abstraction has 59006 states and 90676 transitions. [2019-12-07 17:10:49,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:10:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 90676 transitions. [2019-12-07 17:10:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-12-07 17:10:50,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:50,021 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:50,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:10:50,222 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:50,222 INFO L82 PathProgramCache]: Analyzing trace with hash 875575216, now seen corresponding path program 1 times [2019-12-07 17:10:50,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:50,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272895724] [2019-12-07 17:10:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3285 backedges. 1360 proven. 0 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-12-07 17:10:50,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272895724] [2019-12-07 17:10:50,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:50,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:50,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357732736] [2019-12-07 17:10:50,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:50,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:50,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:50,496 INFO L87 Difference]: Start difference. First operand 59006 states and 90676 transitions. Second operand 4 states. [2019-12-07 17:10:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:53,500 INFO L93 Difference]: Finished difference Result 122660 states and 187557 transitions. [2019-12-07 17:10:53,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:53,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 584 [2019-12-07 17:10:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:53,562 INFO L225 Difference]: With dead ends: 122660 [2019-12-07 17:10:53,562 INFO L226 Difference]: Without dead ends: 63673 [2019-12-07 17:10:53,590 INFO L630 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 [2019-12-07 17:10:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63673 states. [2019-12-07 17:10:55,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63673 to 59006. [2019-12-07 17:10:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59006 states. [2019-12-07 17:10:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 90559 transitions. [2019-12-07 17:10:55,521 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 90559 transitions. Word has length 584 [2019-12-07 17:10:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:10:55,521 INFO L462 AbstractCegarLoop]: Abstraction has 59006 states and 90559 transitions. [2019-12-07 17:10:55,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:10:55,521 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 90559 transitions. [2019-12-07 17:10:55,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-12-07 17:10:55,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:10:55,570 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:10:55,570 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:10:55,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:10:55,570 INFO L82 PathProgramCache]: Analyzing trace with hash 267755409, now seen corresponding path program 1 times [2019-12-07 17:10:55,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:10:55,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919347306] [2019-12-07 17:10:55,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:10:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:10:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3299 backedges. 1374 proven. 0 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-12-07 17:10:55,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919347306] [2019-12-07 17:10:55,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:10:55,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:10:55,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243389971] [2019-12-07 17:10:55,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:10:55,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:10:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:10:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:10:55,815 INFO L87 Difference]: Start difference. First operand 59006 states and 90559 transitions. Second operand 4 states. [2019-12-07 17:10:58,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:10:58,743 INFO L93 Difference]: Finished difference Result 122192 states and 186639 transitions. [2019-12-07 17:10:58,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:10:58,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 585 [2019-12-07 17:10:58,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:10:58,799 INFO L225 Difference]: With dead ends: 122192 [2019-12-07 17:10:58,799 INFO L226 Difference]: Without dead ends: 63205 [2019-12-07 17:10:58,827 INFO L630 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 [2019-12-07 17:10:58,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63205 states. [2019-12-07 17:11:00,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63205 to 59006. [2019-12-07 17:11:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59006 states. [2019-12-07 17:11:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59006 states to 59006 states and 90442 transitions. [2019-12-07 17:11:00,762 INFO L78 Accepts]: Start accepts. Automaton has 59006 states and 90442 transitions. Word has length 585 [2019-12-07 17:11:00,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:00,762 INFO L462 AbstractCegarLoop]: Abstraction has 59006 states and 90442 transitions. [2019-12-07 17:11:00,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59006 states and 90442 transitions. [2019-12-07 17:11:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2019-12-07 17:11:00,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:00,811 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:00,811 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:00,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:00,811 INFO L82 PathProgramCache]: Analyzing trace with hash -893467652, now seen corresponding path program 1 times [2019-12-07 17:11:00,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:00,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160062163] [2019-12-07 17:11:00,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:01,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 1339 proven. 51 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2019-12-07 17:11:01,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160062163] [2019-12-07 17:11:01,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828528764] [2019-12-07 17:11:01,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:11:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:01,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 1924 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:11:01,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:01,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:11:01,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:01,382 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:01,382 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:01,382 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:11:01,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:11:01,391 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:01,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:01,393 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:01,393 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:11:01,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2019-12-07 17:11:01,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:11:01,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 17:11:01,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226092389] [2019-12-07 17:11:01,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:01,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:11:01,553 INFO L87 Difference]: Start difference. First operand 59006 states and 90442 transitions. Second operand 4 states. [2019-12-07 17:11:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:04,464 INFO L93 Difference]: Finished difference Result 122192 states and 186405 transitions. [2019-12-07 17:11:04,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:11:04,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 589 [2019-12-07 17:11:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:04,521 INFO L225 Difference]: With dead ends: 122192 [2019-12-07 17:11:04,521 INFO L226 Difference]: Without dead ends: 63205 [2019-12-07 17:11:04,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 597 GetRequests, 590 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:11:04,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63205 states. [2019-12-07 17:11:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63205 to 59123. [2019-12-07 17:11:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59123 states. [2019-12-07 17:11:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59123 states to 59123 states and 90559 transitions. [2019-12-07 17:11:06,528 INFO L78 Accepts]: Start accepts. Automaton has 59123 states and 90559 transitions. Word has length 589 [2019-12-07 17:11:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:06,528 INFO L462 AbstractCegarLoop]: Abstraction has 59123 states and 90559 transitions. [2019-12-07 17:11:06,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:06,528 INFO L276 IsEmpty]: Start isEmpty. Operand 59123 states and 90559 transitions. [2019-12-07 17:11:06,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2019-12-07 17:11:06,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:06,576 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 15, 15, 15, 14, 14, 13, 13, 12, 12, 11, 11, 11, 11, 10, 10, 9, 8, 8, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:06,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:11:06,778 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:06,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:06,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1724143298, now seen corresponding path program 1 times [2019-12-07 17:11:06,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:06,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518960582] [2019-12-07 17:11:06,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:07,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 1339 proven. 51 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2019-12-07 17:11:07,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518960582] [2019-12-07 17:11:07,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649580607] [2019-12-07 17:11:07,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:11:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:07,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 1927 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:11:07,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:07,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:11:07,331 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:07,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:07,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:07,333 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:11:07,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:11:07,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:07,342 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:07,342 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:07,342 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:11:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 872 proven. 0 refuted. 0 times theorem prover too weak. 2538 trivial. 0 not checked. [2019-12-07 17:11:07,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:11:07,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-12-07 17:11:07,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391441729] [2019-12-07 17:11:07,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:07,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:07,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:11:07,517 INFO L87 Difference]: Start difference. First operand 59123 states and 90559 transitions. Second operand 4 states. [2019-12-07 17:11:10,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:10,385 INFO L93 Difference]: Finished difference Result 121841 states and 185883 transitions. [2019-12-07 17:11:10,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:11:10,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 590 [2019-12-07 17:11:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:10,436 INFO L225 Difference]: With dead ends: 121841 [2019-12-07 17:11:10,436 INFO L226 Difference]: Without dead ends: 62035 [2019-12-07 17:11:10,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:11:10,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62035 states. [2019-12-07 17:11:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62035 to 58278. [2019-12-07 17:11:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58278 states. [2019-12-07 17:11:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58278 states to 58278 states and 89467 transitions. [2019-12-07 17:11:12,376 INFO L78 Accepts]: Start accepts. Automaton has 58278 states and 89467 transitions. Word has length 590 [2019-12-07 17:11:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:12,376 INFO L462 AbstractCegarLoop]: Abstraction has 58278 states and 89467 transitions. [2019-12-07 17:11:12,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 58278 states and 89467 transitions. [2019-12-07 17:11:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-12-07 17:11:12,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:12,425 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:12,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:11:12,626 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:12,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1909570555, now seen corresponding path program 1 times [2019-12-07 17:11:12,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:12,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598697873] [2019-12-07 17:11:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 1479 proven. 0 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-12-07 17:11:12,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598697873] [2019-12-07 17:11:12,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:12,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:11:12,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875759883] [2019-12-07 17:11:12,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:12,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:12,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:12,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:11:12,914 INFO L87 Difference]: Start difference. First operand 58278 states and 89467 transitions. Second operand 4 states. [2019-12-07 17:11:15,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:15,791 INFO L93 Difference]: Finished difference Result 119943 states and 183504 transitions. [2019-12-07 17:11:15,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:11:15,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 591 [2019-12-07 17:11:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:15,847 INFO L225 Difference]: With dead ends: 119943 [2019-12-07 17:11:15,847 INFO L226 Difference]: Without dead ends: 61684 [2019-12-07 17:11:15,868 INFO L630 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 [2019-12-07 17:11:15,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61684 states. [2019-12-07 17:11:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61684 to 58278. [2019-12-07 17:11:17,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58278 states. [2019-12-07 17:11:17,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58278 states to 58278 states and 89350 transitions. [2019-12-07 17:11:17,794 INFO L78 Accepts]: Start accepts. Automaton has 58278 states and 89350 transitions. Word has length 591 [2019-12-07 17:11:17,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:17,795 INFO L462 AbstractCegarLoop]: Abstraction has 58278 states and 89350 transitions. [2019-12-07 17:11:17,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:17,795 INFO L276 IsEmpty]: Start isEmpty. Operand 58278 states and 89350 transitions. [2019-12-07 17:11:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2019-12-07 17:11:17,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:17,847 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 12, 12, 10, 10, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:17,847 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash 207888851, now seen corresponding path program 2 times [2019-12-07 17:11:17,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:17,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311051329] [2019-12-07 17:11:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 1665 proven. 0 refuted. 0 times theorem prover too weak. 1739 trivial. 0 not checked. [2019-12-07 17:11:18,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311051329] [2019-12-07 17:11:18,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:18,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:11:18,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717768321] [2019-12-07 17:11:18,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:11:18,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:18,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:11:18,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:11:18,116 INFO L87 Difference]: Start difference. First operand 58278 states and 89350 transitions. Second operand 5 states. [2019-12-07 17:11:21,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:21,336 INFO L93 Difference]: Finished difference Result 123730 states and 188753 transitions. [2019-12-07 17:11:21,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:11:21,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 591 [2019-12-07 17:11:21,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:21,398 INFO L225 Difference]: With dead ends: 123730 [2019-12-07 17:11:21,398 INFO L226 Difference]: Without dead ends: 65471 [2019-12-07 17:11:21,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:11:21,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65471 states. [2019-12-07 17:11:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65471 to 55834. [2019-12-07 17:11:23,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55834 states. [2019-12-07 17:11:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55834 states to 55834 states and 85125 transitions. [2019-12-07 17:11:23,411 INFO L78 Accepts]: Start accepts. Automaton has 55834 states and 85125 transitions. Word has length 591 [2019-12-07 17:11:23,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:23,411 INFO L462 AbstractCegarLoop]: Abstraction has 55834 states and 85125 transitions. [2019-12-07 17:11:23,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:11:23,411 INFO L276 IsEmpty]: Start isEmpty. Operand 55834 states and 85125 transitions. [2019-12-07 17:11:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-12-07 17:11:23,456 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:23,457 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 13, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:23,457 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:23,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:23,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1327408345, now seen corresponding path program 1 times [2019-12-07 17:11:23,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:23,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992575040] [2019-12-07 17:11:23,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3599 backedges. 867 proven. 0 refuted. 0 times theorem prover too weak. 2732 trivial. 0 not checked. [2019-12-07 17:11:23,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992575040] [2019-12-07 17:11:23,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:23,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:11:23,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500749488] [2019-12-07 17:11:23,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:11:23,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:11:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:11:23,659 INFO L87 Difference]: Start difference. First operand 55834 states and 85125 transitions. Second operand 4 states. [2019-12-07 17:11:26,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:26,115 INFO L93 Difference]: Finished difference Result 113560 states and 172774 transitions. [2019-12-07 17:11:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:11:26,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 604 [2019-12-07 17:11:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:26,167 INFO L225 Difference]: With dead ends: 113560 [2019-12-07 17:11:26,167 INFO L226 Difference]: Without dead ends: 57745 [2019-12-07 17:11:26,192 INFO L630 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 [2019-12-07 17:11:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57745 states. [2019-12-07 17:11:28,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57745 to 55834. [2019-12-07 17:11:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55834 states. [2019-12-07 17:11:28,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55834 states to 55834 states and 85008 transitions. [2019-12-07 17:11:28,129 INFO L78 Accepts]: Start accepts. Automaton has 55834 states and 85008 transitions. Word has length 604 [2019-12-07 17:11:28,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:28,130 INFO L462 AbstractCegarLoop]: Abstraction has 55834 states and 85008 transitions. [2019-12-07 17:11:28,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:11:28,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55834 states and 85008 transitions. [2019-12-07 17:11:28,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-12-07 17:11:28,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:28,177 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:28,177 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:28,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1645226878, now seen corresponding path program 1 times [2019-12-07 17:11:28,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:28,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327311179] [2019-12-07 17:11:28,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 2073 proven. 0 refuted. 0 times theorem prover too weak. 1625 trivial. 0 not checked. [2019-12-07 17:11:28,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327311179] [2019-12-07 17:11:28,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:11:28,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:11:28,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767307113] [2019-12-07 17:11:28,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:11:28,651 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:28,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:11:28,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:11:28,651 INFO L87 Difference]: Start difference. First operand 55834 states and 85008 transitions. Second operand 5 states. [2019-12-07 17:11:31,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:31,911 INFO L93 Difference]: Finished difference Result 139976 states and 213151 transitions. [2019-12-07 17:11:31,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:11:31,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 604 [2019-12-07 17:11:31,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:31,986 INFO L225 Difference]: With dead ends: 139976 [2019-12-07 17:11:31,986 INFO L226 Difference]: Without dead ends: 84003 [2019-12-07 17:11:32,017 INFO L630 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 [2019-12-07 17:11:32,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84003 states. [2019-12-07 17:11:35,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84003 to 83050. [2019-12-07 17:11:35,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83050 states. [2019-12-07 17:11:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83050 states to 83050 states and 126453 transitions. [2019-12-07 17:11:35,102 INFO L78 Accepts]: Start accepts. Automaton has 83050 states and 126453 transitions. Word has length 604 [2019-12-07 17:11:35,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:11:35,103 INFO L462 AbstractCegarLoop]: Abstraction has 83050 states and 126453 transitions. [2019-12-07 17:11:35,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:11:35,103 INFO L276 IsEmpty]: Start isEmpty. Operand 83050 states and 126453 transitions. [2019-12-07 17:11:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2019-12-07 17:11:35,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:11:35,157 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:11:35,157 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:11:35,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:11:35,157 INFO L82 PathProgramCache]: Analyzing trace with hash 981234560, now seen corresponding path program 1 times [2019-12-07 17:11:35,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:11:35,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348540611] [2019-12-07 17:11:35,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:11:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:37,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 837 proven. 1914 refuted. 0 times theorem prover too weak. 947 trivial. 0 not checked. [2019-12-07 17:11:37,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348540611] [2019-12-07 17:11:37,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509066270] [2019-12-07 17:11:37,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:11:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:11:37,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 1954 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 17:11:37,793 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:11:37,823 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:11:37,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,854 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,855 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_187|], 2=[|v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.base_176|]} [2019-12-07 17:11:37,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:11:37,878 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:37,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:11:37,907 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,919 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,939 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:37,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:11:37,940 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,948 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,949 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,949 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:11:37,983 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:37,983 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:37,983 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:37,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:37,989 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:38,011 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:38,012 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:38,012 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,018 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,018 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:38,019 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_178|], 12=[|v_#memory_$Pointer$.base_190|]} [2019-12-07 17:11:38,020 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,065 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,066 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,066 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,073 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,073 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,096 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:38,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:38,096 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,102 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:38,122 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:38,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:38,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:38,131 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_179|], 12=[|v_#memory_$Pointer$.base_193|]} [2019-12-07 17:11:38,133 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,145 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,178 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,179 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,186 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,189 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_194|]} [2019-12-07 17:11:38,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:11:38,191 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,268 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:11:38,268 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:11:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,270 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,294 INFO L614 ElimStorePlain]: treesize reduction 201, result has 20.9 percent of original size [2019-12-07 17:11:38,294 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,294 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:11:38,296 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 17:11:38,297 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,342 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,342 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,349 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,350 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,353 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 12=[|v_#memory_$Pointer$.base_196|]} [2019-12-07 17:11:38,355 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:11:38,355 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,432 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:11:38,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:11:38,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:38,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,443 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 17:11:38,508 INFO L614 ElimStorePlain]: treesize reduction 2308, result has 2.2 percent of original size [2019-12-07 17:11:38,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,508 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:11:38,509 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_162|], 2=[|v_#memory_$Pointer$.base_182|], 6=[|v_#memory_$Pointer$.base_181|], 12=[|v_#memory_$Pointer$.base_197|]} [2019-12-07 17:11:38,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:11:38,513 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,535 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,554 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,569 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,570 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 176 treesize of output 126 [2019-12-07 17:11:38,590 INFO L343 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-12-07 17:11:38,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 149 [2019-12-07 17:11:38,591 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,629 INFO L614 ElimStorePlain]: treesize reduction 57, result has 68.7 percent of original size [2019-12-07 17:11:38,717 INFO L343 Elim1Store]: treesize reduction 340, result has 23.8 percent of original size [2019-12-07 17:11:38,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 125 treesize of output 128 [2019-12-07 17:11:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:38,719 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,738 INFO L614 ElimStorePlain]: treesize reduction 18, result has 81.1 percent of original size [2019-12-07 17:11:38,738 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,746 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,747 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,747 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:140, output treesize:53 [2019-12-07 17:11:38,771 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:38,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:38,772 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,778 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,778 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:38,782 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_183|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 17:11:38,783 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,829 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,841 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_184|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-12-07 17:11:38,842 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,885 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,886 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,893 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,893 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,897 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_185|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-12-07 17:11:38,898 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:38,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,943 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:11:38,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:11:38,944 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,950 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,951 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,951 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:11:38,974 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:38,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:38,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,980 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:38,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:38,981 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:39,001 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:11:39,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:11:39,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:39,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:39,007 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:39,007 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:11:39,012 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_166|], 20=[|v_#memory_$Pointer$.base_204|]} [2019-12-07 17:11:39,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:39,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2019-12-07 17:11:39,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:39,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:39,154 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-07 17:11:39,154 INFO L343 Elim1Store]: treesize reduction 100, result has 71.2 percent of original size [2019-12-07 17:11:39,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 311 [2019-12-07 17:11:39,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:39,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:39,576 INFO L534 ElimStorePlain]: Start of recursive call 3: 144 dim-0 vars, End of recursive call: 144 dim-0 vars, and 16 xjuncts. [2019-12-07 17:11:44,007 WARN L192 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 2621 DAG size of output: 398 [2019-12-07 17:11:44,008 INFO L614 ElimStorePlain]: treesize reduction 37866, result has 8.6 percent of original size [2019-12-07 17:11:44,011 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2019-12-07 17:11:44,011 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:3961 [2019-12-07 17:11:44,098 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.offset_163|], 20=[|v_#memory_$Pointer$.offset_167|], 30=[|v_#memory_$Pointer$.base_205|]} [2019-12-07 17:11:44,100 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:44,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,133 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:11:44,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 94 [2019-12-07 17:11:44,168 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,363 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-12-07 17:11:44,363 INFO L343 Elim1Store]: treesize reduction 114, result has 74.3 percent of original size [2019-12-07 17:11:44,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 417 [2019-12-07 17:11:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,369 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,580 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 48 [2019-12-07 17:11:44,580 INFO L614 ElimStorePlain]: treesize reduction 19733, result has 0.7 percent of original size [2019-12-07 17:11:44,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,581 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:207, output treesize:131 [2019-12-07 17:11:44,588 INFO L430 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_168|], 30=[|v_#memory_$Pointer$.base_206|]} [2019-12-07 17:11:44,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,592 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 85 [2019-12-07 17:11:44,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,696 INFO L343 Elim1Store]: treesize reduction 344, result has 26.2 percent of original size [2019-12-07 17:11:44,696 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 174 [2019-12-07 17:11:44,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,697 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,729 INFO L614 ElimStorePlain]: treesize reduction 47, result has 73.6 percent of original size [2019-12-07 17:11:44,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,729 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:169, output treesize:131 [2019-12-07 17:11:44,731 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_186|], 20=[|v_#memory_$Pointer$.offset_169|], 30=[|v_#memory_$Pointer$.base_207|]} [2019-12-07 17:11:44,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 21 [2019-12-07 17:11:44,736 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:44,771 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:44,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 201 [2019-12-07 17:11:44,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:44,809 INFO L614 ElimStorePlain]: treesize reduction 80, result has 71.5 percent of original size [2019-12-07 17:11:44,988 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-12-07 17:11:44,988 INFO L343 Elim1Store]: treesize reduction 198, result has 65.4 percent of original size [2019-12-07 17:11:44,989 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 468 [2019-12-07 17:11:44,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:44,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:45,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:45,229 INFO L534 ElimStorePlain]: Start of recursive call 4: 18 dim-0 vars, End of recursive call: 18 dim-0 vars, and 16 xjuncts. [2019-12-07 17:11:47,509 WARN L192 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 471 DAG size of output: 335 [2019-12-07 17:11:47,510 INFO L614 ElimStorePlain]: treesize reduction 16493, result has 15.7 percent of original size [2019-12-07 17:11:47,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 10 xjuncts. [2019-12-07 17:11:47,513 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:3448 [2019-12-07 17:11:47,723 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 47 [2019-12-07 17:11:47,726 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_187|], 20=[|v_#memory_$Pointer$.offset_170|], 30=[|v_#memory_$Pointer$.base_208|]} [2019-12-07 17:11:47,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-12-07 17:11:47,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:47,763 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:47,767 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 100 [2019-12-07 17:11:47,771 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:47,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:47,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:47,916 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 17:11:47,917 INFO L343 Elim1Store]: treesize reduction 80, result has 73.9 percent of original size [2019-12-07 17:11:47,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 321 [2019-12-07 17:11:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:47,921 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,094 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 53 [2019-12-07 17:11:48,095 INFO L614 ElimStorePlain]: treesize reduction 8527, result has 1.9 percent of original size [2019-12-07 17:11:48,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,095 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:161 [2019-12-07 17:11:48,153 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_188|], 20=[|v_#memory_$Pointer$.offset_171|], 30=[|v_#memory_$Pointer$.base_209|]} [2019-12-07 17:11:48,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,159 INFO L377 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 62 treesize of output 46 [2019-12-07 17:11:48,159 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,225 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:48,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 121 [2019-12-07 17:11:48,233 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:11:48,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:11:48,401 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 17:11:48,401 INFO L343 Elim1Store]: treesize reduction 80, result has 73.9 percent of original size [2019-12-07 17:11:48,402 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 198 treesize of output 342 [2019-12-07 17:11:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:48,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:11:48,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:11:48,407 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,511 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 57 [2019-12-07 17:11:48,512 INFO L614 ElimStorePlain]: treesize reduction 6021, result has 3.0 percent of original size [2019-12-07 17:11:48,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:11:48,512 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:230, output treesize:188 [2019-12-07 17:11:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 2375 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-12-07 17:11:50,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:11:50,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2019-12-07 17:11:50,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933594454] [2019-12-07 17:11:50,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:11:50,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:11:50,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:11:50,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:11:50,622 INFO L87 Difference]: Start difference. First operand 83050 states and 126453 transitions. Second operand 8 states. [2019-12-07 17:11:56,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:11:56,657 INFO L93 Difference]: Finished difference Result 194737 states and 295673 transitions. [2019-12-07 17:11:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:11:56,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 604 [2019-12-07 17:11:56,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:11:56,878 INFO L225 Difference]: With dead ends: 194737 [2019-12-07 17:11:56,879 INFO L226 Difference]: Without dead ends: 111706 [2019-12-07 17:11:56,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 610 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:11:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111706 states. [2019-12-07 17:12:00,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111706 to 108463. [2019-12-07 17:12:00,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108463 states. [2019-12-07 17:12:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108463 states to 108463 states and 165009 transitions. [2019-12-07 17:12:00,897 INFO L78 Accepts]: Start accepts. Automaton has 108463 states and 165009 transitions. Word has length 604 [2019-12-07 17:12:00,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:00,898 INFO L462 AbstractCegarLoop]: Abstraction has 108463 states and 165009 transitions. [2019-12-07 17:12:00,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:12:00,898 INFO L276 IsEmpty]: Start isEmpty. Operand 108463 states and 165009 transitions. [2019-12-07 17:12:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-12-07 17:12:00,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:00,972 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 13, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:01,173 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:12:01,174 INFO L410 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:01,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:01,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2041173384, now seen corresponding path program 1 times [2019-12-07 17:12:01,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:01,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48364124] [2019-12-07 17:12:01,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:01,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3616 backedges. 884 proven. 0 refuted. 0 times theorem prover too weak. 2732 trivial. 0 not checked. [2019-12-07 17:12:01,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48364124] [2019-12-07 17:12:01,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:01,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:12:01,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81636306] [2019-12-07 17:12:01,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:12:01,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:01,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:12:01,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:12:01,514 INFO L87 Difference]: Start difference. First operand 108463 states and 165009 transitions. Second operand 4 states. [2019-12-07 17:12:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:06,463 INFO L93 Difference]: Finished difference Result 220481 states and 334889 transitions. [2019-12-07 17:12:06,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:12:06,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 605 [2019-12-07 17:12:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:06,576 INFO L225 Difference]: With dead ends: 220481 [2019-12-07 17:12:06,576 INFO L226 Difference]: Without dead ends: 112037 [2019-12-07 17:12:06,615 INFO L630 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 [2019-12-07 17:12:06,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112037 states. [2019-12-07 17:12:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112037 to 108463. [2019-12-07 17:12:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108463 states. [2019-12-07 17:12:10,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108463 states to 108463 states and 164769 transitions. [2019-12-07 17:12:10,829 INFO L78 Accepts]: Start accepts. Automaton has 108463 states and 164769 transitions. Word has length 605 [2019-12-07 17:12:10,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:10,829 INFO L462 AbstractCegarLoop]: Abstraction has 108463 states and 164769 transitions. [2019-12-07 17:12:10,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:12:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 108463 states and 164769 transitions. [2019-12-07 17:12:10,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2019-12-07 17:12:10,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:10,892 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:10,892 INFO L410 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:10,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:10,893 INFO L82 PathProgramCache]: Analyzing trace with hash 224196102, now seen corresponding path program 1 times [2019-12-07 17:12:10,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:10,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375934559] [2019-12-07 17:12:10,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3702 backedges. 837 proven. 2489 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-12-07 17:12:13,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375934559] [2019-12-07 17:12:13,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189199710] [2019-12-07 17:12:13,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:12:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:13,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 1957 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-07 17:12:13,634 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:13,666 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,666 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:12:13,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,707 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_221|], 2=[|v_#memory_$Pointer$.base_211|, |v_#memory_$Pointer$.base_210|]} [2019-12-07 17:12:13,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:12:13,730 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:13,757 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:12:13,757 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,790 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:13,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:12:13,790 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,799 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,799 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:12:13,836 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:13,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:13,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:13,862 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:13,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:13,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:13,869 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_212|], 12=[|v_#memory_$Pointer$.base_224|]} [2019-12-07 17:12:13,870 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:13,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,914 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:13,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:13,915 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,921 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:13,946 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:13,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:13,946 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,952 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:13,974 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:13,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:13,974 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:13,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:13,980 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:13,982 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_213|], 12=[|v_#memory_$Pointer$.base_227|]} [2019-12-07 17:12:13,984 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:13,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,026 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:14,026 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:14,026 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,033 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:14,036 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_174|], 12=[|v_#memory_$Pointer$.base_228|]} [2019-12-07 17:12:14,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:12:14,038 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,117 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:12:14,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:12:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,129 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-12-07 17:12:14,198 INFO L614 ElimStorePlain]: treesize reduction 1602, result has 3.2 percent of original size [2019-12-07 17:12:14,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,198 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:12:14,200 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_214|], 12=[|v_#memory_$Pointer$.base_229|]} [2019-12-07 17:12:14,201 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,213 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,245 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:14,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:14,245 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,252 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:14,255 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_175|], 12=[|v_#memory_$Pointer$.base_230|]} [2019-12-07 17:12:14,258 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:12:14,258 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,336 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:12:14,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:12:14,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,338 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,362 INFO L614 ElimStorePlain]: treesize reduction 201, result has 20.9 percent of original size [2019-12-07 17:12:14,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,362 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:12:14,363 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_172|], 2=[|v_#memory_$Pointer$.base_216|], 6=[|v_#memory_$Pointer$.base_215|], 12=[|v_#memory_$Pointer$.base_231|]} [2019-12-07 17:12:14,366 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:12:14,367 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,387 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,404 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,406 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,422 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 176 treesize of output 126 [2019-12-07 17:12:14,447 INFO L343 Elim1Store]: treesize reduction 114, result has 19.7 percent of original size [2019-12-07 17:12:14,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 149 [2019-12-07 17:12:14,448 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,484 INFO L614 ElimStorePlain]: treesize reduction 57, result has 68.7 percent of original size [2019-12-07 17:12:14,603 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 51 [2019-12-07 17:12:14,603 INFO L343 Elim1Store]: treesize reduction 340, result has 23.8 percent of original size [2019-12-07 17:12:14,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 125 treesize of output 128 [2019-12-07 17:12:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:14,605 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,615 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,616 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,626 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:140, output treesize:53 [2019-12-07 17:12:14,652 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:14,652 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:14,652 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,660 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,660 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:14,665 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_217|], 12=[|v_#memory_$Pointer$.base_233|]} [2019-12-07 17:12:14,667 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,720 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:14,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:14,720 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,727 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:14,730 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_218|], 12=[|v_#memory_$Pointer$.base_234|]} [2019-12-07 17:12:14,732 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,776 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:14,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:14,776 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,783 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:14,786 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_219|], 12=[|v_#memory_$Pointer$.base_235|]} [2019-12-07 17:12:14,788 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:14,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,831 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:12:14,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:12:14,832 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:12:14,861 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:14,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:14,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,868 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,868 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,868 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:14,891 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:12:14,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:12:14,891 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:14,897 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,897 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:12:14,901 INFO L430 ElimStorePlain]: Different costs {12=[|v_#memory_$Pointer$.offset_176|], 20=[|v_#memory_$Pointer$.base_238|]} [2019-12-07 17:12:14,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:14,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2019-12-07 17:12:14,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:14,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:15,046 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-12-07 17:12:15,046 INFO L343 Elim1Store]: treesize reduction 100, result has 71.2 percent of original size [2019-12-07 17:12:15,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 311 [2019-12-07 17:12:15,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:15,766 INFO L534 ElimStorePlain]: Start of recursive call 3: 270 dim-0 vars, End of recursive call: 270 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:18,367 WARN L192 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 4773 DAG size of output: 41 [2019-12-07 17:12:18,368 INFO L614 ElimStorePlain]: treesize reduction 76319, result has 0.2 percent of original size [2019-12-07 17:12:18,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:18,368 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:151, output treesize:131 [2019-12-07 17:12:18,397 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_220|, |v_#memory_$Pointer$.offset_173|], 20=[|v_#memory_$Pointer$.offset_177|], 30=[|v_#memory_$Pointer$.base_239|]} [2019-12-07 17:12:18,399 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:18,429 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:18,431 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:18,456 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:18,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 94 [2019-12-07 17:12:18,466 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:18,486 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:18,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,667 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 86 [2019-12-07 17:12:18,667 INFO L343 Elim1Store]: treesize reduction 114, result has 74.3 percent of original size [2019-12-07 17:12:18,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 417 [2019-12-07 17:12:18,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:18,672 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:18,884 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 48 [2019-12-07 17:12:18,885 INFO L614 ElimStorePlain]: treesize reduction 11141, result has 1.3 percent of original size [2019-12-07 17:12:18,885 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:18,885 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:207, output treesize:131 [2019-12-07 17:12:18,892 INFO L430 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_178|], 30=[|v_#memory_$Pointer$.base_240|]} [2019-12-07 17:12:18,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:18,897 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 85 [2019-12-07 17:12:18,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:18,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:18,991 INFO L343 Elim1Store]: treesize reduction 344, result has 26.2 percent of original size [2019-12-07 17:12:18,991 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 150 treesize of output 174 [2019-12-07 17:12:18,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:18,992 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,017 INFO L614 ElimStorePlain]: treesize reduction 47, result has 73.6 percent of original size [2019-12-07 17:12:19,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,018 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:169, output treesize:131 [2019-12-07 17:12:19,019 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_189|], 20=[|v_#memory_$Pointer$.offset_179|], 30=[|v_#memory_$Pointer$.base_241|]} [2019-12-07 17:12:19,023 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 21 [2019-12-07 17:12:19,023 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,045 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:19,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:19,057 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 201 [2019-12-07 17:12:19,058 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,095 INFO L614 ElimStorePlain]: treesize reduction 80, result has 71.5 percent of original size [2019-12-07 17:12:19,279 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 84 [2019-12-07 17:12:19,279 INFO L343 Elim1Store]: treesize reduction 198, result has 65.4 percent of original size [2019-12-07 17:12:19,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 468 [2019-12-07 17:12:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,299 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 21 xjuncts. [2019-12-07 17:12:19,652 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 47 [2019-12-07 17:12:19,653 INFO L614 ElimStorePlain]: treesize reduction 21693, result has 0.7 percent of original size [2019-12-07 17:12:19,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,653 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:260, output treesize:152 [2019-12-07 17:12:19,687 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_int_190|], 20=[|v_#memory_$Pointer$.offset_180|], 30=[|v_#memory_$Pointer$.base_242|]} [2019-12-07 17:12:19,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2019-12-07 17:12:19,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,715 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:19,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 100 [2019-12-07 17:12:19,721 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:19,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:19,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:19,862 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 17:12:19,862 INFO L343 Elim1Store]: treesize reduction 80, result has 73.9 percent of original size [2019-12-07 17:12:19,862 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 321 [2019-12-07 17:12:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:19,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:19,867 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,049 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 53 [2019-12-07 17:12:20,050 INFO L614 ElimStorePlain]: treesize reduction 12711, result has 1.3 percent of original size [2019-12-07 17:12:20,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,050 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:203, output treesize:161 [2019-12-07 17:12:20,096 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_int_191|], 20=[|v_#memory_$Pointer$.offset_181|], 30=[|v_#memory_$Pointer$.base_243|]} [2019-12-07 17:12:20,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,101 INFO L377 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 62 treesize of output 46 [2019-12-07 17:12:20,101 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:20,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,136 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 100 [2019-12-07 17:12:20,137 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,160 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:20,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:20,273 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-12-07 17:12:20,274 INFO L343 Elim1Store]: treesize reduction 80, result has 73.9 percent of original size [2019-12-07 17:12:20,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 171 treesize of output 321 [2019-12-07 17:12:20,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:20,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:12:20,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:20,278 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,368 INFO L614 ElimStorePlain]: treesize reduction 7210, result has 2.3 percent of original size [2019-12-07 17:12:20,368 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:20,368 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:230, output treesize:170 [2019-12-07 17:12:22,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3702 backedges. 2379 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2019-12-07 17:12:22,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:12:22,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2019-12-07 17:12:22,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135553972] [2019-12-07 17:12:22,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:12:22,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:22,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:12:22,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:12:22,493 INFO L87 Difference]: Start difference. First operand 108463 states and 164769 transitions. Second operand 8 states. [2019-12-07 17:12:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:28,836 INFO L93 Difference]: Finished difference Result 205469 states and 311476 transitions. [2019-12-07 17:12:28,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:12:28,837 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 605 [2019-12-07 17:12:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:28,944 INFO L225 Difference]: With dead ends: 205469 [2019-12-07 17:12:28,944 INFO L226 Difference]: Without dead ends: 111562 [2019-12-07 17:12:28,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 615 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:12:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111562 states. [2019-12-07 17:12:33,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111562 to 108307. [2019-12-07 17:12:33,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108307 states. [2019-12-07 17:12:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108307 states to 108307 states and 164483 transitions. [2019-12-07 17:12:33,136 INFO L78 Accepts]: Start accepts. Automaton has 108307 states and 164483 transitions. Word has length 605 [2019-12-07 17:12:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:33,136 INFO L462 AbstractCegarLoop]: Abstraction has 108307 states and 164483 transitions. [2019-12-07 17:12:33,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:12:33,136 INFO L276 IsEmpty]: Start isEmpty. Operand 108307 states and 164483 transitions. [2019-12-07 17:12:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2019-12-07 17:12:33,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:33,208 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 11, 10, 10, 9, 9, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:33,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:12:33,410 INFO L410 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:33,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:33,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1696914891, now seen corresponding path program 1 times [2019-12-07 17:12:33,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:33,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674634865] [2019-12-07 17:12:33,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 2156 proven. 108 refuted. 0 times theorem prover too weak. 1477 trivial. 0 not checked. [2019-12-07 17:12:33,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674634865] [2019-12-07 17:12:33,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219759974] [2019-12-07 17:12:33,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:12:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:34,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 1976 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:12:34,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:12:34,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:12:34,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,076 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,076 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:12:34,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:12:34,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,087 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,087 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:12:34,095 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_244|, |v_#memory_$Pointer$.offset_182|], 2=[|v_#memory_int_193|]} [2019-12-07 17:12:34,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 17:12:34,097 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:34,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 13 [2019-12-07 17:12:34,102 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:34,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,117 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-12-07 17:12:34,117 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,135 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 17:12:34,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:34,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:12:34,135 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 17:12:34,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:34,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:34,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:34,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:12:34,162 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:34,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,181 INFO L377 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 17:12:34,181 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,211 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-07 17:12:34,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:12:34,212 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 17:12:34,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:12:34,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:12:34,238 INFO L377 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 28 treesize of output 10 [2019-12-07 17:12:34,238 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,240 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:12:34,240 INFO L377 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 28 treesize of output 10 [2019-12-07 17:12:34,240 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:12:34,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:12:34,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:12:34,243 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 17:12:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 2012 proven. 24 refuted. 0 times theorem prover too weak. 1705 trivial. 0 not checked. [2019-12-07 17:12:34,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:12:34,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2019-12-07 17:12:34,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225853128] [2019-12-07 17:12:34,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:12:34,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:34,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:12:34,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:12:34,472 INFO L87 Difference]: Start difference. First operand 108307 states and 164483 transitions. Second operand 14 states. [2019-12-07 17:12:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:12:54,448 INFO L93 Difference]: Finished difference Result 298337 states and 448202 transitions. [2019-12-07 17:12:54,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:12:54,449 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 610 [2019-12-07 17:12:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:12:54,633 INFO L225 Difference]: With dead ends: 298337 [2019-12-07 17:12:54,633 INFO L226 Difference]: Without dead ends: 190049 [2019-12-07 17:12:54,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 609 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=699, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:12:54,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190049 states. [2019-12-07 17:12:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190049 to 109061. [2019-12-07 17:12:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109061 states. [2019-12-07 17:12:59,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109061 states to 109061 states and 165723 transitions. [2019-12-07 17:12:59,260 INFO L78 Accepts]: Start accepts. Automaton has 109061 states and 165723 transitions. Word has length 610 [2019-12-07 17:12:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:12:59,261 INFO L462 AbstractCegarLoop]: Abstraction has 109061 states and 165723 transitions. [2019-12-07 17:12:59,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:12:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 109061 states and 165723 transitions. [2019-12-07 17:12:59,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2019-12-07 17:12:59,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:12:59,333 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 11, 10, 10, 9, 9, 8, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:12:59,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:12:59,535 INFO L410 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:12:59,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:12:59,536 INFO L82 PathProgramCache]: Analyzing trace with hash -561451321, now seen corresponding path program 1 times [2019-12-07 17:12:59,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:12:59,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517641876] [2019-12-07 17:12:59,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:12:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:12:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 2018 proven. 0 refuted. 0 times theorem prover too weak. 1730 trivial. 0 not checked. [2019-12-07 17:12:59,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517641876] [2019-12-07 17:12:59,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:12:59,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:12:59,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311771274] [2019-12-07 17:12:59,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:12:59,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:12:59,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:12:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:12:59,932 INFO L87 Difference]: Start difference. First operand 109061 states and 165723 transitions. Second operand 7 states. [2019-12-07 17:13:10,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:13:10,987 INFO L93 Difference]: Finished difference Result 247302 states and 372283 transitions. [2019-12-07 17:13:10,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:13:10,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 611 [2019-12-07 17:13:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:13:11,117 INFO L225 Difference]: With dead ends: 247302 [2019-12-07 17:13:11,117 INFO L226 Difference]: Without dead ends: 137832 [2019-12-07 17:13:11,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:13:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137832 states. [2019-12-07 17:13:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137832 to 111731. [2019-12-07 17:13:15,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111731 states. [2019-12-07 17:13:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111731 states to 111731 states and 169733 transitions. [2019-12-07 17:13:15,574 INFO L78 Accepts]: Start accepts. Automaton has 111731 states and 169733 transitions. Word has length 611 [2019-12-07 17:13:15,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:13:15,574 INFO L462 AbstractCegarLoop]: Abstraction has 111731 states and 169733 transitions. [2019-12-07 17:13:15,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:13:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 111731 states and 169733 transitions. [2019-12-07 17:13:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-12-07 17:13:15,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:13:15,651 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:13:15,651 INFO L410 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:13:15,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:13:15,651 INFO L82 PathProgramCache]: Analyzing trace with hash -579905873, now seen corresponding path program 1 times [2019-12-07 17:13:15,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:13:15,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983844627] [2019-12-07 17:13:15,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:13:15,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3793 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-12-07 17:13:15,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983844627] [2019-12-07 17:13:15,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:13:15,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:13:15,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557073636] [2019-12-07 17:13:15,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:13:15,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:13:15,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:13:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:13:15,894 INFO L87 Difference]: Start difference. First operand 111731 states and 169733 transitions. Second operand 4 states. [2019-12-07 17:13:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:13:22,519 INFO L93 Difference]: Finished difference Result 234869 states and 355690 transitions. [2019-12-07 17:13:22,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:13:22,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 617 [2019-12-07 17:13:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:13:22,633 INFO L225 Difference]: With dead ends: 234869 [2019-12-07 17:13:22,633 INFO L226 Difference]: Without dead ends: 123157 [2019-12-07 17:13:22,670 INFO L630 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 [2019-12-07 17:13:22,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123157 states. [2019-12-07 17:13:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123157 to 113015. [2019-12-07 17:13:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113015 states. [2019-12-07 17:13:27,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113015 states to 113015 states and 171873 transitions. [2019-12-07 17:13:27,026 INFO L78 Accepts]: Start accepts. Automaton has 113015 states and 171873 transitions. Word has length 617 [2019-12-07 17:13:27,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:13:27,026 INFO L462 AbstractCegarLoop]: Abstraction has 113015 states and 171873 transitions. [2019-12-07 17:13:27,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:13:27,026 INFO L276 IsEmpty]: Start isEmpty. Operand 113015 states and 171873 transitions. [2019-12-07 17:13:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2019-12-07 17:13:27,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:13:27,102 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:13:27,102 INFO L410 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:13:27,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:13:27,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2131906369, now seen corresponding path program 1 times [2019-12-07 17:13:27,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:13:27,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313677458] [2019-12-07 17:13:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:13:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 2069 proven. 103 refuted. 0 times theorem prover too weak. 1721 trivial. 0 not checked. [2019-12-07 17:13:27,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313677458] [2019-12-07 17:13:27,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139158002] [2019-12-07 17:13:27,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:13:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:27,677 INFO L264 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:13:27,681 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:13:27,685 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:13:27,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,687 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:13:27,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:13:27,691 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,692 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:13:27,697 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_245|, |v_#memory_$Pointer$.offset_183|], 2=[|v_#memory_int_196|]} [2019-12-07 17:13:27,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 17:13:27,699 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:27,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 13 [2019-12-07 17:13:27,704 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:27,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,719 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,719 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-12-07 17:13:27,720 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,735 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 17:13:27,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:27,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:27,736 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 17:13:27,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:27,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:27,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:27,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,768 INFO L377 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 17:13:27,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:27,772 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:13:27,772 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,801 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-07 17:13:27,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:13:27,802 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 17:13:27,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:27,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:27,821 INFO L377 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 28 treesize of output 10 [2019-12-07 17:13:27,821 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,823 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:13:27,824 INFO L377 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 28 treesize of output 10 [2019-12-07 17:13:27,824 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:27,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:27,826 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:13:27,826 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 17:13:28,019 INFO L134 CoverageAnalysis]: Checked inductivity of 3893 backedges. 2069 proven. 103 refuted. 0 times theorem prover too weak. 1721 trivial. 0 not checked. [2019-12-07 17:13:28,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:13:28,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 17:13:28,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316472228] [2019-12-07 17:13:28,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:13:28,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:13:28,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:13:28,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:13:28,020 INFO L87 Difference]: Start difference. First operand 113015 states and 171873 transitions. Second operand 11 states. [2019-12-07 17:13:41,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:13:41,412 INFO L93 Difference]: Finished difference Result 259401 states and 390917 transitions. [2019-12-07 17:13:41,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:13:41,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 617 [2019-12-07 17:13:41,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:13:41,545 INFO L225 Difference]: With dead ends: 259401 [2019-12-07 17:13:41,545 INFO L226 Difference]: Without dead ends: 146405 [2019-12-07 17:13:41,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 617 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:13:41,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146405 states. [2019-12-07 17:13:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146405 to 113015. [2019-12-07 17:13:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113015 states. [2019-12-07 17:13:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113015 states to 113015 states and 170265 transitions. [2019-12-07 17:13:46,221 INFO L78 Accepts]: Start accepts. Automaton has 113015 states and 170265 transitions. Word has length 617 [2019-12-07 17:13:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:13:46,222 INFO L462 AbstractCegarLoop]: Abstraction has 113015 states and 170265 transitions. [2019-12-07 17:13:46,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:13:46,222 INFO L276 IsEmpty]: Start isEmpty. Operand 113015 states and 170265 transitions. [2019-12-07 17:13:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-12-07 17:13:46,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:13:46,294 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:13:46,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:13:46,494 INFO L410 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:13:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:13:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2085385148, now seen corresponding path program 1 times [2019-12-07 17:13:46,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:13:46,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508048997] [2019-12-07 17:13:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:13:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:46,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3805 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 2964 trivial. 0 not checked. [2019-12-07 17:13:46,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508048997] [2019-12-07 17:13:46,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:13:46,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:13:46,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217912873] [2019-12-07 17:13:46,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:13:46,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:13:46,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:13:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:13:46,760 INFO L87 Difference]: Start difference. First operand 113015 states and 170265 transitions. Second operand 4 states. [2019-12-07 17:13:52,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:13:52,925 INFO L93 Difference]: Finished difference Result 235777 states and 354024 transitions. [2019-12-07 17:13:52,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:13:52,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 618 [2019-12-07 17:13:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:13:53,037 INFO L225 Difference]: With dead ends: 235777 [2019-12-07 17:13:53,037 INFO L226 Difference]: Without dead ends: 122781 [2019-12-07 17:13:53,078 INFO L630 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 [2019-12-07 17:13:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122781 states. [2019-12-07 17:13:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122781 to 113229. [2019-12-07 17:13:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113229 states. [2019-12-07 17:13:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113229 states to 113229 states and 170479 transitions. [2019-12-07 17:13:57,594 INFO L78 Accepts]: Start accepts. Automaton has 113229 states and 170479 transitions. Word has length 618 [2019-12-07 17:13:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:13:57,594 INFO L462 AbstractCegarLoop]: Abstraction has 113229 states and 170479 transitions. [2019-12-07 17:13:57,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:13:57,594 INFO L276 IsEmpty]: Start isEmpty. Operand 113229 states and 170479 transitions. [2019-12-07 17:13:57,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-12-07 17:13:57,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:13:57,670 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 13, 13, 13, 13, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:13:57,671 INFO L410 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:13:57,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:13:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash -41170902, now seen corresponding path program 1 times [2019-12-07 17:13:57,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:13:57,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083978519] [2019-12-07 17:13:57,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:13:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:58,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3911 backedges. 2082 proven. 97 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2019-12-07 17:13:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083978519] [2019-12-07 17:13:58,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329793584] [2019-12-07 17:13:58,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:13:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:58,252 INFO L264 TraceCheckSpWp]: Trace formula consists of 2003 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:13:58,256 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:13:58,261 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:13:58,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:13:58,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:13:58,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,267 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:13:58,273 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_184|, |v_#memory_$Pointer$.base_246|], 2=[|v_#memory_int_199|]} [2019-12-07 17:13:58,275 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 17:13:58,275 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:58,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,280 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 13 [2019-12-07 17:13:58,280 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:58,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,295 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 56 [2019-12-07 17:13:58,296 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,312 INFO L614 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-12-07 17:13:58,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:58,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:13:58,312 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-12-07 17:13:58,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:58,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:58,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:58,331 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:13:58,331 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:58,349 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,350 INFO L377 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 2 case distinctions, treesize of input 32 treesize of output 84 [2019-12-07 17:13:58,350 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,380 INFO L614 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-12-07 17:13:58,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:13:58,380 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-12-07 17:13:58,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:13:58,399 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:13:58,400 INFO L377 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 28 treesize of output 10 [2019-12-07 17:13:58,400 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,402 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:13:58,402 INFO L377 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 28 treesize of output 10 [2019-12-07 17:13:58,402 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:13:58,405 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:13:58,405 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:13:58,405 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-12-07 17:13:58,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3911 backedges. 2082 proven. 97 refuted. 0 times theorem prover too weak. 1732 trivial. 0 not checked. [2019-12-07 17:13:58,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:13:58,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 11 [2019-12-07 17:13:58,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212871486] [2019-12-07 17:13:58,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:13:58,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:13:58,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:13:58,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:13:58,600 INFO L87 Difference]: Start difference. First operand 113229 states and 170479 transitions. Second operand 11 states. [2019-12-07 17:14:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:12,855 INFO L93 Difference]: Finished difference Result 258394 states and 386360 transitions. [2019-12-07 17:14:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:14:12,857 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 618 [2019-12-07 17:14:12,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:12,994 INFO L225 Difference]: With dead ends: 258394 [2019-12-07 17:14:12,994 INFO L226 Difference]: Without dead ends: 145184 [2019-12-07 17:14:13,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 618 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:14:13,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145184 states. [2019-12-07 17:14:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145184 to 113229. [2019-12-07 17:14:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113229 states. [2019-12-07 17:14:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113229 states to 113229 states and 168871 transitions. [2019-12-07 17:14:17,775 INFO L78 Accepts]: Start accepts. Automaton has 113229 states and 168871 transitions. Word has length 618 [2019-12-07 17:14:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:17,776 INFO L462 AbstractCegarLoop]: Abstraction has 113229 states and 168871 transitions. [2019-12-07 17:14:17,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:14:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 113229 states and 168871 transitions. [2019-12-07 17:14:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-12-07 17:14:17,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:17,849 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:18,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:18,050 INFO L410 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:18,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1946291948, now seen corresponding path program 1 times [2019-12-07 17:14:18,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:18,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223065306] [2019-12-07 17:14:18,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 3777 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 2972 trivial. 0 not checked. [2019-12-07 17:14:18,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223065306] [2019-12-07 17:14:18,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:18,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:14:18,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760463426] [2019-12-07 17:14:18,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:18,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:18,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:18,322 INFO L87 Difference]: Start difference. First operand 113229 states and 168871 transitions. Second operand 4 states. [2019-12-07 17:14:24,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:24,744 INFO L93 Difference]: Finished difference Result 235991 states and 350808 transitions. [2019-12-07 17:14:24,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:24,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 621 [2019-12-07 17:14:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:24,860 INFO L225 Difference]: With dead ends: 235991 [2019-12-07 17:14:24,860 INFO L226 Difference]: Without dead ends: 122781 [2019-12-07 17:14:24,906 INFO L630 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 [2019-12-07 17:14:24,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122781 states. [2019-12-07 17:14:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122781 to 113229. [2019-12-07 17:14:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113229 states. [2019-12-07 17:14:30,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113229 states to 113229 states and 168657 transitions. [2019-12-07 17:14:30,572 INFO L78 Accepts]: Start accepts. Automaton has 113229 states and 168657 transitions. Word has length 621 [2019-12-07 17:14:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:30,572 INFO L462 AbstractCegarLoop]: Abstraction has 113229 states and 168657 transitions. [2019-12-07 17:14:30,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 113229 states and 168657 transitions. [2019-12-07 17:14:30,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-12-07 17:14:30,649 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:30,649 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:30,649 INFO L410 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:30,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:30,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2146046746, now seen corresponding path program 1 times [2019-12-07 17:14:30,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:30,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100362102] [2019-12-07 17:14:30,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:30,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3777 backedges. 1852 proven. 0 refuted. 0 times theorem prover too weak. 1925 trivial. 0 not checked. [2019-12-07 17:14:30,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100362102] [2019-12-07 17:14:30,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:30,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:14:30,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803763198] [2019-12-07 17:14:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:14:30,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:30,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:14:30,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:14:30,880 INFO L87 Difference]: Start difference. First operand 113229 states and 168657 transitions. Second operand 3 states. [2019-12-07 17:14:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:35,482 INFO L93 Difference]: Finished difference Result 235994 states and 351500 transitions. [2019-12-07 17:14:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:14:35,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 621 [2019-12-07 17:14:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:35,601 INFO L225 Difference]: With dead ends: 235994 [2019-12-07 17:14:35,601 INFO L226 Difference]: Without dead ends: 122784 [2019-12-07 17:14:35,667 INFO L630 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 [2019-12-07 17:14:35,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122784 states. [2019-12-07 17:14:40,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122784 to 122784. [2019-12-07 17:14:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122784 states. [2019-12-07 17:14:40,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122784 states to 122784 states and 182162 transitions. [2019-12-07 17:14:40,727 INFO L78 Accepts]: Start accepts. Automaton has 122784 states and 182162 transitions. Word has length 621 [2019-12-07 17:14:40,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:40,727 INFO L462 AbstractCegarLoop]: Abstraction has 122784 states and 182162 transitions. [2019-12-07 17:14:40,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:14:40,727 INFO L276 IsEmpty]: Start isEmpty. Operand 122784 states and 182162 transitions. [2019-12-07 17:14:40,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2019-12-07 17:14:40,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:40,828 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 16, 16, 15, 15, 14, 14, 12, 12, 12, 12, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:40,829 INFO L410 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:40,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1618005016, now seen corresponding path program 1 times [2019-12-07 17:14:40,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:40,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346005945] [2019-12-07 17:14:40,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3777 backedges. 2035 proven. 23 refuted. 0 times theorem prover too weak. 1719 trivial. 0 not checked. [2019-12-07 17:14:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346005945] [2019-12-07 17:14:41,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306461775] [2019-12-07 17:14:41,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:41,678 INFO L264 TraceCheckSpWp]: Trace formula consists of 2027 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:14:41,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:41,686 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 8 [2019-12-07 17:14:41,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:41,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:41,687 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:41,687 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-12-07 17:14:41,689 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_247|, |v_#memory_$Pointer$.offset_185|], 5=[|v_#memory_int_201|]} [2019-12-07 17:14:41,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 63 [2019-12-07 17:14:41,690 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:14:41,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:41,693 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 51 [2019-12-07 17:14:41,693 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:14:41,695 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:41,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:41,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-12-07 17:14:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:14:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:14:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:14:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:14:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:14:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:14:41,725 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@242845b1 [2019-12-07 17:14:41,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:14:41,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-12-07 17:14:41,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406189133] [2019-12-07 17:14:41,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:14:41,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:14:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:14:41,726 INFO L87 Difference]: Start difference. First operand 122784 states and 182162 transitions. Second operand 10 states. [2019-12-07 17:14:41,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:14:41,927 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:14:41,928 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@242845b1 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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) [2019-12-07 17:14:41,930 INFO L168 Benchmark]: Toolchain (without parser) took 446531.67 ms. Allocated memory was 1.0 GB in the beginning and 6.2 GB in the end (delta: 5.2 GB). Free memory was 935.3 MB in the beginning and 4.9 GB in the end (delta: -4.0 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: Boogie Preprocessor took 53.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: RCFGBuilder took 653.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 953.1 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,931 INFO L168 Benchmark]: TraceAbstraction took 445376.08 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 953.1 MB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 17:14:41,932 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 394.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -128.8 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.12 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.55 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 653.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 953.1 MB in the end (delta: 100.3 MB). Peak memory consumption was 100.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 445376.08 ms. Allocated memory was 1.1 GB in the beginning and 6.2 GB in the end (delta: 5.1 GB). Free memory was 953.1 MB in the beginning and 4.9 GB in the end (delta: -3.9 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@242845b1 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@242845b1: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:14:43,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:14:43,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:14:43,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:14:43,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:14:43,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:14:43,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:14:43,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:14:43,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:14:43,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:14:43,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:14:43,443 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:14:43,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:14:43,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:14:43,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:14:43,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:14:43,446 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:14:43,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:14:43,448 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:14:43,450 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:14:43,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:14:43,452 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:14:43,453 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:14:43,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:14:43,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:14:43,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:14:43,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:14:43,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:14:43,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:14:43,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:14:43,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:14:43,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:14:43,458 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:14:43,459 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:14:43,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:14:43,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:14:43,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:14:43,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:14:43,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:14:43,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:14:43,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:14:43,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:14:43,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:14:43,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:14:43,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:14:43,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:14:43,473 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:14:43,474 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:14:43,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:14:43,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:14:43,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:14:43,476 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer 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 -> Automizer 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 -> bf350eece4e5f8a5f96c7b11a45bc95e4e002e5b [2019-12-07 17:14:43,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:14:43,651 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:14:43,654 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:14:43,655 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:14:43,656 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:14:43,656 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:14:43,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/d8da79a57/710ca852470146aba5da624441b19cee/FLAGf32ee3c6f [2019-12-07 17:14:44,243 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:14:44,243 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:14:44,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/d8da79a57/710ca852470146aba5da624441b19cee/FLAGf32ee3c6f [2019-12-07 17:14:44,675 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/data/d8da79a57/710ca852470146aba5da624441b19cee [2019-12-07 17:14:44,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:14:44,677 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:14:44,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:44,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:14:44,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:14:44,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:44" (1/1) ... [2019-12-07 17:14:44,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a94c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:44, skipping insertion in model container [2019-12-07 17:14:44,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:14:44" (1/1) ... [2019-12-07 17:14:44,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:14:44,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:14:44,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:45,004 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:14:45,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:14:45,088 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:14:45,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45 WrapperNode [2019-12-07 17:14:45,089 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:14:45,089 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:45,089 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:14:45,089 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:14:45,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:14:45,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:14:45,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:14:45,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:14:45,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,159 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... [2019-12-07 17:14:45,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:14:45,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:14:45,200 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:14:45,200 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:14:45,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/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 [2019-12-07 17:14:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:14:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:14:45,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:14:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:14:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:14:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:14:45,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:14:45,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:14:45,379 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:14:47,397 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:14:47,397 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:14:47,398 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:14:47,398 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:14:47,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:47 BoogieIcfgContainer [2019-12-07 17:14:47,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:14:47,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:14:47,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:14:47,402 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:14:47,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:14:44" (1/3) ... [2019-12-07 17:14:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb259f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:47, skipping insertion in model container [2019-12-07 17:14:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:14:45" (2/3) ... [2019-12-07 17:14:47,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bb259f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:14:47, skipping insertion in model container [2019-12-07 17:14:47,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:47" (3/3) ... [2019-12-07 17:14:47,404 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-1.c [2019-12-07 17:14:47,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:14:47,415 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:14:47,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:14:47,440 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:14:47,440 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:14:47,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:14:47,441 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:14:47,441 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:14:47,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:14:47,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:14:47,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:14:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2019-12-07 17:14:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:14:47,460 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:47,461 INFO L410 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] [2019-12-07 17:14:47,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:47,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:47,465 INFO L82 PathProgramCache]: Analyzing trace with hash 102131601, now seen corresponding path program 1 times [2019-12-07 17:14:47,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:47,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726231821] [2019-12-07 17:14:47,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:47,611 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:47,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:47,648 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:47,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726231821] [2019-12-07 17:14:47,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:47,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:47,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189466067] [2019-12-07 17:14:47,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:47,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:47,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:47,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:47,681 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 4 states. [2019-12-07 17:14:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:47,843 INFO L93 Difference]: Finished difference Result 584 states and 1005 transitions. [2019-12-07 17:14:47,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:47,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 17:14:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:47,856 INFO L225 Difference]: With dead ends: 584 [2019-12-07 17:14:47,856 INFO L226 Difference]: Without dead ends: 399 [2019-12-07 17:14:47,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:47,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-12-07 17:14:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2019-12-07 17:14:47,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-12-07 17:14:47,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 611 transitions. [2019-12-07 17:14:47,913 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 611 transitions. Word has length 43 [2019-12-07 17:14:47,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:47,914 INFO L462 AbstractCegarLoop]: Abstraction has 399 states and 611 transitions. [2019-12-07 17:14:47,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:47,914 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 611 transitions. [2019-12-07 17:14:47,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:14:47,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:47,921 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:48,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:14:48,122 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:48,123 INFO L82 PathProgramCache]: Analyzing trace with hash -416969103, now seen corresponding path program 1 times [2019-12-07 17:14:48,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:48,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403990470] [2019-12-07 17:14:48,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:48,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:48,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:48,281 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:48,303 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:48,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403990470] [2019-12-07 17:14:48,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:48,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:48,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527189860] [2019-12-07 17:14:48,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:48,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:48,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:48,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:48,326 INFO L87 Difference]: Start difference. First operand 399 states and 611 transitions. Second operand 4 states. [2019-12-07 17:14:48,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:48,714 INFO L93 Difference]: Finished difference Result 916 states and 1425 transitions. [2019-12-07 17:14:48,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:48,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 17:14:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:48,718 INFO L225 Difference]: With dead ends: 916 [2019-12-07 17:14:48,718 INFO L226 Difference]: Without dead ends: 655 [2019-12-07 17:14:48,721 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2019-12-07 17:14:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 655. [2019-12-07 17:14:48,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-12-07 17:14:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 998 transitions. [2019-12-07 17:14:48,760 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 998 transitions. Word has length 104 [2019-12-07 17:14:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:48,761 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 998 transitions. [2019-12-07 17:14:48,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 998 transitions. [2019-12-07 17:14:48,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 17:14:48,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:48,766 INFO L410 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] [2019-12-07 17:14:48,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:14:48,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash 902985072, now seen corresponding path program 1 times [2019-12-07 17:14:48,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:48,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244882797] [2019-12-07 17:14:48,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:49,139 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:49,144 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:14:49,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 17:14:49,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244882797] [2019-12-07 17:14:49,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:49,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:49,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445214521] [2019-12-07 17:14:49,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:49,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:49,205 INFO L87 Difference]: Start difference. First operand 655 states and 998 transitions. Second operand 4 states. [2019-12-07 17:14:50,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:50,001 INFO L93 Difference]: Finished difference Result 1431 states and 2202 transitions. [2019-12-07 17:14:50,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:50,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-12-07 17:14:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:50,007 INFO L225 Difference]: With dead ends: 1431 [2019-12-07 17:14:50,007 INFO L226 Difference]: Without dead ends: 914 [2019-12-07 17:14:50,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2019-12-07 17:14:50,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 914. [2019-12-07 17:14:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 914 states. [2019-12-07 17:14:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1388 transitions. [2019-12-07 17:14:50,038 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1388 transitions. Word has length 168 [2019-12-07 17:14:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:50,039 INFO L462 AbstractCegarLoop]: Abstraction has 914 states and 1388 transitions. [2019-12-07 17:14:50,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1388 transitions. [2019-12-07 17:14:50,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 17:14:50,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:50,042 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:50,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:14:50,244 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:50,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -831983101, now seen corresponding path program 1 times [2019-12-07 17:14:50,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:50,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082568521] [2019-12-07 17:14:50,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:50,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:50,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 17:14:50,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-12-07 17:14:50,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082568521] [2019-12-07 17:14:50,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:50,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:50,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228934743] [2019-12-07 17:14:50,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:50,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:50,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:50,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:50,573 INFO L87 Difference]: Start difference. First operand 914 states and 1388 transitions. Second operand 4 states. [2019-12-07 17:14:50,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:50,883 INFO L93 Difference]: Finished difference Result 1947 states and 2977 transitions. [2019-12-07 17:14:50,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:50,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-12-07 17:14:50,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:50,891 INFO L225 Difference]: With dead ends: 1947 [2019-12-07 17:14:50,891 INFO L226 Difference]: Without dead ends: 1171 [2019-12-07 17:14:50,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:50,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-12-07 17:14:50,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2019-12-07 17:14:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-12-07 17:14:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1773 transitions. [2019-12-07 17:14:50,950 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1773 transitions. Word has length 232 [2019-12-07 17:14:50,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:50,951 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 1773 transitions. [2019-12-07 17:14:50,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1773 transitions. [2019-12-07 17:14:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-12-07 17:14:50,957 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:50,958 INFO L410 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 17:14:51,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:14:51,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1880300915, now seen corresponding path program 1 times [2019-12-07 17:14:51,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:51,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612771417] [2019-12-07 17:14:51,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:51,426 INFO L264 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:51,430 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-12-07 17:14:51,484 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2019-12-07 17:14:51,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612771417] [2019-12-07 17:14:51,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:51,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:51,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105327296] [2019-12-07 17:14:51,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:51,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:51,543 INFO L87 Difference]: Start difference. First operand 1171 states and 1773 transitions. Second operand 4 states. [2019-12-07 17:14:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:52,505 INFO L93 Difference]: Finished difference Result 2461 states and 3745 transitions. [2019-12-07 17:14:52,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:52,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-12-07 17:14:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:52,511 INFO L225 Difference]: With dead ends: 2461 [2019-12-07 17:14:52,511 INFO L226 Difference]: Without dead ends: 1428 [2019-12-07 17:14:52,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2019-12-07 17:14:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2019-12-07 17:14:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 17:14:52,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2156 transitions. [2019-12-07 17:14:52,545 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2156 transitions. Word has length 304 [2019-12-07 17:14:52,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:52,545 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2156 transitions. [2019-12-07 17:14:52,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:52,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2156 transitions. [2019-12-07 17:14:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-12-07 17:14:52,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:52,550 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:52,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:14:52,751 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 634373986, now seen corresponding path program 1 times [2019-12-07 17:14:52,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:52,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924536423] [2019-12-07 17:14:52,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:53,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:14:53,036 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:53,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-12-07 17:14:53,133 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:53,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1237 backedges. 725 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-12-07 17:14:53,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924536423] [2019-12-07 17:14:53,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:53,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:14:53,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973203412] [2019-12-07 17:14:53,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:53,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:53,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:53,214 INFO L87 Difference]: Start difference. First operand 1428 states and 2156 transitions. Second operand 4 states. [2019-12-07 17:14:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:53,828 INFO L93 Difference]: Finished difference Result 2973 states and 4506 transitions. [2019-12-07 17:14:53,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:53,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 376 [2019-12-07 17:14:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:53,835 INFO L225 Difference]: With dead ends: 2973 [2019-12-07 17:14:53,835 INFO L226 Difference]: Without dead ends: 1683 [2019-12-07 17:14:53,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2019-12-07 17:14:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1683. [2019-12-07 17:14:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-12-07 17:14:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2535 transitions. [2019-12-07 17:14:53,872 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2535 transitions. Word has length 376 [2019-12-07 17:14:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:53,873 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2535 transitions. [2019-12-07 17:14:53,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:53,873 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2535 transitions. [2019-12-07 17:14:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2019-12-07 17:14:53,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:53,876 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:54,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:14:54,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:54,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:54,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1806126364, now seen corresponding path program 1 times [2019-12-07 17:14:54,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:54,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239406196] [2019-12-07 17:14:54,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:54,485 INFO L264 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:14:54,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:54,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:14:54,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:54,556 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:54,556 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:54,556 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:14:54,569 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:14:54,570 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:54,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:54,571 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:54,572 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:14:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-12-07 17:14:54,684 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:54,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-12-07 17:14:54,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239406196] [2019-12-07 17:14:54,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:54,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:14:54,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666126843] [2019-12-07 17:14:54,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:54,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:54,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:54,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:54,779 INFO L87 Difference]: Start difference. First operand 1683 states and 2535 transitions. Second operand 4 states. [2019-12-07 17:14:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:57,472 INFO L93 Difference]: Finished difference Result 3813 states and 5749 transitions. [2019-12-07 17:14:57,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:14:57,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2019-12-07 17:14:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:57,482 INFO L225 Difference]: With dead ends: 3813 [2019-12-07 17:14:57,482 INFO L226 Difference]: Without dead ends: 2138 [2019-12-07 17:14:57,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 893 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:14:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-12-07 17:14:57,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1935. [2019-12-07 17:14:57,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1935 states. [2019-12-07 17:14:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2967 transitions. [2019-12-07 17:14:57,543 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2967 transitions. Word has length 447 [2019-12-07 17:14:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:57,544 INFO L462 AbstractCegarLoop]: Abstraction has 1935 states and 2967 transitions. [2019-12-07 17:14:57,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2967 transitions. [2019-12-07 17:14:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2019-12-07 17:14:57,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:57,548 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:57,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:14:57,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:57,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:57,749 INFO L82 PathProgramCache]: Analyzing trace with hash -2110544914, now seen corresponding path program 1 times [2019-12-07 17:14:57,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:14:57,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624509513] [2019-12-07 17:14:57,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 17:14:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:58,078 INFO L264 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:14:58,083 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:14:58,102 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:14:58,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:14:58,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:58,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:58,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:58,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:14:58,128 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:14:58,128 INFO L377 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 28 treesize of output 10 [2019-12-07 17:14:58,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:14:58,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:14:58,130 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:14:58,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:14:58,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-12-07 17:14:58,258 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:14:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1013 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2019-12-07 17:14:58,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624509513] [2019-12-07 17:14:58,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:58,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 17:14:58,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196192169] [2019-12-07 17:14:58,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:14:58,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:14:58,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:14:58,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:14:58,382 INFO L87 Difference]: Start difference. First operand 1935 states and 2967 transitions. Second operand 5 states. [2019-12-07 17:15:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:05,335 INFO L93 Difference]: Finished difference Result 4878 states and 7496 transitions. [2019-12-07 17:15:05,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:15:05,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 449 [2019-12-07 17:15:05,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:05,348 INFO L225 Difference]: With dead ends: 4878 [2019-12-07 17:15:05,348 INFO L226 Difference]: Without dead ends: 2951 [2019-12-07 17:15:05,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 897 GetRequests, 893 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:05,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-12-07 17:15:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2355. [2019-12-07 17:15:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2019-12-07 17:15:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3735 transitions. [2019-12-07 17:15:05,400 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3735 transitions. Word has length 449 [2019-12-07 17:15:05,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:05,401 INFO L462 AbstractCegarLoop]: Abstraction has 2355 states and 3735 transitions. [2019-12-07 17:15:05,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:15:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3735 transitions. [2019-12-07 17:15:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2019-12-07 17:15:05,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:05,406 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:05,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:15:05,607 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:05,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:05,607 INFO L82 PathProgramCache]: Analyzing trace with hash 850587921, now seen corresponding path program 1 times [2019-12-07 17:15:05,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:05,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766975294] [2019-12-07 17:15:05,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:05,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:05,992 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:05,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:05,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:06,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:06,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:06,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:06,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:06,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:06,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:06,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:06,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:06,101 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:06,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1966 backedges. 973 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:06,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766975294] [2019-12-07 17:15:06,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:06,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:06,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055543646] [2019-12-07 17:15:06,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:06,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:06,257 INFO L87 Difference]: Start difference. First operand 2355 states and 3735 transitions. Second operand 6 states. [2019-12-07 17:15:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:14,323 INFO L93 Difference]: Finished difference Result 6475 states and 10111 transitions. [2019-12-07 17:15:14,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:14,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 460 [2019-12-07 17:15:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:14,338 INFO L225 Difference]: With dead ends: 6475 [2019-12-07 17:15:14,338 INFO L226 Difference]: Without dead ends: 4128 [2019-12-07 17:15:14,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 920 GetRequests, 914 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4128 states. [2019-12-07 17:15:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4128 to 2563. [2019-12-07 17:15:14,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-12-07 17:15:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4049 transitions. [2019-12-07 17:15:14,397 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4049 transitions. Word has length 460 [2019-12-07 17:15:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:14,397 INFO L462 AbstractCegarLoop]: Abstraction has 2563 states and 4049 transitions. [2019-12-07 17:15:14,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4049 transitions. [2019-12-07 17:15:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 17:15:14,401 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:14,401 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:14,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:15:14,602 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:14,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1088048517, now seen corresponding path program 1 times [2019-12-07 17:15:14,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:14,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1160930920] [2019-12-07 17:15:14,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:14,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:14,937 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:14,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:14,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:14,945 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:14,945 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:14,945 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:14,952 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:14,952 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:14,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:14,954 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:14,954 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:15,053 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1901 backedges. 908 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:15,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1160930920] [2019-12-07 17:15:15,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:15,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:15,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117065257] [2019-12-07 17:15:15,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:15,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:15,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:15,178 INFO L87 Difference]: Start difference. First operand 2563 states and 4049 transitions. Second operand 6 states. [2019-12-07 17:15:23,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:23,436 INFO L93 Difference]: Finished difference Result 6866 states and 10714 transitions. [2019-12-07 17:15:23,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:23,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-12-07 17:15:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:23,451 INFO L225 Difference]: With dead ends: 6866 [2019-12-07 17:15:23,451 INFO L226 Difference]: Without dead ends: 4311 [2019-12-07 17:15:23,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4311 states. [2019-12-07 17:15:23,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4311 to 2706. [2019-12-07 17:15:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2706 states. [2019-12-07 17:15:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4220 transitions. [2019-12-07 17:15:23,515 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4220 transitions. Word has length 461 [2019-12-07 17:15:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:23,515 INFO L462 AbstractCegarLoop]: Abstraction has 2706 states and 4220 transitions. [2019-12-07 17:15:23,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4220 transitions. [2019-12-07 17:15:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 17:15:23,519 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:23,519 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:23,719 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:15:23,720 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:23,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash 333305786, now seen corresponding path program 1 times [2019-12-07 17:15:23,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:23,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755103157] [2019-12-07 17:15:23,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:24,128 INFO L264 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:24,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:24,137 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:24,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:24,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:24,140 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:24,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:24,147 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:24,147 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:24,148 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:24,149 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:24,149 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:24,243 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:24,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1979 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:24,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755103157] [2019-12-07 17:15:24,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:24,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:24,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131531746] [2019-12-07 17:15:24,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:24,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:24,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:24,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:24,386 INFO L87 Difference]: Start difference. First operand 2706 states and 4220 transitions. Second operand 6 states. [2019-12-07 17:15:32,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:32,205 INFO L93 Difference]: Finished difference Result 6985 states and 10811 transitions. [2019-12-07 17:15:32,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:32,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-12-07 17:15:32,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:32,221 INFO L225 Difference]: With dead ends: 6985 [2019-12-07 17:15:32,221 INFO L226 Difference]: Without dead ends: 4287 [2019-12-07 17:15:32,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-12-07 17:15:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 2784. [2019-12-07 17:15:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-12-07 17:15:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 4339 transitions. [2019-12-07 17:15:32,286 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 4339 transitions. Word has length 461 [2019-12-07 17:15:32,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:32,286 INFO L462 AbstractCegarLoop]: Abstraction has 2784 states and 4339 transitions. [2019-12-07 17:15:32,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 4339 transitions. [2019-12-07 17:15:32,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 17:15:32,290 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:32,290 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:32,491 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:15:32,492 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:32,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:32,492 INFO L82 PathProgramCache]: Analyzing trace with hash -632108934, now seen corresponding path program 1 times [2019-12-07 17:15:32,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:32,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281589547] [2019-12-07 17:15:32,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:32,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:32,863 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:32,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:32,870 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:32,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:32,873 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:32,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:32,881 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:32,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:32,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:32,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:32,883 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:32,977 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1992 backedges. 999 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:33,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281589547] [2019-12-07 17:15:33,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:33,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:33,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87619781] [2019-12-07 17:15:33,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:33,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:33,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:33,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:33,106 INFO L87 Difference]: Start difference. First operand 2784 states and 4339 transitions. Second operand 6 states. [2019-12-07 17:15:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:37,920 INFO L93 Difference]: Finished difference Result 7038 states and 10868 transitions. [2019-12-07 17:15:37,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:37,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-12-07 17:15:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:37,928 INFO L225 Difference]: With dead ends: 7038 [2019-12-07 17:15:37,929 INFO L226 Difference]: Without dead ends: 4262 [2019-12-07 17:15:37,931 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:37,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-12-07 17:15:37,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 2797. [2019-12-07 17:15:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-07 17:15:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4328 transitions. [2019-12-07 17:15:37,996 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4328 transitions. Word has length 461 [2019-12-07 17:15:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:37,996 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4328 transitions. [2019-12-07 17:15:37,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4328 transitions. [2019-12-07 17:15:38,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2019-12-07 17:15:38,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:38,000 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:38,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:15:38,201 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -970772623, now seen corresponding path program 1 times [2019-12-07 17:15:38,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:38,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11685479] [2019-12-07 17:15:38,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:38,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:38,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:38,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:38,551 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:38,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:38,555 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:38,555 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:38,563 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:38,563 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:38,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:38,564 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:38,564 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:38,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:38,668 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1914 backedges. 921 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:38,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11685479] [2019-12-07 17:15:38,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:38,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:38,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847837643] [2019-12-07 17:15:38,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:38,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:38,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:38,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:38,773 INFO L87 Difference]: Start difference. First operand 2797 states and 4328 transitions. Second operand 6 states. [2019-12-07 17:15:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:46,607 INFO L93 Difference]: Finished difference Result 7051 states and 10820 transitions. [2019-12-07 17:15:46,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:46,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 461 [2019-12-07 17:15:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:46,613 INFO L225 Difference]: With dead ends: 7051 [2019-12-07 17:15:46,613 INFO L226 Difference]: Without dead ends: 4262 [2019-12-07 17:15:46,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 922 GetRequests, 916 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-12-07 17:15:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 2797. [2019-12-07 17:15:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-07 17:15:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4278 transitions. [2019-12-07 17:15:46,682 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4278 transitions. Word has length 461 [2019-12-07 17:15:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:46,682 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4278 transitions. [2019-12-07 17:15:46,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4278 transitions. [2019-12-07 17:15:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-12-07 17:15:46,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:46,686 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:46,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:15:46,887 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:46,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:46,888 INFO L82 PathProgramCache]: Analyzing trace with hash 277348136, now seen corresponding path program 1 times [2019-12-07 17:15:46,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:46,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932162459] [2019-12-07 17:15:46,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:47,301 INFO L264 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:47,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:47,315 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:47,315 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:47,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:47,318 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:47,318 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:47,325 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:47,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:47,327 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:47,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:47,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1927 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:47,432 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1927 backedges. 934 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:47,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932162459] [2019-12-07 17:15:47,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:47,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:47,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202758353] [2019-12-07 17:15:47,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:47,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:47,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:47,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:47,539 INFO L87 Difference]: Start difference. First operand 2797 states and 4278 transitions. Second operand 6 states. [2019-12-07 17:15:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:54,268 INFO L93 Difference]: Finished difference Result 7051 states and 10720 transitions. [2019-12-07 17:15:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:15:54,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 462 [2019-12-07 17:15:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:54,275 INFO L225 Difference]: With dead ends: 7051 [2019-12-07 17:15:54,275 INFO L226 Difference]: Without dead ends: 4262 [2019-12-07 17:15:54,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 918 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:54,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-12-07 17:15:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 2797. [2019-12-07 17:15:54,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-07 17:15:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4228 transitions. [2019-12-07 17:15:54,345 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4228 transitions. Word has length 462 [2019-12-07 17:15:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:54,345 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4228 transitions. [2019-12-07 17:15:54,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:15:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4228 transitions. [2019-12-07 17:15:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-12-07 17:15:54,349 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:54,349 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:54,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:15:54,551 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:54,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:54,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1284602540, now seen corresponding path program 1 times [2019-12-07 17:15:54,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:15:54,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910249757] [2019-12-07 17:15:54,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 17:15:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:54,896 INFO L264 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:15:54,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:15:54,905 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:15:54,905 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,908 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:54,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:15:54,917 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:15:54,917 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:15:54,918 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:15:54,918 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:15:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:55,019 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:15:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 947 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:15:55,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910249757] [2019-12-07 17:15:55,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:55,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:15:55,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512672931] [2019-12-07 17:15:55,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:15:55,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:15:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:15:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:15:55,128 INFO L87 Difference]: Start difference. First operand 2797 states and 4228 transitions. Second operand 6 states. [2019-12-07 17:16:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:00,651 INFO L93 Difference]: Finished difference Result 7051 states and 10620 transitions. [2019-12-07 17:16:00,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:00,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 463 [2019-12-07 17:16:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:00,659 INFO L225 Difference]: With dead ends: 7051 [2019-12-07 17:16:00,659 INFO L226 Difference]: Without dead ends: 4262 [2019-12-07 17:16:00,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 920 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2019-12-07 17:16:00,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 2797. [2019-12-07 17:16:00,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-07 17:16:00,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4178 transitions. [2019-12-07 17:16:00,745 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4178 transitions. Word has length 463 [2019-12-07 17:16:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:00,746 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4178 transitions. [2019-12-07 17:16:00,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4178 transitions. [2019-12-07 17:16:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-12-07 17:16:00,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:00,750 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:00,950 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:16:00,951 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:00,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:00,952 INFO L82 PathProgramCache]: Analyzing trace with hash -880032765, now seen corresponding path program 1 times [2019-12-07 17:16:00,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:00,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163222329] [2019-12-07 17:16:00,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:01,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 992 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:01,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:01,323 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:16:01,324 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:01,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:01,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:01,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:16:01,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:16:01,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:01,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:01,335 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:01,335 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:16:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:01,428 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 960 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:01,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163222329] [2019-12-07 17:16:01,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:01,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:01,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930743395] [2019-12-07 17:16:01,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:01,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:01,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:01,540 INFO L87 Difference]: Start difference. First operand 2797 states and 4178 transitions. Second operand 6 states. [2019-12-07 17:16:10,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:10,077 INFO L93 Difference]: Finished difference Result 6801 states and 10195 transitions. [2019-12-07 17:16:10,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:10,078 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2019-12-07 17:16:10,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:10,082 INFO L225 Difference]: With dead ends: 6801 [2019-12-07 17:16:10,082 INFO L226 Difference]: Without dead ends: 4012 [2019-12-07 17:16:10,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:10,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2019-12-07 17:16:10,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 2797. [2019-12-07 17:16:10,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2797 states. [2019-12-07 17:16:10,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4128 transitions. [2019-12-07 17:16:10,156 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4128 transitions. Word has length 464 [2019-12-07 17:16:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 2797 states and 4128 transitions. [2019-12-07 17:16:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4128 transitions. [2019-12-07 17:16:10,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2019-12-07 17:16:10,160 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:10,160 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 12, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:10,360 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:16:10,361 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:10,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:10,361 INFO L82 PathProgramCache]: Analyzing trace with hash 18072537, now seen corresponding path program 1 times [2019-12-07 17:16:10,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:10,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537451031] [2019-12-07 17:16:10,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:10,715 INFO L264 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:10,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:10,723 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:16:10,724 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:10,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:10,726 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:10,726 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:16:10,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:16:10,733 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:10,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:10,735 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:10,735 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:16:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:10,831 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:10,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2008 backedges. 1015 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:10,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537451031] [2019-12-07 17:16:10,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:10,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:10,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508827500] [2019-12-07 17:16:10,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:10,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:10,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:10,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:10,956 INFO L87 Difference]: Start difference. First operand 2797 states and 4128 transitions. Second operand 6 states. [2019-12-07 17:16:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:17,479 INFO L93 Difference]: Finished difference Result 6817 states and 10077 transitions. [2019-12-07 17:16:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:17,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2019-12-07 17:16:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:17,486 INFO L225 Difference]: With dead ends: 6817 [2019-12-07 17:16:17,486 INFO L226 Difference]: Without dead ends: 4246 [2019-12-07 17:16:17,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 928 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:17,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4246 states. [2019-12-07 17:16:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4246 to 3044. [2019-12-07 17:16:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3044 states. [2019-12-07 17:16:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4416 transitions. [2019-12-07 17:16:17,569 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4416 transitions. Word has length 464 [2019-12-07 17:16:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:17,569 INFO L462 AbstractCegarLoop]: Abstraction has 3044 states and 4416 transitions. [2019-12-07 17:16:17,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4416 transitions. [2019-12-07 17:16:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2019-12-07 17:16:17,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:17,574 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:17,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:16:17,775 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1794893699, now seen corresponding path program 1 times [2019-12-07 17:16:17,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:17,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065489232] [2019-12-07 17:16:17,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:18,186 INFO L264 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:18,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:18,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:16:18,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:18,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:18,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:18,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:16:18,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 7 [2019-12-07 17:16:18,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:18,205 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:18,205 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:18,206 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:16:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:18,311 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 1027 proven. 0 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2019-12-07 17:16:18,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065489232] [2019-12-07 17:16:18,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:18,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:18,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097413599] [2019-12-07 17:16:18,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:18,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:18,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:18,426 INFO L87 Difference]: Start difference. First operand 3044 states and 4416 transitions. Second operand 6 states. [2019-12-07 17:16:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:25,564 INFO L93 Difference]: Finished difference Result 7056 states and 10318 transitions. [2019-12-07 17:16:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:25,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 465 [2019-12-07 17:16:25,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:25,568 INFO L225 Difference]: With dead ends: 7056 [2019-12-07 17:16:25,568 INFO L226 Difference]: Without dead ends: 4257 [2019-12-07 17:16:25,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 924 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:25,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2019-12-07 17:16:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 3068. [2019-12-07 17:16:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3068 states. [2019-12-07 17:16:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4417 transitions. [2019-12-07 17:16:25,649 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4417 transitions. Word has length 465 [2019-12-07 17:16:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:25,650 INFO L462 AbstractCegarLoop]: Abstraction has 3068 states and 4417 transitions. [2019-12-07 17:16:25,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4417 transitions. [2019-12-07 17:16:25,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2019-12-07 17:16:25,653 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:25,654 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 11, 11, 10, 10, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:25,854 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:16:25,855 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:25,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:25,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1927877172, now seen corresponding path program 1 times [2019-12-07 17:16:25,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:25,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294468520] [2019-12-07 17:16:25,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:26,270 INFO L264 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 17:16:26,273 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:26,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1231 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-12-07 17:16:26,382 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:26,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2032 backedges. 1231 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2019-12-07 17:16:26,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294468520] [2019-12-07 17:16:26,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:26,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:16:26,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530290097] [2019-12-07 17:16:26,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:16:26,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:26,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:16:26,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:16:26,499 INFO L87 Difference]: Start difference. First operand 3068 states and 4417 transitions. Second operand 4 states. [2019-12-07 17:16:26,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:26,908 INFO L93 Difference]: Finished difference Result 6318 states and 9112 transitions. [2019-12-07 17:16:26,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:16:26,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 466 [2019-12-07 17:16:26,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:26,911 INFO L225 Difference]: With dead ends: 6318 [2019-12-07 17:16:26,911 INFO L226 Difference]: Without dead ends: 3509 [2019-12-07 17:16:26,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 928 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:16:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3509 states. [2019-12-07 17:16:27,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3509 to 3509. [2019-12-07 17:16:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3509 states. [2019-12-07 17:16:27,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5041 transitions. [2019-12-07 17:16:27,004 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5041 transitions. Word has length 466 [2019-12-07 17:16:27,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:27,004 INFO L462 AbstractCegarLoop]: Abstraction has 3509 states and 5041 transitions. [2019-12-07 17:16:27,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:16:27,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5041 transitions. [2019-12-07 17:16:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2019-12-07 17:16:27,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:27,009 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:27,210 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:16:27,211 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:27,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1392208377, now seen corresponding path program 1 times [2019-12-07 17:16:27,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:27,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119103304] [2019-12-07 17:16:27,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:27,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:27,638 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:27,653 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:16:27,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:16:27,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:27,661 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:27,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:27,661 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:16:27,676 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:16:27,676 INFO L377 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 28 treesize of output 10 [2019-12-07 17:16:27,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:27,677 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:27,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:27,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:16:27,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2391 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:27,802 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2391 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:27,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119103304] [2019-12-07 17:16:27,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:27,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:27,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616893978] [2019-12-07 17:16:27,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:27,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:27,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:27,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:27,940 INFO L87 Difference]: Start difference. First operand 3509 states and 5041 transitions. Second operand 6 states. [2019-12-07 17:16:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:34,672 INFO L93 Difference]: Finished difference Result 8549 states and 12395 transitions. [2019-12-07 17:16:34,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:34,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 503 [2019-12-07 17:16:34,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:34,677 INFO L225 Difference]: With dead ends: 8549 [2019-12-07 17:16:34,677 INFO L226 Difference]: Without dead ends: 5297 [2019-12-07 17:16:34,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1006 GetRequests, 1000 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2019-12-07 17:16:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 3554. [2019-12-07 17:16:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3554 states. [2019-12-07 17:16:34,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3554 states to 3554 states and 5103 transitions. [2019-12-07 17:16:34,788 INFO L78 Accepts]: Start accepts. Automaton has 3554 states and 5103 transitions. Word has length 503 [2019-12-07 17:16:34,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:34,789 INFO L462 AbstractCegarLoop]: Abstraction has 3554 states and 5103 transitions. [2019-12-07 17:16:34,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3554 states and 5103 transitions. [2019-12-07 17:16:34,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-12-07 17:16:34,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:34,793 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:34,994 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:16:34,995 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:34,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:34,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1428349602, now seen corresponding path program 1 times [2019-12-07 17:16:35,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:35,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339401814] [2019-12-07 17:16:35,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:35,360 INFO L264 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:35,363 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:35,381 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:16:35,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:16:35,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:35,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:35,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:35,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:16:35,403 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:16:35,404 INFO L377 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 28 treesize of output 10 [2019-12-07 17:16:35,404 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:35,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:35,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:35,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:16:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2406 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:35,535 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2406 backedges. 1189 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:35,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339401814] [2019-12-07 17:16:35,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:35,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:35,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525727959] [2019-12-07 17:16:35,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:35,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:35,674 INFO L87 Difference]: Start difference. First operand 3554 states and 5103 transitions. Second operand 6 states. [2019-12-07 17:16:46,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:46,961 INFO L93 Difference]: Finished difference Result 9126 states and 13131 transitions. [2019-12-07 17:16:46,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:46,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 506 [2019-12-07 17:16:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:46,967 INFO L225 Difference]: With dead ends: 9126 [2019-12-07 17:16:46,967 INFO L226 Difference]: Without dead ends: 5591 [2019-12-07 17:16:46,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:46,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5591 states. [2019-12-07 17:16:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5591 to 3863. [2019-12-07 17:16:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3863 states. [2019-12-07 17:16:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3863 states to 3863 states and 5469 transitions. [2019-12-07 17:16:47,091 INFO L78 Accepts]: Start accepts. Automaton has 3863 states and 5469 transitions. Word has length 506 [2019-12-07 17:16:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:47,091 INFO L462 AbstractCegarLoop]: Abstraction has 3863 states and 5469 transitions. [2019-12-07 17:16:47,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3863 states and 5469 transitions. [2019-12-07 17:16:47,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2019-12-07 17:16:47,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:47,096 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:47,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 17:16:47,297 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:47,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:47,298 INFO L82 PathProgramCache]: Analyzing trace with hash 785694346, now seen corresponding path program 1 times [2019-12-07 17:16:47,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:47,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858976824] [2019-12-07 17:16:47,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:47,723 INFO L264 TraceCheckSpWp]: Trace formula consists of 1075 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:47,727 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:47,742 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:16:47,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:16:47,742 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:47,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:47,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:47,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:16:47,768 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:16:47,768 INFO L377 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 28 treesize of output 10 [2019-12-07 17:16:47,768 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:47,770 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:47,770 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:47,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:16:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:47,901 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:48,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2428 backedges. 1211 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:48,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858976824] [2019-12-07 17:16:48,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:48,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:48,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704190820] [2019-12-07 17:16:48,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:48,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:48,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:48,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:48,042 INFO L87 Difference]: Start difference. First operand 3863 states and 5469 transitions. Second operand 6 states. [2019-12-07 17:16:55,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:55,066 INFO L93 Difference]: Finished difference Result 9771 states and 13889 transitions. [2019-12-07 17:16:55,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:55,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 506 [2019-12-07 17:16:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:55,071 INFO L225 Difference]: With dead ends: 9771 [2019-12-07 17:16:55,072 INFO L226 Difference]: Without dead ends: 5927 [2019-12-07 17:16:55,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1012 GetRequests, 1006 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:16:55,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-12-07 17:16:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 4229. [2019-12-07 17:16:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4229 states. [2019-12-07 17:16:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 5921 transitions. [2019-12-07 17:16:55,206 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 5921 transitions. Word has length 506 [2019-12-07 17:16:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:55,206 INFO L462 AbstractCegarLoop]: Abstraction has 4229 states and 5921 transitions. [2019-12-07 17:16:55,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:55,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 5921 transitions. [2019-12-07 17:16:55,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-12-07 17:16:55,211 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:55,211 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 12, 11, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:55,412 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 17:16:55,413 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:55,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:55,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1888787719, now seen corresponding path program 1 times [2019-12-07 17:16:55,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:16:55,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820423871] [2019-12-07 17:16:55,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 17:16:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:55,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:16:55,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:16:55,856 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:16:55,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:16:55,857 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:55,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:55,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:55,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:16:55,880 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:16:55,880 INFO L377 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 28 treesize of output 10 [2019-12-07 17:16:55,880 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:16:55,881 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:16:55,881 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:16:55,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:16:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:56,011 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:16:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 1201 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:16:56,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820423871] [2019-12-07 17:16:56,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:56,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:16:56,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819551794] [2019-12-07 17:16:56,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:56,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:16:56,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:56,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:56,158 INFO L87 Difference]: Start difference. First operand 4229 states and 5921 transitions. Second operand 6 states. [2019-12-07 17:17:06,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:06,329 INFO L93 Difference]: Finished difference Result 10111 states and 14294 transitions. [2019-12-07 17:17:06,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:06,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 507 [2019-12-07 17:17:06,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:06,333 INFO L225 Difference]: With dead ends: 10111 [2019-12-07 17:17:06,333 INFO L226 Difference]: Without dead ends: 5901 [2019-12-07 17:17:06,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:06,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5901 states. [2019-12-07 17:17:06,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5901 to 4243. [2019-12-07 17:17:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4243 states. [2019-12-07 17:17:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4243 states to 4243 states and 5907 transitions. [2019-12-07 17:17:06,458 INFO L78 Accepts]: Start accepts. Automaton has 4243 states and 5907 transitions. Word has length 507 [2019-12-07 17:17:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:06,458 INFO L462 AbstractCegarLoop]: Abstraction has 4243 states and 5907 transitions. [2019-12-07 17:17:06,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:06,458 INFO L276 IsEmpty]: Start isEmpty. Operand 4243 states and 5907 transitions. [2019-12-07 17:17:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-12-07 17:17:06,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:06,463 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 11, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:06,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 17:17:06,664 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:06,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1281297605, now seen corresponding path program 1 times [2019-12-07 17:17:06,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:06,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068302154] [2019-12-07 17:17:06,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:07,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 1077 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:07,066 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:07,084 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:07,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:07,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:07,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:07,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:07,094 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:07,109 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:07,109 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:07,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:07,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:07,111 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:07,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:07,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2439 backedges. 1222 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:07,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068302154] [2019-12-07 17:17:07,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:07,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:07,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398146763] [2019-12-07 17:17:07,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:07,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:07,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:07,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:07,389 INFO L87 Difference]: Start difference. First operand 4243 states and 5907 transitions. Second operand 6 states. [2019-12-07 17:17:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:15,939 INFO L93 Difference]: Finished difference Result 10056 states and 14147 transitions. [2019-12-07 17:17:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:15,940 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 507 [2019-12-07 17:17:15,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:15,944 INFO L225 Difference]: With dead ends: 10056 [2019-12-07 17:17:15,944 INFO L226 Difference]: Without dead ends: 5832 [2019-12-07 17:17:15,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1014 GetRequests, 1008 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5832 states. [2019-12-07 17:17:16,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5832 to 4272. [2019-12-07 17:17:16,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4272 states. [2019-12-07 17:17:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4272 states to 4272 states and 5937 transitions. [2019-12-07 17:17:16,075 INFO L78 Accepts]: Start accepts. Automaton has 4272 states and 5937 transitions. Word has length 507 [2019-12-07 17:17:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:16,076 INFO L462 AbstractCegarLoop]: Abstraction has 4272 states and 5937 transitions. [2019-12-07 17:17:16,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 4272 states and 5937 transitions. [2019-12-07 17:17:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2019-12-07 17:17:16,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:16,081 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:16,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 17:17:16,283 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:16,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:16,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2119995035, now seen corresponding path program 1 times [2019-12-07 17:17:16,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:16,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503997151] [2019-12-07 17:17:16,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:16,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:16,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:16,706 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:16,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:16,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:16,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:16,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:16,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:16,729 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:16,729 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:16,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:16,730 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:16,730 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:16,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:16,879 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:17,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2469 backedges. 1252 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:17,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503997151] [2019-12-07 17:17:17,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:17,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:17,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614676682] [2019-12-07 17:17:17,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:17,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:17,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:17,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:17,029 INFO L87 Difference]: Start difference. First operand 4272 states and 5937 transitions. Second operand 6 states. [2019-12-07 17:17:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:22,068 INFO L93 Difference]: Finished difference Result 10460 states and 14599 transitions. [2019-12-07 17:17:22,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:22,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 509 [2019-12-07 17:17:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:22,072 INFO L225 Difference]: With dead ends: 10460 [2019-12-07 17:17:22,072 INFO L226 Difference]: Without dead ends: 6207 [2019-12-07 17:17:22,075 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1018 GetRequests, 1012 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:22,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2019-12-07 17:17:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 4692. [2019-12-07 17:17:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4692 states. [2019-12-07 17:17:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4692 states to 4692 states and 6449 transitions. [2019-12-07 17:17:22,227 INFO L78 Accepts]: Start accepts. Automaton has 4692 states and 6449 transitions. Word has length 509 [2019-12-07 17:17:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:22,227 INFO L462 AbstractCegarLoop]: Abstraction has 4692 states and 6449 transitions. [2019-12-07 17:17:22,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4692 states and 6449 transitions. [2019-12-07 17:17:22,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2019-12-07 17:17:22,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:22,232 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:22,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 17:17:22,433 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash -920811700, now seen corresponding path program 1 times [2019-12-07 17:17:22,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:22,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711633947] [2019-12-07 17:17:22,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:22,865 INFO L264 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:22,868 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:22,883 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:22,884 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:22,884 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,891 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,891 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,892 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:22,905 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:22,906 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:22,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:22,907 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:22,907 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:23,047 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2478 backedges. 1261 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:23,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711633947] [2019-12-07 17:17:23,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:23,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:23,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907135343] [2019-12-07 17:17:23,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:23,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:23,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:23,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:23,197 INFO L87 Difference]: Start difference. First operand 4692 states and 6449 transitions. Second operand 6 states. [2019-12-07 17:17:31,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:31,835 INFO L93 Difference]: Finished difference Result 10821 states and 15004 transitions. [2019-12-07 17:17:31,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:31,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 510 [2019-12-07 17:17:31,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:31,840 INFO L225 Difference]: With dead ends: 10821 [2019-12-07 17:17:31,840 INFO L226 Difference]: Without dead ends: 6148 [2019-12-07 17:17:31,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 1014 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6148 states. [2019-12-07 17:17:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6148 to 4752. [2019-12-07 17:17:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4752 states. [2019-12-07 17:17:32,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4752 states to 4752 states and 6541 transitions. [2019-12-07 17:17:32,002 INFO L78 Accepts]: Start accepts. Automaton has 4752 states and 6541 transitions. Word has length 510 [2019-12-07 17:17:32,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:32,002 INFO L462 AbstractCegarLoop]: Abstraction has 4752 states and 6541 transitions. [2019-12-07 17:17:32,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:32,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4752 states and 6541 transitions. [2019-12-07 17:17:32,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-12-07 17:17:32,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:32,006 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:32,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 17:17:32,208 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:32,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1131008507, now seen corresponding path program 1 times [2019-12-07 17:17:32,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:32,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272183745] [2019-12-07 17:17:32,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:32,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:32,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:32,618 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:32,618 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:32,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:32,624 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:32,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:32,625 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:32,637 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:32,637 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:32,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:32,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:32,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:32,639 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:32,781 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:32,781 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:32,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272183745] [2019-12-07 17:17:32,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:32,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:32,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365087736] [2019-12-07 17:17:32,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:32,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:32,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:32,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:32,938 INFO L87 Difference]: Start difference. First operand 4752 states and 6541 transitions. Second operand 6 states. [2019-12-07 17:17:40,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:40,869 INFO L93 Difference]: Finished difference Result 11316 states and 15608 transitions. [2019-12-07 17:17:40,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:40,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 511 [2019-12-07 17:17:40,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:40,874 INFO L225 Difference]: With dead ends: 11316 [2019-12-07 17:17:40,874 INFO L226 Difference]: Without dead ends: 6583 [2019-12-07 17:17:40,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 1016 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:40,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6583 states. [2019-12-07 17:17:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6583 to 5202. [2019-12-07 17:17:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5202 states. [2019-12-07 17:17:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5202 states to 5202 states and 7083 transitions. [2019-12-07 17:17:41,052 INFO L78 Accepts]: Start accepts. Automaton has 5202 states and 7083 transitions. Word has length 511 [2019-12-07 17:17:41,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:41,053 INFO L462 AbstractCegarLoop]: Abstraction has 5202 states and 7083 transitions. [2019-12-07 17:17:41,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:41,053 INFO L276 IsEmpty]: Start isEmpty. Operand 5202 states and 7083 transitions. [2019-12-07 17:17:41,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-12-07 17:17:41,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:41,057 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:41,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 17:17:41,258 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:41,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1607047905, now seen corresponding path program 1 times [2019-12-07 17:17:41,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:41,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478741846] [2019-12-07 17:17:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:41,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:41,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:41,699 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:41,699 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:41,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:41,709 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,709 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:41,722 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:41,723 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:41,723 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:41,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:41,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:41,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2452 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:41,862 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:42,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2452 backedges. 1235 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:42,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1478741846] [2019-12-07 17:17:42,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:42,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:42,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120244367] [2019-12-07 17:17:42,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:42,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:42,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:42,017 INFO L87 Difference]: Start difference. First operand 5202 states and 7083 transitions. Second operand 6 states. [2019-12-07 17:17:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:50,736 INFO L93 Difference]: Finished difference Result 12231 states and 16707 transitions. [2019-12-07 17:17:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:50,737 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 512 [2019-12-07 17:17:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:50,741 INFO L225 Difference]: With dead ends: 12231 [2019-12-07 17:17:50,741 INFO L226 Difference]: Without dead ends: 7048 [2019-12-07 17:17:50,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:17:50,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7048 states. [2019-12-07 17:17:50,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7048 to 5592. [2019-12-07 17:17:50,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5592 states. [2019-12-07 17:17:50,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5592 states to 5592 states and 7505 transitions. [2019-12-07 17:17:50,933 INFO L78 Accepts]: Start accepts. Automaton has 5592 states and 7505 transitions. Word has length 512 [2019-12-07 17:17:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:50,933 INFO L462 AbstractCegarLoop]: Abstraction has 5592 states and 7505 transitions. [2019-12-07 17:17:50,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 5592 states and 7505 transitions. [2019-12-07 17:17:50,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2019-12-07 17:17:50,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:50,937 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:51,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 17:17:51,138 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:51,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:51,139 INFO L82 PathProgramCache]: Analyzing trace with hash -151860852, now seen corresponding path program 1 times [2019-12-07 17:17:51,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:17:51,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612038836] [2019-12-07 17:17:51,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 17:17:51,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:51,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 1086 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:17:51,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:17:51,584 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:17:51,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:17:51,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:51,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:51,591 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:51,592 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:17:51,604 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:17:51,605 INFO L377 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 28 treesize of output 10 [2019-12-07 17:17:51,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:17:51,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:17:51,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:17:51,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:17:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:51,750 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:17:51,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 1277 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:17:51,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612038836] [2019-12-07 17:17:51,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:51,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:17:51,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093541123] [2019-12-07 17:17:51,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:51,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:17:51,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:51,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:51,910 INFO L87 Difference]: Start difference. First operand 5592 states and 7505 transitions. Second operand 6 states. [2019-12-07 17:18:00,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:00,132 INFO L93 Difference]: Finished difference Result 12535 states and 16970 transitions. [2019-12-07 17:18:00,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:18:00,139 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 512 [2019-12-07 17:18:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:00,144 INFO L225 Difference]: With dead ends: 12535 [2019-12-07 17:18:00,144 INFO L226 Difference]: Without dead ends: 6962 [2019-12-07 17:18:00,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1024 GetRequests, 1018 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:18:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6962 states. [2019-12-07 17:18:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6962 to 5622. [2019-12-07 17:18:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5622 states. [2019-12-07 17:18:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5622 states to 5622 states and 7537 transitions. [2019-12-07 17:18:00,318 INFO L78 Accepts]: Start accepts. Automaton has 5622 states and 7537 transitions. Word has length 512 [2019-12-07 17:18:00,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:00,319 INFO L462 AbstractCegarLoop]: Abstraction has 5622 states and 7537 transitions. [2019-12-07 17:18:00,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 5622 states and 7537 transitions. [2019-12-07 17:18:00,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-12-07 17:18:00,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:00,323 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:00,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 17:18:00,524 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1307051770, now seen corresponding path program 1 times [2019-12-07 17:18:00,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:18:00,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851598462] [2019-12-07 17:18:00,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 17:18:00,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:00,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:18:00,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:00,940 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:18:00,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:18:00,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:00,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:00,948 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:00,948 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:18:00,961 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:18:00,961 INFO L377 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 28 treesize of output 10 [2019-12-07 17:18:00,962 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:00,963 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:00,963 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:00,963 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:18:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2462 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:18:01,101 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:18:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2462 backedges. 1245 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:18:01,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851598462] [2019-12-07 17:18:01,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:01,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:18:01,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459111931] [2019-12-07 17:18:01,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:18:01,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:18:01,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:18:01,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:01,256 INFO L87 Difference]: Start difference. First operand 5622 states and 7537 transitions. Second operand 6 states. [2019-12-07 17:18:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:10,370 INFO L93 Difference]: Finished difference Result 12539 states and 16935 transitions. [2019-12-07 17:18:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:18:10,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 513 [2019-12-07 17:18:10,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:10,381 INFO L225 Difference]: With dead ends: 12539 [2019-12-07 17:18:10,381 INFO L226 Difference]: Without dead ends: 6936 [2019-12-07 17:18:10,384 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:18:10,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6936 states. [2019-12-07 17:18:10,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6936 to 5622. [2019-12-07 17:18:10,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5622 states. [2019-12-07 17:18:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5622 states to 5622 states and 7479 transitions. [2019-12-07 17:18:10,561 INFO L78 Accepts]: Start accepts. Automaton has 5622 states and 7479 transitions. Word has length 513 [2019-12-07 17:18:10,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:10,561 INFO L462 AbstractCegarLoop]: Abstraction has 5622 states and 7479 transitions. [2019-12-07 17:18:10,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:10,561 INFO L276 IsEmpty]: Start isEmpty. Operand 5622 states and 7479 transitions. [2019-12-07 17:18:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2019-12-07 17:18:10,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:10,566 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:10,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 17:18:10,767 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:10,767 INFO L82 PathProgramCache]: Analyzing trace with hash -323056925, now seen corresponding path program 1 times [2019-12-07 17:18:10,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:18:10,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521402977] [2019-12-07 17:18:10,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 17:18:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:11,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 1083 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:18:11,181 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:11,196 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:18:11,196 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2019-12-07 17:18:11,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:11,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:11,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:11,204 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 17:18:11,218 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:18:11,218 INFO L377 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 28 treesize of output 10 [2019-12-07 17:18:11,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:11,220 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:11,220 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:11,220 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 17:18:11,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:18:11,383 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:18:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2503 backedges. 1286 proven. 0 refuted. 0 times theorem prover too weak. 1217 trivial. 0 not checked. [2019-12-07 17:18:11,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521402977] [2019-12-07 17:18:11,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:11,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:18:11,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388579287] [2019-12-07 17:18:11,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:18:11,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:18:11,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:18:11,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:18:11,527 INFO L87 Difference]: Start difference. First operand 5622 states and 7479 transitions. Second operand 6 states. [2019-12-07 17:18:16,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:16,424 INFO L93 Difference]: Finished difference Result 12920 states and 17247 transitions. [2019-12-07 17:18:16,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:18:16,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 513 [2019-12-07 17:18:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:16,433 INFO L225 Difference]: With dead ends: 12920 [2019-12-07 17:18:16,433 INFO L226 Difference]: Without dead ends: 7317 [2019-12-07 17:18:16,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1026 GetRequests, 1020 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:18:16,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7317 states. [2019-12-07 17:18:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7317 to 6102. [2019-12-07 17:18:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6102 states. [2019-12-07 17:18:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6102 states to 6102 states and 8021 transitions. [2019-12-07 17:18:16,622 INFO L78 Accepts]: Start accepts. Automaton has 6102 states and 8021 transitions. Word has length 513 [2019-12-07 17:18:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:16,622 INFO L462 AbstractCegarLoop]: Abstraction has 6102 states and 8021 transitions. [2019-12-07 17:18:16,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:18:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6102 states and 8021 transitions. [2019-12-07 17:18:16,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:18:16,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:16,626 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:16,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 17:18:16,828 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1920823596, now seen corresponding path program 1 times [2019-12-07 17:18:16,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:18:16,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161311161] [2019-12-07 17:18:16,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 17:18:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:17,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:18:17,647 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:17,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select 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 9 [2019-12-07 17:18:17,653 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,656 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:17,656 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:18:17,675 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:18:17,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2019-12-07 17:18:17,676 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:17,684 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 17:18:17,702 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:18:17,702 INFO L377 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 28 treesize of output 10 [2019-12-07 17:18:17,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:17,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:17,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:5 [2019-12-07 17:18:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-12-07 17:18:17,886 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:18:18,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1473 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2019-12-07 17:18:18,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161311161] [2019-12-07 17:18:18,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:18,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 17:18:18,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077793361] [2019-12-07 17:18:18,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:18:18,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:18:18,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:18:18,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:18:18,047 INFO L87 Difference]: Start difference. First operand 6102 states and 8021 transitions. Second operand 7 states. [2019-12-07 17:18:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:18:26,732 INFO L93 Difference]: Finished difference Result 15633 states and 20600 transitions. [2019-12-07 17:18:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:18:26,734 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 517 [2019-12-07 17:18:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:18:26,739 INFO L225 Difference]: With dead ends: 15633 [2019-12-07 17:18:26,739 INFO L226 Difference]: Without dead ends: 9550 [2019-12-07 17:18:26,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1035 GetRequests, 1026 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:18:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9550 states. [2019-12-07 17:18:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9550 to 6744. [2019-12-07 17:18:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6744 states. [2019-12-07 17:18:26,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6744 states to 6744 states and 8873 transitions. [2019-12-07 17:18:26,956 INFO L78 Accepts]: Start accepts. Automaton has 6744 states and 8873 transitions. Word has length 517 [2019-12-07 17:18:26,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:18:26,956 INFO L462 AbstractCegarLoop]: Abstraction has 6744 states and 8873 transitions. [2019-12-07 17:18:26,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:18:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6744 states and 8873 transitions. [2019-12-07 17:18:26,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2019-12-07 17:18:26,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:18:26,961 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 13, 13, 12, 12, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:18:27,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 17:18:27,162 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:18:27,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:18:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1671368488, now seen corresponding path program 1 times [2019-12-07 17:18:27,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:18:27,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967783672] [2019-12-07 17:18:27,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 17:18:28,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:28,144 INFO L264 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-07 17:18:28,154 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:28,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 10 treesize of output 8 [2019-12-07 17:18:28,245 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,466 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:18:28,466 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,468 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_659|], 2=[|v_#memory_$Pointer$.base_654|, |v_#memory_$Pointer$.base_653|]} [2019-12-07 17:18:28,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:18:28,517 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,631 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 17:18:28,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:18:28,651 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,687 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,691 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,693 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:18:28,695 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,708 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,708 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 17:18:28,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 17:18:28,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,722 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:18:28,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,727 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 17:18:28,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:18:28,753 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:28,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,776 INFO L377 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 35 treesize of output 23 [2019-12-07 17:18:28,776 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,785 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,785 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:18:28,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,790 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 17:18:28,790 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,794 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,794 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:18:28,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 17:18:28,798 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,803 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 17:18:28,806 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:28,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,829 INFO L377 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 35 treesize of output 23 [2019-12-07 17:18:28,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,837 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:18:28,840 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_654|], 2=[|v_#memory_$Pointer$.base_666|]} [2019-12-07 17:18:28,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:18:28,842 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:28,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,882 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 17:18:28,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:28,884 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,897 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 17:18:28,897 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,897 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 17:18:28,901 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:28,923 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:28,927 INFO L377 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 35 treesize of output 23 [2019-12-07 17:18:28,927 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:28,935 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 17:18:28,937 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_655|], 2=[|v_#memory_$Pointer$.base_668|]} [2019-12-07 17:18:28,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 37 [2019-12-07 17:18:28,940 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:28,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,984 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:28,984 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 17:18:28,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:18:28,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:28,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:28,985 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 17:18:29,002 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 17:18:29,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:29,003 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 17:18:29,005 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_699|, |v_#memory_$Pointer$.offset_653|], 2=[|v_#memory_$Pointer$.base_658|, |v_#memory_$Pointer$.base_669|]} [2019-12-07 17:18:29,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:29,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:29,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 17:18:29,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:29,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select 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 15 [2019-12-07 17:18:29,041 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:29,063 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,065 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:29,079 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,082 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2019-12-07 17:18:29,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:29,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:18:29,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 22 treesize of output 14 [2019-12-07 17:18:29,087 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:29,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,092 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:29,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,105 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:18:29,105 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:142, output treesize:35 [2019-12-07 17:18:29,146 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 17:18:29,146 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:18:29,150 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:29,150 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:18:29,151 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 17:18:29,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 1062 proven. 91 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-12-07 17:18:29,506 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:18:29,528 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_$Pointer$.offset_653|], 2=[|v_#memory_$Pointer$.base_658|]} [2019-12-07 17:18:37,728 WARN L192 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 35 [2019-12-07 17:18:37,728 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:37,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 106 [2019-12-07 17:18:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:18:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,749 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:18:37,749 INFO L377 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 106 treesize of output 106 [2019-12-07 17:18:37,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:18:37,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:18:37,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:18:37,755 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:18:37,756 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_65], 1=[v_arrayElimCell_66]} [2019-12-07 17:18:37,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967783672] [2019-12-07 17:18:37,759 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5532cbc5 [2019-12-07 17:18:37,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [383838177] [2019-12-07 17:18:37,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/cvc4 Starting monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:18:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:50,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-07 17:18:50,186 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5532cbc5 [2019-12-07 17:18:50,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344746936] [2019-12-07 17:18:50,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_44aa0780-d3c5-418e-a362-a4fb7d0c0c9c/bin/uautomizer/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:18:50,525 INFO L264 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:18:50,531 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:18:50,531 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@5532cbc5 [2019-12-07 17:18:50,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:18:50,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:18:50,532 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 17:18:50,532 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:18:51,139 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 cvc4 --incremental --print-success --lang smt --rewrite-divk,34 mathsat -unsat_core_generation=3,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:18:51,222 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:18:51,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:18:51 BoogieIcfgContainer [2019-12-07 17:18:51,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:18:51,222 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:18:51,222 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:18:51,223 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:18:51,223 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:14:47" (3/4) ... [2019-12-07 17:18:51,225 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:18:51,225 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:18:51,226 INFO L168 Benchmark]: Toolchain (without parser) took 246548.60 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.9 MB). Free memory was 947.0 MB in the beginning and 1.3 GB in the end (delta: -347.6 MB). Peak memory consumption was 136.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,226 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:18:51,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -135.3 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,227 INFO L168 Benchmark]: Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,227 INFO L168 Benchmark]: RCFGBuilder took 2199.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,227 INFO L168 Benchmark]: TraceAbstraction took 243821.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 374.3 MB). Free memory was 963.7 MB in the beginning and 1.3 GB in the end (delta: -330.9 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:18:51,227 INFO L168 Benchmark]: Witness Printer took 2.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:18:51,228 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.04 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -135.3 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2199.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 963.7 MB in the end (delta: 105.2 MB). Peak memory consumption was 105.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 243821.98 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 374.3 MB). Free memory was 963.7 MB in the beginning and 1.3 GB in the end (delta: -330.9 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1754]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [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)) [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 [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) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [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 [L1361] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1364] ret = __VERIFIER_nondet_int() [L1365] COND TRUE blastFlag == 2 [L1366] blastFlag = 3 [L1370] COND FALSE !(ret <= 0) [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND TRUE s->options & 2097152UL [L1383] EXPR s->s3 [L1383] (s->s3)->tmp.use_rsa_tmp = 1 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND TRUE (s->s3)->tmp.use_rsa_tmp [L1405] ret = __VERIFIER_nondet_int() [L1406] COND TRUE blastFlag == 3 [L1407] blastFlag = 4 [L1411] COND FALSE !(ret <= 0) [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND TRUE blastFlag == 4 [L1457] blastFlag = 5 [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND TRUE s->state == 8576 [L1507] ret = __VERIFIER_nondet_int() [L1508] COND TRUE blastFlag == 5 [L1509] blastFlag = 6 [L1513] COND FALSE !(ret <= 0) [L1518] COND FALSE !(ret == 2) [L1521] ret = __VERIFIER_nondet_int() [L1522] COND TRUE blastFlag == 6 [L1523] blastFlag = 7 [L1527] COND FALSE !(ret <= 0) [L1532] s->init_num = 0 [L1533] s->state = 8592 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND TRUE s->state == 8592 [L1538] ret = __VERIFIER_nondet_int() [L1539] COND TRUE blastFlag == 7 [L1540] blastFlag = 8 [L1544] COND FALSE !(ret <= 0) [L1549] s->state = 8608 [L1550] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND TRUE s->state == 8608 [L1554] ret = __VERIFIER_nondet_int() [L1555] COND TRUE blastFlag == 8 [L1556] blastFlag = 9 [L1560] COND FALSE !(ret <= 0) [L1565] s->state = 8640 [L1566] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND TRUE blastFlag == 9 [L1572] blastFlag = 10 [L1584] COND FALSE !(ret <= 0) [L1589] s->hit [L1589] COND FALSE !(s->hit) [L1592] s->state = 8656 [L1594] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1598] EXPR s->session [L1598] EXPR s->s3 [L1598] EXPR (s->s3)->tmp.new_cipher [L1598] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND TRUE blastFlag == 10 [L1607] blastFlag = 11 [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8672 [L1621] s->init_num = 0 [L1622] COND FALSE !(! tmp___10) [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1631] ret = __VERIFIER_nondet_int() [L1632] COND TRUE blastFlag == 11 [L1633] blastFlag = 12 [L1641] COND FALSE !(ret <= 0) [L1646] s->state = 8448 [L1647] s->hit [L1647] COND TRUE s->hit [L1648] EXPR s->s3 [L1648] (s->s3)->tmp.next_state = 8640 [L1652] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND TRUE blastFlag == 12 [L1575] blastFlag = 13 [L1584] COND FALSE !(ret <= 0) [L1589] s->hit [L1589] COND FALSE !(s->hit) [L1592] s->state = 8656 [L1594] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND TRUE s->state == 8656 [L1598] EXPR s->session [L1598] EXPR s->s3 [L1598] EXPR (s->s3)->tmp.new_cipher [L1598] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) [L1609] COND TRUE blastFlag == 13 [L1610] blastFlag = 14 [L1615] COND FALSE !(ret <= 0) [L1620] s->state = 8672 [L1621] s->init_num = 0 [L1622] COND FALSE !(! tmp___10) [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state [L1235] COND TRUE s->state == 8672 [L1631] ret = __VERIFIER_nondet_int() [L1632] COND FALSE !(blastFlag == 11) [L1635] COND TRUE blastFlag == 14 [L1636] blastFlag = 15 [L1641] COND FALSE !(ret <= 0) [L1646] s->state = 8448 [L1647] s->hit [L1647] COND TRUE s->hit [L1648] EXPR s->s3 [L1648] (s->s3)->tmp.next_state = 8640 [L1652] s->init_num = 0 [L1713] EXPR s->s3 [L1713] EXPR (s->s3)->tmp.reuse_message [L1713] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1742] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND TRUE blastFlag == 15 [L1754] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 154 locations, 1 error locations. Result: UNKNOWN, OverallTime: 243.7s, OverallIterations: 33, TraceHistogramMax: 15, AutomataDifference: 189.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7017 SDtfs, 6759 SDslu, 15435 SDs, 0 SdLazy, 12710 SolverSat, 1597 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 176.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27659 GetRequests, 27497 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6744occurred in iteration=32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 32 MinimizatonAttempts, 35748 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.8s SsaConstructionTime, 7.0s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 13837 NumberOfCodeBlocks, 13837 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 27610 ConstructedInterpolants, 0 QuantifiedInterpolants, 18678323 SizeOfPredicates, 76 NumberOfNonLiveVariables, 29584 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 64 InterpolantComputations, 64 PerfectInterpolantSequences, 119894/119894 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...