./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.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_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 2022a41801b102600c4bc475b4f1b54abdd4798f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 2022a41801b102600c4bc475b4f1b54abdd4798f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:28:41,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:28:41,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:28:41,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:28:41,779 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:28:41,780 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:28:41,781 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:28:41,782 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:28:41,783 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:28:41,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:28:41,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:28:41,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:28:41,786 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:28:41,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:28:41,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:28:41,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:28:41,788 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:28:41,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:28:41,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:28:41,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:28:41,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:28:41,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:28:41,794 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:28:41,795 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:28:41,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:28:41,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:28:41,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:28:41,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:28:41,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:28:41,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:28:41,798 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:28:41,798 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:28:41,799 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:28:41,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:28:41,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:28:41,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:28:41,800 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:28:41,800 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:28:41,800 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:28:41,801 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:28:41,801 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:28:41,802 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:28:41,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:28:41,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:28:41,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:28:41,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:28:41,812 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:28:41,812 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:28:41,812 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:28:41,812 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:28:41,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:28:41,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:28:41,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:28:41,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:28:41,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:28:41,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:28:41,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:28:41,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:28:41,815 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:28:41,815 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:28:41,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:28:41,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:28:41,815 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:28:41,815 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_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-12-07 18:28:41,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:28:41,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:28:41,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:28:41,932 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:28:41,932 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:28:41,933 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:28:41,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/6275d4507/355db54a02104539a07a59f4299345a0/FLAG687cc14e7 [2019-12-07 18:28:42,470 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:28:42,471 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:28:42,483 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/6275d4507/355db54a02104539a07a59f4299345a0/FLAG687cc14e7 [2019-12-07 18:28:42,760 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/6275d4507/355db54a02104539a07a59f4299345a0 [2019-12-07 18:28:42,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:28:42,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:28:42,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:28:42,771 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:28:42,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:28:42,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:28:42" (1/1) ... [2019-12-07 18:28:42,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698068c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:42, skipping insertion in model container [2019-12-07 18:28:42,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:28:42" (1/1) ... [2019-12-07 18:28:42,783 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:28:42,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:28:43,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:28:43,122 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:28:43,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:28:43,199 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:28:43,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43 WrapperNode [2019-12-07 18:28:43,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:28:43,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:28:43,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:28:43,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:28:43,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,223 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,253 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:28:43,254 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:28:43,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:28:43,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:28:43,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... [2019-12-07 18:28:43,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:28:43,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:28:43,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:28:43,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:28:43,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:28:43,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:28:43,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:28:43,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:28:43,485 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:28:43,975 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 18:28:43,975 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 18:28:43,976 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:28:43,976 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:28:43,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:43 BoogieIcfgContainer [2019-12-07 18:28:43,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:28:43,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:28:43,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:28:43,980 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:28:43,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:28:42" (1/3) ... [2019-12-07 18:28:43,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e764e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:28:43, skipping insertion in model container [2019-12-07 18:28:43,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:28:43" (2/3) ... [2019-12-07 18:28:43,981 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e764e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:28:43, skipping insertion in model container [2019-12-07 18:28:43,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:43" (3/3) ... [2019-12-07 18:28:43,982 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:28:43,989 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:28:43,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:28:44,002 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:28:44,019 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:28:44,020 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:28:44,020 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:28:44,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:28:44,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:28:44,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:28:44,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:28:44,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:28:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 18:28:44,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:28:44,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:44,040 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] [2019-12-07 18:28:44,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:44,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-12-07 18:28:44,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:44,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783743378] [2019-12-07 18:28:44,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:44,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:44,246 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 18:28:44,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783743378] [2019-12-07 18:28:44,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:44,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:44,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704075829] [2019-12-07 18:28:44,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:44,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:44,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:44,262 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 18:28:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:44,566 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-12-07 18:28:44,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:44,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:28:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:44,576 INFO L225 Difference]: With dead ends: 323 [2019-12-07 18:28:44,576 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 18:28:44,579 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 18:28:44,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 18:28:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 18:28:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:44,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-12-07 18:28:44,612 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-12-07 18:28:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:44,613 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-12-07 18:28:44,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-12-07 18:28:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:28:44,615 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:44,615 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] [2019-12-07 18:28:44,615 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:44,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:44,615 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-12-07 18:28:44,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:44,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875037819] [2019-12-07 18:28:44,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:44,694 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 18:28:44,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875037819] [2019-12-07 18:28:44,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:44,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:44,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545297251] [2019-12-07 18:28:44,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:44,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:44,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:44,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:44,697 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-12-07 18:28:44,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:44,952 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 18:28:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:44,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 18:28:44,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:44,954 INFO L225 Difference]: With dead ends: 290 [2019-12-07 18:28:44,954 INFO L226 Difference]: Without dead ends: 163 [2019-12-07 18:28:44,955 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 18:28:44,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-12-07 18:28:44,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-12-07 18:28:44,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-12-07 18:28:44,964 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-12-07 18:28:44,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:44,964 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-12-07 18:28:44,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-12-07 18:28:44,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:44,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:44,966 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] [2019-12-07 18:28:44,966 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:44,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:44,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-12-07 18:28:44,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:44,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122756873] [2019-12-07 18:28:44,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:45,044 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 18:28:45,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122756873] [2019-12-07 18:28:45,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:45,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:45,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510534475] [2019-12-07 18:28:45,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:45,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:45,045 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-12-07 18:28:45,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:45,265 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-12-07 18:28:45,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:45,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:28:45,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:45,267 INFO L225 Difference]: With dead ends: 289 [2019-12-07 18:28:45,267 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 18:28:45,268 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 18:28:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 18:28:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-12-07 18:28:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-12-07 18:28:45,275 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-12-07 18:28:45,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:45,276 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-12-07 18:28:45,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-12-07 18:28:45,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:45,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:45,278 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] [2019-12-07 18:28:45,278 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:45,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:45,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-12-07 18:28:45,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:45,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740166767] [2019-12-07 18:28:45,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:45,329 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 18:28:45,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740166767] [2019-12-07 18:28:45,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:45,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:45,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934038285] [2019-12-07 18:28:45,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:45,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:45,330 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-12-07 18:28:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:45,523 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-12-07 18:28:45,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:45,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:28:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:45,524 INFO L225 Difference]: With dead ends: 287 [2019-12-07 18:28:45,524 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 18:28:45,525 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 18:28:45,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 18:28:45,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 18:28:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:45,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-12-07 18:28:45,531 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-12-07 18:28:45,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:45,531 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-12-07 18:28:45,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-12-07 18:28:45,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:45,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:45,532 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] [2019-12-07 18:28:45,532 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-12-07 18:28:45,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:45,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549006262] [2019-12-07 18:28:45,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:45,572 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 18:28:45,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549006262] [2019-12-07 18:28:45,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:45,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:45,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21444865] [2019-12-07 18:28:45,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:45,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:45,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:45,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:45,574 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-12-07 18:28:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:45,761 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-12-07 18:28:45,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:45,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:28:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:45,762 INFO L225 Difference]: With dead ends: 286 [2019-12-07 18:28:45,762 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:28:45,763 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 18:28:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:28:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 18:28:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-12-07 18:28:45,768 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-12-07 18:28:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:45,768 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-12-07 18:28:45,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-12-07 18:28:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:28:45,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:45,769 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] [2019-12-07 18:28:45,769 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:45,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:45,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-12-07 18:28:45,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:45,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374917757] [2019-12-07 18:28:45,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:45,803 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 18:28:45,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374917757] [2019-12-07 18:28:45,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:45,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:45,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568612540] [2019-12-07 18:28:45,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:45,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:45,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:45,805 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-12-07 18:28:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:45,983 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-12-07 18:28:45,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:45,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:28:45,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:45,984 INFO L225 Difference]: With dead ends: 286 [2019-12-07 18:28:45,984 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:28:45,985 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 18:28:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:28:45,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 18:28:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-12-07 18:28:45,988 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-12-07 18:28:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:45,989 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-12-07 18:28:45,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:45,989 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-12-07 18:28:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:28:45,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:45,989 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] [2019-12-07 18:28:45,990 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-12-07 18:28:45,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:45,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236454769] [2019-12-07 18:28:45,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:46,023 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 18:28:46,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236454769] [2019-12-07 18:28:46,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:46,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:46,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062128112] [2019-12-07 18:28:46,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:46,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:46,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:46,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:46,024 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-12-07 18:28:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:46,214 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-12-07 18:28:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:46,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:28:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:46,216 INFO L225 Difference]: With dead ends: 286 [2019-12-07 18:28:46,216 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:28:46,216 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 18:28:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:28:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 18:28:46,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-12-07 18:28:46,221 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-12-07 18:28:46,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:46,221 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-12-07 18:28:46,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:46,221 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-12-07 18:28:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 18:28:46,222 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:46,222 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] [2019-12-07 18:28:46,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:46,222 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-12-07 18:28:46,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:46,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424126248] [2019-12-07 18:28:46,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:46,263 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 18:28:46,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424126248] [2019-12-07 18:28:46,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:46,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:46,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008639161] [2019-12-07 18:28:46,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:46,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:46,264 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-12-07 18:28:46,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:46,482 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-12-07 18:28:46,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:46,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-07 18:28:46,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:46,483 INFO L225 Difference]: With dead ends: 286 [2019-12-07 18:28:46,483 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 18:28:46,483 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 18:28:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 18:28:46,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-12-07 18:28:46,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-12-07 18:28:46,487 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-12-07 18:28:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:46,487 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-12-07 18:28:46,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:46,487 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-12-07 18:28:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:28:46,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:46,488 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] [2019-12-07 18:28:46,488 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:46,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:46,488 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-12-07 18:28:46,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:46,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449659867] [2019-12-07 18:28:46,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:46,519 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 18:28:46,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449659867] [2019-12-07 18:28:46,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:46,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:46,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913003480] [2019-12-07 18:28:46,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:46,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:46,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:46,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:46,520 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-12-07 18:28:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:46,705 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-12-07 18:28:46,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:46,705 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 18:28:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:46,706 INFO L225 Difference]: With dead ends: 276 [2019-12-07 18:28:46,706 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 18:28:46,707 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 18:28:46,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 18:28:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-12-07 18:28:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 18:28:46,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-07 18:28:46,710 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-12-07 18:28:46,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:46,710 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-07 18:28:46,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-07 18:28:46,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 18:28:46,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:46,711 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] [2019-12-07 18:28:46,711 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:46,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:46,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-12-07 18:28:46,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:46,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069887683] [2019-12-07 18:28:46,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:46,744 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 18:28:46,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069887683] [2019-12-07 18:28:46,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:46,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:46,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699831028] [2019-12-07 18:28:46,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:46,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:46,745 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-12-07 18:28:46,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:46,972 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-12-07 18:28:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:46,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 18:28:46,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:46,974 INFO L225 Difference]: With dead ends: 316 [2019-12-07 18:28:46,974 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 18:28:46,974 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 18:28:46,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 18:28:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 18:28:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-12-07 18:28:46,978 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-12-07 18:28:46,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:46,978 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-12-07 18:28:46,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-12-07 18:28:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 18:28:46,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:46,978 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] [2019-12-07 18:28:46,979 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:46,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-12-07 18:28:46,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:46,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253601309] [2019-12-07 18:28:46,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:47,017 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 18:28:47,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253601309] [2019-12-07 18:28:47,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:47,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:47,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702418825] [2019-12-07 18:28:47,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:47,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:47,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:47,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:47,019 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-12-07 18:28:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:47,254 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-12-07 18:28:47,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:47,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 18:28:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:47,256 INFO L225 Difference]: With dead ends: 338 [2019-12-07 18:28:47,256 INFO L226 Difference]: Without dead ends: 189 [2019-12-07 18:28:47,256 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 18:28:47,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-12-07 18:28:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-12-07 18:28:47,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-12-07 18:28:47,260 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-12-07 18:28:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:47,260 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-12-07 18:28:47,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-12-07 18:28:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:28:47,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:47,260 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] [2019-12-07 18:28:47,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:47,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-12-07 18:28:47,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:47,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466651438] [2019-12-07 18:28:47,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:47,287 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 18:28:47,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466651438] [2019-12-07 18:28:47,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:47,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:47,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064820523] [2019-12-07 18:28:47,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:47,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:47,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:47,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:47,289 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-12-07 18:28:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:47,514 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-12-07 18:28:47,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:47,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:28:47,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:47,516 INFO L225 Difference]: With dead ends: 337 [2019-12-07 18:28:47,516 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 18:28:47,516 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 18:28:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 18:28:47,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-12-07 18:28:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-12-07 18:28:47,520 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-12-07 18:28:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:47,520 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-12-07 18:28:47,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-12-07 18:28:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:28:47,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:47,521 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] [2019-12-07 18:28:47,521 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:47,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:47,521 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-12-07 18:28:47,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:47,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509995158] [2019-12-07 18:28:47,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:47,549 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 18:28:47,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509995158] [2019-12-07 18:28:47,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:47,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:47,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989550072] [2019-12-07 18:28:47,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:47,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:47,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:47,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:47,550 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-12-07 18:28:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:47,773 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-12-07 18:28:47,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:47,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:28:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:47,774 INFO L225 Difference]: With dead ends: 335 [2019-12-07 18:28:47,774 INFO L226 Difference]: Without dead ends: 186 [2019-12-07 18:28:47,775 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 18:28:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-07 18:28:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-12-07 18:28:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-12-07 18:28:47,778 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-12-07 18:28:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:47,778 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-12-07 18:28:47,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-12-07 18:28:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:28:47,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:47,779 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] [2019-12-07 18:28:47,779 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-12-07 18:28:47,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:47,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739041720] [2019-12-07 18:28:47,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:47,808 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 18:28:47,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739041720] [2019-12-07 18:28:47,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:47,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:47,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959034392] [2019-12-07 18:28:47,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:47,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:47,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:47,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:47,809 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-12-07 18:28:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:48,035 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-12-07 18:28:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:48,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:28:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:48,036 INFO L225 Difference]: With dead ends: 334 [2019-12-07 18:28:48,036 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 18:28:48,037 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 18:28:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 18:28:48,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 18:28:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-12-07 18:28:48,040 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-12-07 18:28:48,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:48,041 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-12-07 18:28:48,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:48,041 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-12-07 18:28:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:28:48,041 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:48,042 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] [2019-12-07 18:28:48,042 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:48,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:48,042 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-12-07 18:28:48,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:48,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110035081] [2019-12-07 18:28:48,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:48,083 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 18:28:48,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110035081] [2019-12-07 18:28:48,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:48,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:48,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397112391] [2019-12-07 18:28:48,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:48,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:48,084 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-12-07 18:28:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:48,324 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-12-07 18:28:48,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:48,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 18:28:48,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:48,326 INFO L225 Difference]: With dead ends: 334 [2019-12-07 18:28:48,326 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 18:28:48,326 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 18:28:48,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 18:28:48,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 18:28:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:48,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-07 18:28:48,331 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-12-07 18:28:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:48,331 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-07 18:28:48,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-07 18:28:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:28:48,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:48,332 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] [2019-12-07 18:28:48,332 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:48,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-12-07 18:28:48,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:48,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452304603] [2019-12-07 18:28:48,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:48,358 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 18:28:48,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452304603] [2019-12-07 18:28:48,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:48,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:48,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66558108] [2019-12-07 18:28:48,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:48,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:48,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:48,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:48,359 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-12-07 18:28:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:48,551 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-12-07 18:28:48,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:48,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 18:28:48,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:48,552 INFO L225 Difference]: With dead ends: 334 [2019-12-07 18:28:48,552 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 18:28:48,553 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 18:28:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 18:28:48,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 18:28:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-12-07 18:28:48,557 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-12-07 18:28:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:48,557 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-12-07 18:28:48,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-12-07 18:28:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 18:28:48,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:48,558 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] [2019-12-07 18:28:48,558 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-12-07 18:28:48,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:48,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815170753] [2019-12-07 18:28:48,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:48,590 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 18:28:48,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815170753] [2019-12-07 18:28:48,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:48,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:48,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763304854] [2019-12-07 18:28:48,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:48,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:48,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:48,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:48,591 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-12-07 18:28:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:48,819 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-12-07 18:28:48,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:48,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-07 18:28:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:48,820 INFO L225 Difference]: With dead ends: 334 [2019-12-07 18:28:48,820 INFO L226 Difference]: Without dead ends: 185 [2019-12-07 18:28:48,820 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 18:28:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-12-07 18:28:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-12-07 18:28:48,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:48,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-12-07 18:28:48,823 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-12-07 18:28:48,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:48,824 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-12-07 18:28:48,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:48,824 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-12-07 18:28:48,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 18:28:48,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:48,824 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] [2019-12-07 18:28:48,824 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:48,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:48,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-12-07 18:28:48,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:48,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281631963] [2019-12-07 18:28:48,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:48,850 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 18:28:48,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281631963] [2019-12-07 18:28:48,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:48,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:48,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923463395] [2019-12-07 18:28:48,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:48,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:48,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:48,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:48,851 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-12-07 18:28:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:49,027 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-12-07 18:28:49,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:49,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 18:28:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:49,029 INFO L225 Difference]: With dead ends: 324 [2019-12-07 18:28:49,029 INFO L226 Difference]: Without dead ends: 175 [2019-12-07 18:28:49,029 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 18:28:49,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-12-07 18:28:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-12-07 18:28:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 18:28:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-12-07 18:28:49,033 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-12-07 18:28:49,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:49,034 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-12-07 18:28:49,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-12-07 18:28:49,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:28:49,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:49,034 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] [2019-12-07 18:28:49,035 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:49,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-12-07 18:28:49,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:49,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202596906] [2019-12-07 18:28:49,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:49,081 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 18:28:49,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202596906] [2019-12-07 18:28:49,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:49,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:49,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032449675] [2019-12-07 18:28:49,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:49,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:49,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:49,083 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-12-07 18:28:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:49,394 INFO L93 Difference]: Finished difference Result 422 states and 635 transitions. [2019-12-07 18:28:49,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:49,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 18:28:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:49,396 INFO L225 Difference]: With dead ends: 422 [2019-12-07 18:28:49,396 INFO L226 Difference]: Without dead ends: 273 [2019-12-07 18:28:49,396 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 18:28:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-12-07 18:28:49,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2019-12-07 18:28:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 18:28:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-12-07 18:28:49,400 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-12-07 18:28:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:49,400 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-12-07 18:28:49,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-12-07 18:28:49,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 18:28:49,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:49,400 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] [2019-12-07 18:28:49,400 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:49,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:49,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-12-07 18:28:49,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:49,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432241803] [2019-12-07 18:28:49,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:49,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:49,443 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 18:28:49,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432241803] [2019-12-07 18:28:49,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:49,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:49,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626715344] [2019-12-07 18:28:49,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:49,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:49,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:49,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:49,445 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-12-07 18:28:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:49,697 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-12-07 18:28:49,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:49,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 18:28:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:49,699 INFO L225 Difference]: With dead ends: 427 [2019-12-07 18:28:49,699 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 18:28:49,699 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 18:28:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 18:28:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-12-07 18:28:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-12-07 18:28:49,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-12-07 18:28:49,703 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-12-07 18:28:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:49,703 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-12-07 18:28:49,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-12-07 18:28:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 18:28:49,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:49,703 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] [2019-12-07 18:28:49,704 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-12-07 18:28:49,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:49,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562676040] [2019-12-07 18:28:49,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:49,739 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 18:28:49,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562676040] [2019-12-07 18:28:49,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:49,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:49,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831955954] [2019-12-07 18:28:49,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:49,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:49,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:49,740 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-12-07 18:28:50,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:50,042 INFO L93 Difference]: Finished difference Result 492 states and 757 transitions. [2019-12-07 18:28:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:50,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 18:28:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:50,043 INFO L225 Difference]: With dead ends: 492 [2019-12-07 18:28:50,043 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:28:50,044 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 18:28:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:28:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 223. [2019-12-07 18:28:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-12-07 18:28:50,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-12-07 18:28:50,047 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-12-07 18:28:50,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:50,047 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-12-07 18:28:50,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-12-07 18:28:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 18:28:50,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:50,048 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] [2019-12-07 18:28:50,048 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-12-07 18:28:50,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:50,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743505338] [2019-12-07 18:28:50,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:50,085 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 18:28:50,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743505338] [2019-12-07 18:28:50,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:50,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:50,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839536248] [2019-12-07 18:28:50,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:50,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:50,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:50,086 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-12-07 18:28:50,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:50,376 INFO L93 Difference]: Finished difference Result 493 states and 757 transitions. [2019-12-07 18:28:50,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:50,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 18:28:50,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:50,378 INFO L225 Difference]: With dead ends: 493 [2019-12-07 18:28:50,378 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:28:50,379 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 18:28:50,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:28:50,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 233. [2019-12-07 18:28:50,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-12-07 18:28:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-12-07 18:28:50,382 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-12-07 18:28:50,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:50,382 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-12-07 18:28:50,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-12-07 18:28:50,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 18:28:50,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:50,383 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] [2019-12-07 18:28:50,383 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:50,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:50,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-12-07 18:28:50,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:50,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969011852] [2019-12-07 18:28:50,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:50,429 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 18:28:50,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969011852] [2019-12-07 18:28:50,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:50,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:50,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880348731] [2019-12-07 18:28:50,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:50,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:50,431 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-12-07 18:28:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:50,683 INFO L93 Difference]: Finished difference Result 497 states and 768 transitions. [2019-12-07 18:28:50,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:50,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 18:28:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:50,684 INFO L225 Difference]: With dead ends: 497 [2019-12-07 18:28:50,684 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 18:28:50,685 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 18:28:50,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 18:28:50,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-12-07 18:28:50,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:50,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-12-07 18:28:50,690 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-12-07 18:28:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:50,690 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-12-07 18:28:50,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-12-07 18:28:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:28:50,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:50,691 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] [2019-12-07 18:28:50,691 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-12-07 18:28:50,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:50,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244817550] [2019-12-07 18:28:50,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:50,730 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 18:28:50,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244817550] [2019-12-07 18:28:50,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:50,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:50,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862696569] [2019-12-07 18:28:50,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:50,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:50,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:50,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:50,731 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-12-07 18:28:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:51,007 INFO L93 Difference]: Finished difference Result 498 states and 768 transitions. [2019-12-07 18:28:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:51,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 18:28:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:51,009 INFO L225 Difference]: With dead ends: 498 [2019-12-07 18:28:51,009 INFO L226 Difference]: Without dead ends: 283 [2019-12-07 18:28:51,010 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 18:28:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2019-12-07 18:28:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 234. [2019-12-07 18:28:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-12-07 18:28:51,013 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-12-07 18:28:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:51,013 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-12-07 18:28:51,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-12-07 18:28:51,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-07 18:28:51,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:51,014 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] [2019-12-07 18:28:51,014 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:51,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-12-07 18:28:51,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:51,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135086112] [2019-12-07 18:28:51,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:51,047 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 18:28:51,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135086112] [2019-12-07 18:28:51,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:51,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:51,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243795366] [2019-12-07 18:28:51,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:51,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:51,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:51,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:51,049 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-12-07 18:28:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:51,308 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-12-07 18:28:51,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:51,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-12-07 18:28:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:51,310 INFO L225 Difference]: With dead ends: 475 [2019-12-07 18:28:51,310 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 18:28:51,311 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 18:28:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 18:28:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-12-07 18:28:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-12-07 18:28:51,315 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-12-07 18:28:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:51,315 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-12-07 18:28:51,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-12-07 18:28:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:51,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:51,316 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] [2019-12-07 18:28:51,316 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-12-07 18:28:51,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:51,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172447678] [2019-12-07 18:28:51,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:51,351 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 18:28:51,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172447678] [2019-12-07 18:28:51,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:51,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:51,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360101491] [2019-12-07 18:28:51,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:51,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:51,352 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-12-07 18:28:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:51,622 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-12-07 18:28:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:51,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 18:28:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:51,624 INFO L225 Difference]: With dead ends: 497 [2019-12-07 18:28:51,624 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 18:28:51,624 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 18:28:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 18:28:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-12-07 18:28:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-12-07 18:28:51,628 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-12-07 18:28:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:51,628 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-12-07 18:28:51,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-12-07 18:28:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:51,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:51,629 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] [2019-12-07 18:28:51,629 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:51,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-12-07 18:28:51,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:51,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431116818] [2019-12-07 18:28:51,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:51,659 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 18:28:51,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431116818] [2019-12-07 18:28:51,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:51,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:51,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897916992] [2019-12-07 18:28:51,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:51,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:51,660 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-12-07 18:28:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:51,929 INFO L93 Difference]: Finished difference Result 495 states and 759 transitions. [2019-12-07 18:28:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:51,929 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 18:28:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:51,930 INFO L225 Difference]: With dead ends: 495 [2019-12-07 18:28:51,930 INFO L226 Difference]: Without dead ends: 280 [2019-12-07 18:28:51,931 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 18:28:51,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-07 18:28:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2019-12-07 18:28:51,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-12-07 18:28:51,934 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-12-07 18:28:51,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:51,934 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-12-07 18:28:51,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:51,935 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-12-07 18:28:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:51,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:51,935 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] [2019-12-07 18:28:51,935 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:51,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:51,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-12-07 18:28:51,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:51,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402952291] [2019-12-07 18:28:51,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:51,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:51,967 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 18:28:51,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402952291] [2019-12-07 18:28:51,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:51,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:51,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929170229] [2019-12-07 18:28:51,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:51,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:51,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:51,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:51,968 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-12-07 18:28:52,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:52,224 INFO L93 Difference]: Finished difference Result 494 states and 756 transitions. [2019-12-07 18:28:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:52,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 18:28:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:52,225 INFO L225 Difference]: With dead ends: 494 [2019-12-07 18:28:52,225 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 18:28:52,225 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 18:28:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 18:28:52,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 234. [2019-12-07 18:28:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-12-07 18:28:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-12-07 18:28:52,229 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-12-07 18:28:52,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:52,229 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-12-07 18:28:52,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:52,229 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-12-07 18:28:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:52,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:52,230 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] [2019-12-07 18:28:52,230 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-12-07 18:28:52,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:52,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537301403] [2019-12-07 18:28:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:52,269 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 18:28:52,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537301403] [2019-12-07 18:28:52,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:52,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:28:52,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514462454] [2019-12-07 18:28:52,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:28:52,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:52,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:28:52,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:28:52,270 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-12-07 18:28:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:52,624 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-12-07 18:28:52,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:28:52,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-12-07 18:28:52,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:52,626 INFO L225 Difference]: With dead ends: 470 [2019-12-07 18:28:52,626 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 18:28:52,626 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 18:28:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 18:28:52,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-12-07 18:28:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:52,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-12-07 18:28:52,632 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-12-07 18:28:52,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:52,632 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-12-07 18:28:52,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:28:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-12-07 18:28:52,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:52,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:52,633 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] [2019-12-07 18:28:52,633 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:52,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:52,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-12-07 18:28:52,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:52,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859205515] [2019-12-07 18:28:52,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:52,672 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 18:28:52,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859205515] [2019-12-07 18:28:52,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:52,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:52,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420159641] [2019-12-07 18:28:52,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:52,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:52,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:52,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:52,673 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-12-07 18:28:52,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:52,899 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-12-07 18:28:52,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:52,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 18:28:52,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:52,901 INFO L225 Difference]: With dead ends: 512 [2019-12-07 18:28:52,901 INFO L226 Difference]: Without dead ends: 277 [2019-12-07 18:28:52,901 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 18:28:52,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-12-07 18:28:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-12-07 18:28:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-12-07 18:28:52,907 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-12-07 18:28:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:52,907 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-12-07 18:28:52,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-12-07 18:28:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 18:28:52,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:52,908 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] [2019-12-07 18:28:52,908 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:52,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:52,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-12-07 18:28:52,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:52,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194318018] [2019-12-07 18:28:52,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:52,945 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 18:28:52,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194318018] [2019-12-07 18:28:52,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:52,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:52,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613113264] [2019-12-07 18:28:52,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:52,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:52,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:52,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:52,947 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-12-07 18:28:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:53,163 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-12-07 18:28:53,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:53,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-12-07 18:28:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:53,164 INFO L225 Difference]: With dead ends: 511 [2019-12-07 18:28:53,164 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 18:28:53,165 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 18:28:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 18:28:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 18:28:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-12-07 18:28:53,169 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-12-07 18:28:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:53,178 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-12-07 18:28:53,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:53,178 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-12-07 18:28:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 18:28:53,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:53,179 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] [2019-12-07 18:28:53,179 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:53,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:53,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-12-07 18:28:53,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:53,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470649216] [2019-12-07 18:28:53,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:53,219 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 18:28:53,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470649216] [2019-12-07 18:28:53,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:53,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:53,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859847717] [2019-12-07 18:28:53,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:53,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:53,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:53,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:53,220 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-12-07 18:28:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:53,474 INFO L93 Difference]: Finished difference Result 534 states and 801 transitions. [2019-12-07 18:28:53,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:53,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 18:28:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:53,475 INFO L225 Difference]: With dead ends: 534 [2019-12-07 18:28:53,475 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:28:53,476 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 18:28:53,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:28:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 18:28:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:53,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-12-07 18:28:53,480 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-12-07 18:28:53,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:53,480 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-12-07 18:28:53,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:53,480 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-12-07 18:28:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 18:28:53,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:53,481 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] [2019-12-07 18:28:53,481 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:53,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:53,481 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-12-07 18:28:53,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:53,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733819296] [2019-12-07 18:28:53,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:53,510 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 18:28:53,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733819296] [2019-12-07 18:28:53,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:53,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:53,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302523334] [2019-12-07 18:28:53,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:53,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:53,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:53,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:53,511 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-12-07 18:28:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:53,716 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-12-07 18:28:53,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:53,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-12-07 18:28:53,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:53,717 INFO L225 Difference]: With dead ends: 511 [2019-12-07 18:28:53,717 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 18:28:53,717 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 18:28:53,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 18:28:53,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 18:28:53,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-12-07 18:28:53,721 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-12-07 18:28:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:53,721 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-12-07 18:28:53,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-12-07 18:28:53,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 18:28:53,722 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:53,722 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] [2019-12-07 18:28:53,722 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:53,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:53,723 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-12-07 18:28:53,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:53,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258493508] [2019-12-07 18:28:53,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:53,755 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 18:28:53,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258493508] [2019-12-07 18:28:53,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:53,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:53,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270008116] [2019-12-07 18:28:53,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:53,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:53,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:53,756 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-12-07 18:28:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:53,997 INFO L93 Difference]: Finished difference Result 534 states and 797 transitions. [2019-12-07 18:28:53,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:53,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 18:28:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:53,999 INFO L225 Difference]: With dead ends: 534 [2019-12-07 18:28:53,999 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:28:53,999 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 18:28:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:28:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 18:28:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-12-07 18:28:54,004 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-12-07 18:28:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:54,004 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-12-07 18:28:54,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-12-07 18:28:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 18:28:54,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:54,005 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] [2019-12-07 18:28:54,005 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:54,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-12-07 18:28:54,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:54,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080802989] [2019-12-07 18:28:54,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:54,039 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 18:28:54,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080802989] [2019-12-07 18:28:54,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:54,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:54,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184903216] [2019-12-07 18:28:54,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:54,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:54,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:54,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:54,040 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-12-07 18:28:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:54,252 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-12-07 18:28:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:54,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-12-07 18:28:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:54,254 INFO L225 Difference]: With dead ends: 511 [2019-12-07 18:28:54,254 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 18:28:54,254 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 18:28:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 18:28:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 18:28:54,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-12-07 18:28:54,259 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-12-07 18:28:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:54,259 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-12-07 18:28:54,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-12-07 18:28:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:28:54,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:54,260 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] [2019-12-07 18:28:54,260 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-12-07 18:28:54,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:54,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677196573] [2019-12-07 18:28:54,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:54,291 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 18:28:54,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677196573] [2019-12-07 18:28:54,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:54,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:54,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237319743] [2019-12-07 18:28:54,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:54,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:54,292 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-12-07 18:28:54,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:54,559 INFO L93 Difference]: Finished difference Result 534 states and 793 transitions. [2019-12-07 18:28:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:54,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 18:28:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:54,561 INFO L225 Difference]: With dead ends: 534 [2019-12-07 18:28:54,561 INFO L226 Difference]: Without dead ends: 299 [2019-12-07 18:28:54,561 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 18:28:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-12-07 18:28:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 254. [2019-12-07 18:28:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-12-07 18:28:54,565 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-12-07 18:28:54,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:54,565 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-12-07 18:28:54,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-12-07 18:28:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 18:28:54,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:54,566 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] [2019-12-07 18:28:54,566 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-12-07 18:28:54,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:54,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925207328] [2019-12-07 18:28:54,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:54,596 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 18:28:54,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925207328] [2019-12-07 18:28:54,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:54,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:54,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868535015] [2019-12-07 18:28:54,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:54,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:54,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:54,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:54,597 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-12-07 18:28:54,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:54,811 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-12-07 18:28:54,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:54,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-12-07 18:28:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:54,812 INFO L225 Difference]: With dead ends: 511 [2019-12-07 18:28:54,812 INFO L226 Difference]: Without dead ends: 276 [2019-12-07 18:28:54,813 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 18:28:54,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-12-07 18:28:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-12-07 18:28:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-12-07 18:28:54,817 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-12-07 18:28:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:54,817 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-12-07 18:28:54,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:54,817 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-12-07 18:28:54,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 18:28:54,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:54,818 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] [2019-12-07 18:28:54,818 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:54,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:54,818 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-12-07 18:28:54,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:54,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721060187] [2019-12-07 18:28:54,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:54,854 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 18:28:54,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721060187] [2019-12-07 18:28:54,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:54,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:54,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512824720] [2019-12-07 18:28:54,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:54,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:54,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:54,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:54,855 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-12-07 18:28:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,140 INFO L93 Difference]: Finished difference Result 524 states and 777 transitions. [2019-12-07 18:28:55,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:55,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 18:28:55,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,141 INFO L225 Difference]: With dead ends: 524 [2019-12-07 18:28:55,141 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:28:55,142 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 18:28:55,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:28:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-12-07 18:28:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-12-07 18:28:55,148 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-12-07 18:28:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:55,148 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-12-07 18:28:55,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-12-07 18:28:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 18:28:55,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:55,149 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] [2019-12-07 18:28:55,149 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:55,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-12-07 18:28:55,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:55,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855460911] [2019-12-07 18:28:55,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:55,187 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 18:28:55,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855460911] [2019-12-07 18:28:55,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:55,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:55,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256766555] [2019-12-07 18:28:55,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:55,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:55,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:55,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:55,188 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-12-07 18:28:55,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,389 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-12-07 18:28:55,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:55,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-07 18:28:55,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,390 INFO L225 Difference]: With dead ends: 501 [2019-12-07 18:28:55,390 INFO L226 Difference]: Without dead ends: 266 [2019-12-07 18:28:55,391 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 18:28:55,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-12-07 18:28:55,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-12-07 18:28:55,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-12-07 18:28:55,394 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-12-07 18:28:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:55,395 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-12-07 18:28:55,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:55,395 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-12-07 18:28:55,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 18:28:55,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:55,395 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] [2019-12-07 18:28:55,395 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:55,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:55,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-12-07 18:28:55,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:55,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370013625] [2019-12-07 18:28:55,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:55,426 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 18:28:55,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370013625] [2019-12-07 18:28:55,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:55,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:28:55,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124566525] [2019-12-07 18:28:55,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:28:55,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:55,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:28:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:28:55,427 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-12-07 18:28:55,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,718 INFO L93 Difference]: Finished difference Result 524 states and 773 transitions. [2019-12-07 18:28:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:28:55,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 18:28:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,720 INFO L225 Difference]: With dead ends: 524 [2019-12-07 18:28:55,720 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 18:28:55,720 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 18:28:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 18:28:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 254. [2019-12-07 18:28:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 18:28:55,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-12-07 18:28:55,724 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-12-07 18:28:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:55,725 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-12-07 18:28:55,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:28:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-12-07 18:28:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 18:28:55,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:55,725 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] [2019-12-07 18:28:55,725 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:55,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-12-07 18:28:55,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:55,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464675961] [2019-12-07 18:28:55,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:55,758 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 18:28:55,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464675961] [2019-12-07 18:28:55,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:55,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:28:55,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237427870] [2019-12-07 18:28:55,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:55,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:55,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:55,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:55,759 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-12-07 18:28:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,794 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-12-07 18:28:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:55,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-12-07 18:28:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,796 INFO L225 Difference]: With dead ends: 722 [2019-12-07 18:28:55,796 INFO L226 Difference]: Without dead ends: 487 [2019-12-07 18:28:55,796 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 18:28:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-07 18:28:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-12-07 18:28:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-12-07 18:28:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-12-07 18:28:55,804 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-12-07 18:28:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:55,804 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-12-07 18:28:55,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:55,804 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-12-07 18:28:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 18:28:55,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:55,805 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] [2019-12-07 18:28:55,805 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:55,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:55,805 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-12-07 18:28:55,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:55,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725940431] [2019-12-07 18:28:55,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:55,833 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 18:28:55,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725940431] [2019-12-07 18:28:55,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:55,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:28:55,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565277136] [2019-12-07 18:28:55,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:55,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:55,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:55,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:55,834 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-12-07 18:28:55,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,870 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-12-07 18:28:55,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:55,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 18:28:55,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,873 INFO L225 Difference]: With dead ends: 1190 [2019-12-07 18:28:55,873 INFO L226 Difference]: Without dead ends: 722 [2019-12-07 18:28:55,873 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 18:28:55,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-12-07 18:28:55,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-12-07 18:28:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 18:28:55,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-12-07 18:28:55,884 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-12-07 18:28:55,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:55,884 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-12-07 18:28:55,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:55,885 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-12-07 18:28:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 18:28:55,885 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:55,885 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 18:28:55,885 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:55,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:55,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-12-07 18:28:55,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:55,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967084730] [2019-12-07 18:28:55,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:55,915 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 18:28:55,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967084730] [2019-12-07 18:28:55,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:55,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:28:55,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434858289] [2019-12-07 18:28:55,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:55,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:55,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:55,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:55,916 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-12-07 18:28:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:55,976 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-12-07 18:28:55,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:55,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-12-07 18:28:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:55,981 INFO L225 Difference]: With dead ends: 1656 [2019-12-07 18:28:55,981 INFO L226 Difference]: Without dead ends: 955 [2019-12-07 18:28:55,982 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 18:28:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-12-07 18:28:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-12-07 18:28:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-12-07 18:28:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-12-07 18:28:56,002 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-12-07 18:28:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:56,002 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-12-07 18:28:56,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-12-07 18:28:56,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 18:28:56,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:56,004 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:28:56,004 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:56,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2010094734, now seen corresponding path program 1 times [2019-12-07 18:28:56,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:56,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677733974] [2019-12-07 18:28:56,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:56,044 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:28:56,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677733974] [2019-12-07 18:28:56,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:56,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:28:56,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149322217] [2019-12-07 18:28:56,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:56,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:56,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:56,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:56,046 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-12-07 18:28:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:56,090 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-12-07 18:28:56,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:56,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 18:28:56,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:56,094 INFO L225 Difference]: With dead ends: 2120 [2019-12-07 18:28:56,094 INFO L226 Difference]: Without dead ends: 1186 [2019-12-07 18:28:56,095 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 18:28:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-12-07 18:28:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-12-07 18:28:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-12-07 18:28:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-12-07 18:28:56,113 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-12-07 18:28:56,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:56,113 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-12-07 18:28:56,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:56,113 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-12-07 18:28:56,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 18:28:56,114 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:56,114 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] [2019-12-07 18:28:56,114 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:56,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:56,114 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-12-07 18:28:56,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:56,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220726038] [2019-12-07 18:28:56,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:56,148 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 18:28:56,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220726038] [2019-12-07 18:28:56,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:28:56,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:28:56,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956750412] [2019-12-07 18:28:56,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:28:56,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:28:56,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:28:56,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:28:56,150 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-12-07 18:28:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:28:56,189 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-12-07 18:28:56,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:28:56,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-12-07 18:28:56,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:28:56,197 INFO L225 Difference]: With dead ends: 1423 [2019-12-07 18:28:56,197 INFO L226 Difference]: Without dead ends: 1421 [2019-12-07 18:28:56,197 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 18:28:56,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-12-07 18:28:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-12-07 18:28:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-07 18:28:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-12-07 18:28:56,228 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-12-07 18:28:56,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:28:56,228 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-12-07 18:28:56,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:28:56,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-12-07 18:28:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:28:56,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:28:56,231 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] [2019-12-07 18:28:56,231 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:28:56,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:28:56,231 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-12-07 18:28:56,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:28:56,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356048238] [2019-12-07 18:28:56,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:28:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:56,494 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:28:56,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356048238] [2019-12-07 18:28:56,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452865971] [2019-12-07 18:28:56,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:28:56,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:28:56,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:28:56,619 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:28:56,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,685 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 18:28:56,685 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,714 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 18:28:56,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,722 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,724 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,749 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 18:28:56,749 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:56,785 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 18:28:56,786 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,800 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,828 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 18:28:56,828 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 18:28:56,828 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,838 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,839 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 18:28:56,839 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 18:28:56,873 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 18:28:56,874 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 18:28:56,874 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,879 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,880 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,880 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 18:28:56,908 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 18:28:56,908 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 18:28:56,908 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,914 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,914 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,914 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 18:28:56,918 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 18:28:56,921 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 18:28:56,932 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,968 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 18:28:56,968 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 18:28:56,969 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:56,976 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:28:56,976 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 18:28:57,001 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 18:28:57,002 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 18:28:57,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:57,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:57,008 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:28:57,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 18:28:57,029 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 18:28:57,029 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 18:28:57,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:57,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:57,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:28:57,035 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 18:28:57,041 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 18:28:57,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:57,044 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 49 treesize of output 37 [2019-12-07 18:28:57,044 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:28:57,053 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:57,168 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 18:28:57,169 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 18:28:57,169 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 90 treesize of output 218 [2019-12-07 18:28:57,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:57,569 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-12-07 18:28:58,738 WARN L192 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 18:28:58,739 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 18:28:58,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:28:58,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:58,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:58,748 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-12-07 18:28:58,748 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 18:28:58,957 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 18:28:58,962 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 18:28:58,964 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 18:28:58,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:59,101 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 18:28:59,102 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 18:28:59,102 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 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 18:28:59,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,104 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:59,133 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 18:28:59,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:28:59,133 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 18:28:59,153 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 18:28:59,157 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 18:28:59,157 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:59,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:59,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,289 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 18:28:59,289 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 18:28:59,290 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 99 treesize of output 207 [2019-12-07 18:28:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:28:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,294 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:59,433 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 18:28:59,433 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 18:28:59,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:28:59,434 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 18:28:59,455 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 18:28:59,457 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 18:28:59,458 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 18:28:59,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:59,473 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 28 [2019-12-07 18:28:59,473 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:28:59,483 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:59,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:28:59,517 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:28:59,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 18:28:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:28:59,574 INFO L534 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-12-07 18:29:02,126 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 18:29:02,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:02,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:29:02,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 18:29:02,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:29:02,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:29:02,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 18:29:02,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:29:02,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:29:02,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:29:02,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:29:02,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 18:29:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 18:29:02,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:29:02,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 18:29:02,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:29:02,165 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:02,165 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 18:29:02,936 WARN L192 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 18:29:02,956 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:29:02,956 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 18:29:02,956 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:02,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:02,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:02,963 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 18:29:02,998 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 18:29:02,998 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 18:29:02,998 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:03,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:03,002 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 18:29:03,002 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 18:29:03,206 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:29:03,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:29:03,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 18:29:03,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909391158] [2019-12-07 18:29:03,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:29:03,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:03,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:29:03,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:29:03,208 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 13 states. [2019-12-07 18:29:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:06,431 INFO L93 Difference]: Finished difference Result 6881 states and 10226 transitions. [2019-12-07 18:29:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 18:29:06,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-12-07 18:29:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:06,451 INFO L225 Difference]: With dead ends: 6881 [2019-12-07 18:29:06,451 INFO L226 Difference]: Without dead ends: 5481 [2019-12-07 18:29:06,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 164 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:29:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2019-12-07 18:29:06,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3081. [2019-12-07 18:29:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-12-07 18:29:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4683 transitions. [2019-12-07 18:29:06,529 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4683 transitions. Word has length 164 [2019-12-07 18:29:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:06,529 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 4683 transitions. [2019-12-07 18:29:06,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:29:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4683 transitions. [2019-12-07 18:29:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 18:29:06,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:06,534 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, 1, 1, 1, 1] [2019-12-07 18:29:06,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:29:06,734 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:06,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-12-07 18:29:06,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:06,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245959781] [2019-12-07 18:29:06,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:06,789 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 18:29:06,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245959781] [2019-12-07 18:29:06,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:06,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:06,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673940070] [2019-12-07 18:29:06,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:06,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:06,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:06,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:06,790 INFO L87 Difference]: Start difference. First operand 3081 states and 4683 transitions. Second operand 4 states. [2019-12-07 18:29:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:07,109 INFO L93 Difference]: Finished difference Result 6839 states and 10430 transitions. [2019-12-07 18:29:07,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:07,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-12-07 18:29:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:07,123 INFO L225 Difference]: With dead ends: 6839 [2019-12-07 18:29:07,123 INFO L226 Difference]: Without dead ends: 3777 [2019-12-07 18:29:07,125 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 18:29:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3777 states. [2019-12-07 18:29:07,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3777 to 3417. [2019-12-07 18:29:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3417 states. [2019-12-07 18:29:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3417 states to 3417 states and 5271 transitions. [2019-12-07 18:29:07,187 INFO L78 Accepts]: Start accepts. Automaton has 3417 states and 5271 transitions. Word has length 170 [2019-12-07 18:29:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 3417 states and 5271 transitions. [2019-12-07 18:29:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3417 states and 5271 transitions. [2019-12-07 18:29:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 18:29:07,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:07,190 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 18:29:07,191 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:07,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2019-12-07 18:29:07,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:07,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404299741] [2019-12-07 18:29:07,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:29:07,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404299741] [2019-12-07 18:29:07,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:07,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:07,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800593498] [2019-12-07 18:29:07,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:07,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:07,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:07,252 INFO L87 Difference]: Start difference. First operand 3417 states and 5271 transitions. Second operand 4 states. [2019-12-07 18:29:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:07,633 INFO L93 Difference]: Finished difference Result 7957 states and 12273 transitions. [2019-12-07 18:29:07,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:07,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-12-07 18:29:07,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:07,647 INFO L225 Difference]: With dead ends: 7957 [2019-12-07 18:29:07,647 INFO L226 Difference]: Without dead ends: 4559 [2019-12-07 18:29:07,650 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 18:29:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4559 states. [2019-12-07 18:29:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4559 to 3885. [2019-12-07 18:29:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-12-07 18:29:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 6123 transitions. [2019-12-07 18:29:07,719 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 6123 transitions. Word has length 178 [2019-12-07 18:29:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:07,719 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 6123 transitions. [2019-12-07 18:29:07,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:07,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 6123 transitions. [2019-12-07 18:29:07,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 18:29:07,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:07,723 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:07,723 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2019-12-07 18:29:07,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:07,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002806498] [2019-12-07 18:29:07,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:29:07,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002806498] [2019-12-07 18:29:07,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:07,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:07,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414997063] [2019-12-07 18:29:07,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:07,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:07,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:07,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:07,782 INFO L87 Difference]: Start difference. First operand 3885 states and 6123 transitions. Second operand 4 states. [2019-12-07 18:29:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:08,147 INFO L93 Difference]: Finished difference Result 8375 states and 13050 transitions. [2019-12-07 18:29:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:08,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-12-07 18:29:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:08,153 INFO L225 Difference]: With dead ends: 8375 [2019-12-07 18:29:08,154 INFO L226 Difference]: Without dead ends: 4509 [2019-12-07 18:29:08,156 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 18:29:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2019-12-07 18:29:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 3765. [2019-12-07 18:29:08,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3765 states. [2019-12-07 18:29:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5895 transitions. [2019-12-07 18:29:08,214 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5895 transitions. Word has length 179 [2019-12-07 18:29:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:08,214 INFO L462 AbstractCegarLoop]: Abstraction has 3765 states and 5895 transitions. [2019-12-07 18:29:08,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5895 transitions. [2019-12-07 18:29:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 18:29:08,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:08,218 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:08,218 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:08,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash 289713635, now seen corresponding path program 1 times [2019-12-07 18:29:08,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:08,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332416269] [2019-12-07 18:29:08,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:08,326 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 18:29:08,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332416269] [2019-12-07 18:29:08,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:08,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:29:08,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577523366] [2019-12-07 18:29:08,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:29:08,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:08,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:29:08,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:29:08,327 INFO L87 Difference]: Start difference. First operand 3765 states and 5895 transitions. Second operand 5 states. [2019-12-07 18:29:08,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:08,702 INFO L93 Difference]: Finished difference Result 9025 states and 14137 transitions. [2019-12-07 18:29:08,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:08,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-12-07 18:29:08,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:08,708 INFO L225 Difference]: With dead ends: 9025 [2019-12-07 18:29:08,709 INFO L226 Difference]: Without dead ends: 5279 [2019-12-07 18:29:08,711 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 18:29:08,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2019-12-07 18:29:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 4239. [2019-12-07 18:29:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4239 states. [2019-12-07 18:29:08,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4239 states to 4239 states and 6753 transitions. [2019-12-07 18:29:08,779 INFO L78 Accepts]: Start accepts. Automaton has 4239 states and 6753 transitions. Word has length 179 [2019-12-07 18:29:08,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:08,780 INFO L462 AbstractCegarLoop]: Abstraction has 4239 states and 6753 transitions. [2019-12-07 18:29:08,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:29:08,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4239 states and 6753 transitions. [2019-12-07 18:29:08,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 18:29:08,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:08,784 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:08,784 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:08,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:08,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1455825383, now seen corresponding path program 2 times [2019-12-07 18:29:08,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:08,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589379579] [2019-12-07 18:29:08,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:29:08,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589379579] [2019-12-07 18:29:08,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:08,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:08,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135569398] [2019-12-07 18:29:08,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:08,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:08,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:08,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:08,830 INFO L87 Difference]: Start difference. First operand 4239 states and 6753 transitions. Second operand 4 states. [2019-12-07 18:29:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:09,222 INFO L93 Difference]: Finished difference Result 7555 states and 11938 transitions. [2019-12-07 18:29:09,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:09,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-12-07 18:29:09,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:09,236 INFO L225 Difference]: With dead ends: 7555 [2019-12-07 18:29:09,236 INFO L226 Difference]: Without dead ends: 5381 [2019-12-07 18:29:09,239 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 18:29:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-12-07 18:29:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4383. [2019-12-07 18:29:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4383 states. [2019-12-07 18:29:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4383 states to 4383 states and 6957 transitions. [2019-12-07 18:29:09,314 INFO L78 Accepts]: Start accepts. Automaton has 4383 states and 6957 transitions. Word has length 179 [2019-12-07 18:29:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:09,315 INFO L462 AbstractCegarLoop]: Abstraction has 4383 states and 6957 transitions. [2019-12-07 18:29:09,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4383 states and 6957 transitions. [2019-12-07 18:29:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 18:29:09,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:09,319 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:09,319 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:09,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1317975036, now seen corresponding path program 1 times [2019-12-07 18:29:09,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:09,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022035527] [2019-12-07 18:29:09,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:09,365 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:29:09,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022035527] [2019-12-07 18:29:09,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:09,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:09,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222024115] [2019-12-07 18:29:09,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:09,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:09,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:09,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:09,366 INFO L87 Difference]: Start difference. First operand 4383 states and 6957 transitions. Second operand 4 states. [2019-12-07 18:29:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:09,774 INFO L93 Difference]: Finished difference Result 7627 states and 12028 transitions. [2019-12-07 18:29:09,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:09,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2019-12-07 18:29:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:09,794 INFO L225 Difference]: With dead ends: 7627 [2019-12-07 18:29:09,794 INFO L226 Difference]: Without dead ends: 5381 [2019-12-07 18:29:09,796 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 18:29:09,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5381 states. [2019-12-07 18:29:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5381 to 4395. [2019-12-07 18:29:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4395 states. [2019-12-07 18:29:09,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4395 states to 4395 states and 6969 transitions. [2019-12-07 18:29:09,869 INFO L78 Accepts]: Start accepts. Automaton has 4395 states and 6969 transitions. Word has length 180 [2019-12-07 18:29:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:09,870 INFO L462 AbstractCegarLoop]: Abstraction has 4395 states and 6969 transitions. [2019-12-07 18:29:09,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:09,870 INFO L276 IsEmpty]: Start isEmpty. Operand 4395 states and 6969 transitions. [2019-12-07 18:29:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-12-07 18:29:09,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:09,874 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:09,874 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:09,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 384150911, now seen corresponding path program 1 times [2019-12-07 18:29:09,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:09,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223851233] [2019-12-07 18:29:09,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 18:29:09,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223851233] [2019-12-07 18:29:09,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:09,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:29:09,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058816895] [2019-12-07 18:29:09,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:29:09,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:09,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:29:09,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:29:09,949 INFO L87 Difference]: Start difference. First operand 4395 states and 6969 transitions. Second operand 5 states. [2019-12-07 18:29:10,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:10,355 INFO L93 Difference]: Finished difference Result 9949 states and 15739 transitions. [2019-12-07 18:29:10,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:10,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-12-07 18:29:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:10,360 INFO L225 Difference]: With dead ends: 9949 [2019-12-07 18:29:10,360 INFO L226 Difference]: Without dead ends: 5573 [2019-12-07 18:29:10,363 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 18:29:10,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5573 states. [2019-12-07 18:29:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5573 to 4263. [2019-12-07 18:29:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4263 states. [2019-12-07 18:29:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4263 states to 4263 states and 6789 transitions. [2019-12-07 18:29:10,434 INFO L78 Accepts]: Start accepts. Automaton has 4263 states and 6789 transitions. Word has length 180 [2019-12-07 18:29:10,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:10,435 INFO L462 AbstractCegarLoop]: Abstraction has 4263 states and 6789 transitions. [2019-12-07 18:29:10,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:29:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4263 states and 6789 transitions. [2019-12-07 18:29:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-12-07 18:29:10,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:10,439 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:10,439 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:10,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:10,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1028551806, now seen corresponding path program 1 times [2019-12-07 18:29:10,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:10,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766526367] [2019-12-07 18:29:10,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:29:10,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766526367] [2019-12-07 18:29:10,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:10,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:10,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694647454] [2019-12-07 18:29:10,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:10,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:10,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:10,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:10,484 INFO L87 Difference]: Start difference. First operand 4263 states and 6789 transitions. Second operand 4 states. [2019-12-07 18:29:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:10,891 INFO L93 Difference]: Finished difference Result 7385 states and 11677 transitions. [2019-12-07 18:29:10,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:10,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 181 [2019-12-07 18:29:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:10,895 INFO L225 Difference]: With dead ends: 7385 [2019-12-07 18:29:10,895 INFO L226 Difference]: Without dead ends: 5199 [2019-12-07 18:29:10,897 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 18:29:10,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2019-12-07 18:29:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 4275. [2019-12-07 18:29:10,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4275 states. [2019-12-07 18:29:10,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4275 states to 4275 states and 6801 transitions. [2019-12-07 18:29:10,966 INFO L78 Accepts]: Start accepts. Automaton has 4275 states and 6801 transitions. Word has length 181 [2019-12-07 18:29:10,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:10,966 INFO L462 AbstractCegarLoop]: Abstraction has 4275 states and 6801 transitions. [2019-12-07 18:29:10,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4275 states and 6801 transitions. [2019-12-07 18:29:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 18:29:10,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:10,970 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:10,970 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1170394039, now seen corresponding path program 1 times [2019-12-07 18:29:10,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:10,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451402881] [2019-12-07 18:29:10,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:29:11,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451402881] [2019-12-07 18:29:11,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:11,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:11,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880899695] [2019-12-07 18:29:11,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:11,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:11,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:11,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:11,016 INFO L87 Difference]: Start difference. First operand 4275 states and 6801 transitions. Second operand 4 states. [2019-12-07 18:29:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:11,440 INFO L93 Difference]: Finished difference Result 7331 states and 11599 transitions. [2019-12-07 18:29:11,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:11,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-12-07 18:29:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:11,443 INFO L225 Difference]: With dead ends: 7331 [2019-12-07 18:29:11,443 INFO L226 Difference]: Without dead ends: 5139 [2019-12-07 18:29:11,445 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 18:29:11,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-12-07 18:29:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4287. [2019-12-07 18:29:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6813 transitions. [2019-12-07 18:29:11,514 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6813 transitions. Word has length 182 [2019-12-07 18:29:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:11,514 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6813 transitions. [2019-12-07 18:29:11,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6813 transitions. [2019-12-07 18:29:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 18:29:11,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:11,518 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:11,518 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:11,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:11,518 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-12-07 18:29:11,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:11,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664992486] [2019-12-07 18:29:11,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:11,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:11,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664992486] [2019-12-07 18:29:11,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:11,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:11,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967255336] [2019-12-07 18:29:11,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:11,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:11,567 INFO L87 Difference]: Start difference. First operand 4287 states and 6813 transitions. Second operand 4 states. [2019-12-07 18:29:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:11,907 INFO L93 Difference]: Finished difference Result 8903 states and 14078 transitions. [2019-12-07 18:29:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:11,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 184 [2019-12-07 18:29:11,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:11,911 INFO L225 Difference]: With dead ends: 8903 [2019-12-07 18:29:11,911 INFO L226 Difference]: Without dead ends: 4635 [2019-12-07 18:29:11,914 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 18:29:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-12-07 18:29:11,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-12-07 18:29:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6801 transitions. [2019-12-07 18:29:11,982 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6801 transitions. Word has length 184 [2019-12-07 18:29:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:11,982 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6801 transitions. [2019-12-07 18:29:11,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6801 transitions. [2019-12-07 18:29:11,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 18:29:11,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:11,986 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:11,987 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:11,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:11,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1263023272, now seen corresponding path program 1 times [2019-12-07 18:29:11,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:11,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956480323] [2019-12-07 18:29:11,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:12,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:12,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956480323] [2019-12-07 18:29:12,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:12,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:12,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497936701] [2019-12-07 18:29:12,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:12,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:12,034 INFO L87 Difference]: Start difference. First operand 4287 states and 6801 transitions. Second operand 4 states. [2019-12-07 18:29:12,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:12,359 INFO L93 Difference]: Finished difference Result 6833 states and 10743 transitions. [2019-12-07 18:29:12,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:12,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-12-07 18:29:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:12,363 INFO L225 Difference]: With dead ends: 6833 [2019-12-07 18:29:12,363 INFO L226 Difference]: Without dead ends: 4635 [2019-12-07 18:29:12,365 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 18:29:12,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-12-07 18:29:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-12-07 18:29:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6789 transitions. [2019-12-07 18:29:12,435 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6789 transitions. Word has length 185 [2019-12-07 18:29:12,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:12,435 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6789 transitions. [2019-12-07 18:29:12,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:12,435 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6789 transitions. [2019-12-07 18:29:12,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-12-07 18:29:12,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:12,439 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:12,439 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:12,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:12,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1547746275, now seen corresponding path program 1 times [2019-12-07 18:29:12,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:12,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961981970] [2019-12-07 18:29:12,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:12,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961981970] [2019-12-07 18:29:12,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:12,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:12,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987646785] [2019-12-07 18:29:12,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:12,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:12,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:12,501 INFO L87 Difference]: Start difference. First operand 4287 states and 6789 transitions. Second operand 4 states. [2019-12-07 18:29:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:12,850 INFO L93 Difference]: Finished difference Result 6833 states and 10725 transitions. [2019-12-07 18:29:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:12,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-12-07 18:29:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:12,853 INFO L225 Difference]: With dead ends: 6833 [2019-12-07 18:29:12,854 INFO L226 Difference]: Without dead ends: 4635 [2019-12-07 18:29:12,855 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 18:29:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-12-07 18:29:12,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-12-07 18:29:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6777 transitions. [2019-12-07 18:29:12,925 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6777 transitions. Word has length 186 [2019-12-07 18:29:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:12,925 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6777 transitions. [2019-12-07 18:29:12,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:12,925 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6777 transitions. [2019-12-07 18:29:12,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 18:29:12,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:12,929 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:12,929 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash -619567939, now seen corresponding path program 1 times [2019-12-07 18:29:12,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:12,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590169844] [2019-12-07 18:29:12,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:12,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590169844] [2019-12-07 18:29:12,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:12,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:12,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113101633] [2019-12-07 18:29:12,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:12,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:12,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:12,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:12,996 INFO L87 Difference]: Start difference. First operand 4287 states and 6777 transitions. Second operand 4 states. [2019-12-07 18:29:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:13,325 INFO L93 Difference]: Finished difference Result 6833 states and 10707 transitions. [2019-12-07 18:29:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:13,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-12-07 18:29:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:13,328 INFO L225 Difference]: With dead ends: 6833 [2019-12-07 18:29:13,328 INFO L226 Difference]: Without dead ends: 4635 [2019-12-07 18:29:13,330 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 18:29:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-12-07 18:29:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4287. [2019-12-07 18:29:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6765 transitions. [2019-12-07 18:29:13,403 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6765 transitions. Word has length 187 [2019-12-07 18:29:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:13,404 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6765 transitions. [2019-12-07 18:29:13,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6765 transitions. [2019-12-07 18:29:13,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 18:29:13,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:13,408 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:13,408 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:13,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:13,408 INFO L82 PathProgramCache]: Analyzing trace with hash -746153758, now seen corresponding path program 1 times [2019-12-07 18:29:13,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:13,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56279195] [2019-12-07 18:29:13,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:13,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56279195] [2019-12-07 18:29:13,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:13,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:13,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489477637] [2019-12-07 18:29:13,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:13,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:13,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:13,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:13,456 INFO L87 Difference]: Start difference. First operand 4287 states and 6765 transitions. Second operand 4 states. [2019-12-07 18:29:13,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:13,797 INFO L93 Difference]: Finished difference Result 6773 states and 10617 transitions. [2019-12-07 18:29:13,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:13,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-12-07 18:29:13,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:13,800 INFO L225 Difference]: With dead ends: 6773 [2019-12-07 18:29:13,800 INFO L226 Difference]: Without dead ends: 4575 [2019-12-07 18:29:13,802 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 18:29:13,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4575 states. [2019-12-07 18:29:13,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4575 to 4287. [2019-12-07 18:29:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4287 states. [2019-12-07 18:29:13,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4287 states to 4287 states and 6753 transitions. [2019-12-07 18:29:13,874 INFO L78 Accepts]: Start accepts. Automaton has 4287 states and 6753 transitions. Word has length 188 [2019-12-07 18:29:13,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:13,874 INFO L462 AbstractCegarLoop]: Abstraction has 4287 states and 6753 transitions. [2019-12-07 18:29:13,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:13,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4287 states and 6753 transitions. [2019-12-07 18:29:13,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:29:13,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:13,877 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:13,878 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:13,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:13,878 INFO L82 PathProgramCache]: Analyzing trace with hash 791063530, now seen corresponding path program 1 times [2019-12-07 18:29:13,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:13,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014230709] [2019-12-07 18:29:13,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:13,924 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 18:29:13,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014230709] [2019-12-07 18:29:13,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:13,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:13,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048057214] [2019-12-07 18:29:13,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:13,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:13,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:13,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:13,925 INFO L87 Difference]: Start difference. First operand 4287 states and 6753 transitions. Second operand 4 states. [2019-12-07 18:29:14,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:14,364 INFO L93 Difference]: Finished difference Result 9407 states and 14790 transitions. [2019-12-07 18:29:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:14,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 18:29:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:14,368 INFO L225 Difference]: With dead ends: 9407 [2019-12-07 18:29:14,368 INFO L226 Difference]: Without dead ends: 5139 [2019-12-07 18:29:14,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 18:29:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5139 states. [2019-12-07 18:29:14,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5139 to 4299. [2019-12-07 18:29:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-12-07 18:29:14,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6765 transitions. [2019-12-07 18:29:14,442 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6765 transitions. Word has length 192 [2019-12-07 18:29:14,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:14,442 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6765 transitions. [2019-12-07 18:29:14,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6765 transitions. [2019-12-07 18:29:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:29:14,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:14,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:14,445 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:14,445 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-12-07 18:29:14,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:14,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71882251] [2019-12-07 18:29:14,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:14,496 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:14,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71882251] [2019-12-07 18:29:14,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:14,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:14,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215644481] [2019-12-07 18:29:14,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:14,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:14,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:14,497 INFO L87 Difference]: Start difference. First operand 4299 states and 6765 transitions. Second operand 4 states. [2019-12-07 18:29:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:14,823 INFO L93 Difference]: Finished difference Result 8867 states and 13910 transitions. [2019-12-07 18:29:14,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:14,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 18:29:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:14,827 INFO L225 Difference]: With dead ends: 8867 [2019-12-07 18:29:14,828 INFO L226 Difference]: Without dead ends: 4587 [2019-12-07 18:29:14,830 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 18:29:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-12-07 18:29:14,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4299. [2019-12-07 18:29:14,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-12-07 18:29:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6753 transitions. [2019-12-07 18:29:14,905 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6753 transitions. Word has length 192 [2019-12-07 18:29:14,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:14,905 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6753 transitions. [2019-12-07 18:29:14,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6753 transitions. [2019-12-07 18:29:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:29:14,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:14,908 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 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 18:29:14,908 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash 147913884, now seen corresponding path program 1 times [2019-12-07 18:29:14,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:14,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319179339] [2019-12-07 18:29:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:14,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319179339] [2019-12-07 18:29:14,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:14,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:14,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049063903] [2019-12-07 18:29:14,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:14,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:14,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:14,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:14,959 INFO L87 Difference]: Start difference. First operand 4299 states and 6753 transitions. Second operand 4 states. [2019-12-07 18:29:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:15,281 INFO L93 Difference]: Finished difference Result 8867 states and 13886 transitions. [2019-12-07 18:29:15,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:15,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-12-07 18:29:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:15,285 INFO L225 Difference]: With dead ends: 8867 [2019-12-07 18:29:15,285 INFO L226 Difference]: Without dead ends: 4587 [2019-12-07 18:29:15,288 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 18:29:15,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4587 states. [2019-12-07 18:29:15,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4587 to 4299. [2019-12-07 18:29:15,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4299 states. [2019-12-07 18:29:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4299 states to 4299 states and 6741 transitions. [2019-12-07 18:29:15,363 INFO L78 Accepts]: Start accepts. Automaton has 4299 states and 6741 transitions. Word has length 192 [2019-12-07 18:29:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:15,363 INFO L462 AbstractCegarLoop]: Abstraction has 4299 states and 6741 transitions. [2019-12-07 18:29:15,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 4299 states and 6741 transitions. [2019-12-07 18:29:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:29:15,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:15,366 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:15,366 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:15,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:15,366 INFO L82 PathProgramCache]: Analyzing trace with hash 323502751, now seen corresponding path program 1 times [2019-12-07 18:29:15,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:15,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976053855] [2019-12-07 18:29:15,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-12-07 18:29:15,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976053855] [2019-12-07 18:29:15,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:15,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:15,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292362829] [2019-12-07 18:29:15,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:15,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:15,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:15,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:15,415 INFO L87 Difference]: Start difference. First operand 4299 states and 6741 transitions. Second operand 4 states. [2019-12-07 18:29:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:15,822 INFO L93 Difference]: Finished difference Result 9395 states and 14718 transitions. [2019-12-07 18:29:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:15,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-12-07 18:29:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:15,826 INFO L225 Difference]: With dead ends: 9395 [2019-12-07 18:29:15,826 INFO L226 Difference]: Without dead ends: 5115 [2019-12-07 18:29:15,828 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 18:29:15,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5115 states. [2019-12-07 18:29:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5115 to 4311. [2019-12-07 18:29:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4311 states. [2019-12-07 18:29:15,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4311 states to 4311 states and 6753 transitions. [2019-12-07 18:29:15,904 INFO L78 Accepts]: Start accepts. Automaton has 4311 states and 6753 transitions. Word has length 193 [2019-12-07 18:29:15,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:15,904 INFO L462 AbstractCegarLoop]: Abstraction has 4311 states and 6753 transitions. [2019-12-07 18:29:15,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:15,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4311 states and 6753 transitions. [2019-12-07 18:29:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:29:15,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:15,907 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:15,907 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1478506975, now seen corresponding path program 1 times [2019-12-07 18:29:15,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:15,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843517934] [2019-12-07 18:29:15,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:29:15,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843517934] [2019-12-07 18:29:15,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:15,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:29:15,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289984502] [2019-12-07 18:29:15,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:15,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:29:15,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:15,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:15,954 INFO L87 Difference]: Start difference. First operand 4311 states and 6753 transitions. Second operand 4 states. [2019-12-07 18:29:16,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:16,364 INFO L93 Difference]: Finished difference Result 7613 states and 11863 transitions. [2019-12-07 18:29:16,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:16,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-12-07 18:29:16,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:16,368 INFO L225 Difference]: With dead ends: 7613 [2019-12-07 18:29:16,368 INFO L226 Difference]: Without dead ends: 5403 [2019-12-07 18:29:16,369 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 18:29:16,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-12-07 18:29:16,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 4455. [2019-12-07 18:29:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4455 states. [2019-12-07 18:29:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4455 states to 4455 states and 6957 transitions. [2019-12-07 18:29:16,449 INFO L78 Accepts]: Start accepts. Automaton has 4455 states and 6957 transitions. Word has length 193 [2019-12-07 18:29:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:16,449 INFO L462 AbstractCegarLoop]: Abstraction has 4455 states and 6957 transitions. [2019-12-07 18:29:16,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:16,449 INFO L276 IsEmpty]: Start isEmpty. Operand 4455 states and 6957 transitions. [2019-12-07 18:29:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:29:16,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:16,452 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:16,452 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:16,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:16,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-12-07 18:29:16,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:29:16,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585012725] [2019-12-07 18:29:16,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:29:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:29:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:29:16,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:29:16,606 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:29:16,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:29:16 BoogieIcfgContainer [2019-12-07 18:29:16,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:29:16,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:29:16,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:29:16,714 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:29:16,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:28:43" (3/4) ... [2019-12-07 18:29:16,716 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:29:16,717 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:29:16,717 INFO L168 Benchmark]: Toolchain (without parser) took 33950.44 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 647.5 MB). Free memory was 939.3 MB in the beginning and 1.2 GB in the end (delta: -239.5 MB). Peak memory consumption was 408.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:29:16,717 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:29:16,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:29:16,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:29:16,718 INFO L168 Benchmark]: Boogie Preprocessor took 54.61 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:29:16,718 INFO L168 Benchmark]: RCFGBuilder took 668.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.6 MB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:29:16,718 INFO L168 Benchmark]: TraceAbstraction took 32735.21 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 546.8 MB). Free memory was 962.6 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 330.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:29:16,719 INFO L168 Benchmark]: Witness Printer took 3.19 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:29:16,720 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 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -132.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.28 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 54.61 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 668.94 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 962.6 MB in the end (delta: 98.9 MB). Peak memory consumption was 98.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32735.21 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 546.8 MB). Free memory was 962.6 MB in the beginning and 1.2 GB in the end (delta: -216.3 MB). Peak memory consumption was 330.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.19 ms. Allocated memory is still 1.7 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1726]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={8:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={8:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={8:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={8:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={8:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={8:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={8:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={8:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={8:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={8:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={8:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={8:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={8:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={8:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={8:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={8:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 32.5s, OverallIterations: 66, TraceHistogramMax: 7, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 14023 SDtfs, 5435 SDslu, 21551 SDs, 0 SdLazy, 14375 SolverSat, 883 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 294 SyntacticMatches, 34 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4455occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 65 MinimizatonAttempts, 16231 StatesRemovedByMinimization, 63 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 7490 NumberOfCodeBlocks, 7490 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 7231 ConstructedInterpolants, 80 QuantifiedInterpolants, 3765794 SizeOfPredicates, 12 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 66 InterpolantComputations, 64 PerfectInterpolantSequences, 7526/7768 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... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 18:29:18,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:29:18,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:29:18,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:29:18,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:29:18,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:29:18,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:29:18,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:29:18,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:29:18,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:29:18,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:29:18,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:29:18,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:29:18,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:29:18,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:29:18,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:29:18,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:29:18,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:29:18,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:29:18,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:29:18,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:29:18,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:29:18,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:29:18,071 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:29:18,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:29:18,073 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:29:18,073 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:29:18,074 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:29:18,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:29:18,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:29:18,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:29:18,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:29:18,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:29:18,076 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:29:18,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:29:18,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:29:18,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:29:18,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:29:18,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:29:18,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:29:18,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:29:18,080 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 18:29:18,090 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:29:18,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:29:18,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:29:18,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:29:18,091 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:29:18,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:29:18,091 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:29:18,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 18:29:18,092 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:29:18,093 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:29:18,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:29:18,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 18:29:18,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:29:18,095 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:29:18,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 18:29:18,095 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_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 -> 2022a41801b102600c4bc475b4f1b54abdd4798f [2019-12-07 18:29:18,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:29:18,277 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:29:18,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:29:18,281 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:29:18,281 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:29:18,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:29:18,320 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/a39026ce2/2ae1a8bf6af74872b0c299891285f0fc/FLAGa4fa3417d [2019-12-07 18:29:18,852 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:29:18,853 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/sv-benchmarks/c/ssh/s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:29:18,868 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/a39026ce2/2ae1a8bf6af74872b0c299891285f0fc/FLAGa4fa3417d [2019-12-07 18:29:19,352 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/data/a39026ce2/2ae1a8bf6af74872b0c299891285f0fc [2019-12-07 18:29:19,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:29:19,356 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:29:19,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:29:19,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:29:19,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:29:19,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,361 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 06:29:19, skipping insertion in model container [2019-12-07 18:29:19,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,367 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:29:19,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:29:19,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:29:19,708 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:29:19,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:29:19,793 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:29:19,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19 WrapperNode [2019-12-07 18:29:19,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:29:19,794 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:29:19,794 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:29:19,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:29:19,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 06:29:19" (1/1) ... [2019-12-07 18:29:19,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,849 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:29:19,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:29:19,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:29:19,850 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:29:19,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... [2019-12-07 18:29:19,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:29:19,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:29:19,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:29:19,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:29:19,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 18:29:19,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:29:19,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:29:19,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 18:29:20,160 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 18:29:22,480 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 18:29:22,481 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 18:29:22,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:29:22,482 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:29:22,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:29:22 BoogieIcfgContainer [2019-12-07 18:29:22,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:29:22,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:29:22,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:29:22,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:29:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:29:19" (1/3) ... [2019-12-07 18:29:22,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebc74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:29:22, skipping insertion in model container [2019-12-07 18:29:22,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:29:19" (2/3) ... [2019-12-07 18:29:22,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56ebc74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:29:22, skipping insertion in model container [2019-12-07 18:29:22,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:29:22" (3/3) ... [2019-12-07 18:29:22,488 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.07.i.cil-2.c [2019-12-07 18:29:22,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:29:22,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:29:22,507 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:29:22,522 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:29:22,523 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:29:22,523 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:29:22,523 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:29:22,523 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:29:22,523 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:29:22,523 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:29:22,523 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:29:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-12-07 18:29:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:29:22,542 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:22,543 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] [2019-12-07 18:29:22,543 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:22,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-12-07 18:29:22,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:22,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005535430] [2019-12-07 18:29:22,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:22,671 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:29:22,676 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:22,704 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 18:29:22,705 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:22,721 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 18:29:22,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005535430] [2019-12-07 18:29:22,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:22,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:29:22,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12360794] [2019-12-07 18:29:22,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:22,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:22,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:22,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:22,738 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-12-07 18:29:22,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:22,860 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-12-07 18:29:22,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:22,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 18:29:22,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:22,875 INFO L225 Difference]: With dead ends: 564 [2019-12-07 18:29:22,875 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 18:29:22,878 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 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 18:29:22,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 18:29:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-12-07 18:29:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-12-07 18:29:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-12-07 18:29:22,935 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-12-07 18:29:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:22,936 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-12-07 18:29:22,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-12-07 18:29:22,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:29:22,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:22,939 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] [2019-12-07 18:29:23,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 18:29:23,140 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:23,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:23,141 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-12-07 18:29:23,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:23,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967039223] [2019-12-07 18:29:23,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:23,346 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:29:23,350 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:23,366 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 18:29:23,366 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:23,384 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 18:29:23,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967039223] [2019-12-07 18:29:23,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:23,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:29:23,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214883889] [2019-12-07 18:29:23,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:23,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:23,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:23,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:23,387 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-12-07 18:29:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:23,912 INFO L93 Difference]: Finished difference Result 877 states and 1350 transitions. [2019-12-07 18:29:23,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:23,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 18:29:23,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:23,916 INFO L225 Difference]: With dead ends: 877 [2019-12-07 18:29:23,916 INFO L226 Difference]: Without dead ends: 626 [2019-12-07 18:29:23,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 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 18:29:23,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-12-07 18:29:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 624. [2019-12-07 18:29:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-12-07 18:29:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 947 transitions. [2019-12-07 18:29:23,943 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 947 transitions. Word has length 58 [2019-12-07 18:29:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:23,943 INFO L462 AbstractCegarLoop]: Abstraction has 624 states and 947 transitions. [2019-12-07 18:29:23,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 947 transitions. [2019-12-07 18:29:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 18:29:23,949 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:23,949 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:29:24,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 18:29:24,150 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:24,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:24,151 INFO L82 PathProgramCache]: Analyzing trace with hash -222873622, now seen corresponding path program 1 times [2019-12-07 18:29:24,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:24,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847064453] [2019-12-07 18:29:24,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:24,357 INFO L264 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:29:24,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:29:24,400 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 18:29:24,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847064453] [2019-12-07 18:29:24,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:24,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:29:24,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623652710] [2019-12-07 18:29:24,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:29:24,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:24,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:29:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:29:24,422 INFO L87 Difference]: Start difference. First operand 624 states and 947 transitions. Second operand 3 states. [2019-12-07 18:29:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:26,029 INFO L93 Difference]: Finished difference Result 1236 states and 1885 transitions. [2019-12-07 18:29:26,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:29:26,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-12-07 18:29:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:26,033 INFO L225 Difference]: With dead ends: 1236 [2019-12-07 18:29:26,034 INFO L226 Difference]: Without dead ends: 744 [2019-12-07 18:29:26,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 231 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 18:29:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2019-12-07 18:29:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 744. [2019-12-07 18:29:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2019-12-07 18:29:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1127 transitions. [2019-12-07 18:29:26,053 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1127 transitions. Word has length 117 [2019-12-07 18:29:26,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:26,053 INFO L462 AbstractCegarLoop]: Abstraction has 744 states and 1127 transitions. [2019-12-07 18:29:26,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:29:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1127 transitions. [2019-12-07 18:29:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 18:29:26,056 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:26,056 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:29:26,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 18:29:26,257 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:26,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:26,258 INFO L82 PathProgramCache]: Analyzing trace with hash 369635549, now seen corresponding path program 1 times [2019-12-07 18:29:26,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:26,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809206969] [2019-12-07 18:29:26,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:26,429 INFO L264 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:29:26,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:26,454 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:29:26,454 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:29:26,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809206969] [2019-12-07 18:29:26,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:29:26,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:29:26,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176110161] [2019-12-07 18:29:26,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:29:26,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:26,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:29:26,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:29:26,479 INFO L87 Difference]: Start difference. First operand 744 states and 1127 transitions. Second operand 4 states. [2019-12-07 18:29:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:29:26,944 INFO L93 Difference]: Finished difference Result 1603 states and 2440 transitions. [2019-12-07 18:29:26,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:29:26,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 18:29:26,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:29:26,948 INFO L225 Difference]: With dead ends: 1603 [2019-12-07 18:29:26,948 INFO L226 Difference]: Without dead ends: 991 [2019-12-07 18:29:26,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 278 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 18:29:26,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-12-07 18:29:26,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2019-12-07 18:29:26,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 991 states. [2019-12-07 18:29:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1499 transitions. [2019-12-07 18:29:26,972 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1499 transitions. Word has length 141 [2019-12-07 18:29:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:29:26,973 INFO L462 AbstractCegarLoop]: Abstraction has 991 states and 1499 transitions. [2019-12-07 18:29:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:29:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1499 transitions. [2019-12-07 18:29:26,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:29:26,975 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:29:26,975 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] [2019-12-07 18:29:27,175 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 18:29:27,176 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:29:27,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:29:27,176 INFO L82 PathProgramCache]: Analyzing trace with hash 990449606, now seen corresponding path program 1 times [2019-12-07 18:29:27,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:29:27,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279976549] [2019-12-07 18:29:27,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:29:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:29:27,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:29:27,512 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:29:29,060 INFO L237 Elim1Store]: Index analysis took 429 ms [2019-12-07 18:29:29,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:29,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 18:29:29,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:31,298 WARN L192 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 18:29:31,298 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:31,304 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_174|, |v_#memory_$Pointer$.offset_175|], 2=[|v_#memory_$Pointer$.base_172|, |v_#memory_$Pointer$.base_171|, |v_#memory_$Pointer$.offset_171|, |v_#memory_$Pointer$.offset_172|]} [2019-12-07 18:29:31,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:31,950 INFO L237 Elim1Store]: Index analysis took 491 ms [2019-12-07 18:29:32,836 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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 18:29:32,836 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:34,771 WARN L192 SmtUtils]: Spent 1.93 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 18:29:34,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:34,875 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:34,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:34,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:34,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:34,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:35,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:35,041 INFO L237 Elim1Store]: Index analysis took 213 ms [2019-12-07 18:29:35,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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 18:29:35,258 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:36,384 WARN L192 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 18:29:36,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:36,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:36,546 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:29:36,547 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,006 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 18:29:37,007 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:29:37,059 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,288 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 18:29:37,288 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,297 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:37,484 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 18:29:37,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-12-07 18:29:37,504 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,557 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 18:29:37,588 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_176|], 12=[|v_#memory_$Pointer$.base_175|]} [2019-12-07 18:29:37,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,601 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 29 treesize of output 13 [2019-12-07 18:29:37,601 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:29:37,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,702 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,702 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,703 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:29:37,710 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_177|], 12=[|v_#memory_$Pointer$.base_176|]} [2019-12-07 18:29:37,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,726 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 29 treesize of output 13 [2019-12-07 18:29:37,726 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,808 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:37,811 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:29:37,811 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,839 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:37,839 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:37,839 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:29:37,843 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.offset_173|, |v_#memory_$Pointer$.offset_178|], 12=[|v_#memory_$Pointer$.base_177|]} [2019-12-07 18:29:37,850 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 18:29:38,200 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 18:29:38,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,210 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 18:29:38,442 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-12-07 18:29:38,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,489 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 34 treesize of output 22 [2019-12-07 18:29:38,489 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,635 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-12-07 18:29:38,635 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,649 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 18:29:38,650 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,686 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,686 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 18:29:38,693 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_179|], 12=[|v_#memory_$Pointer$.base_178|]} [2019-12-07 18:29:38,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,708 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 29 treesize of output 13 [2019-12-07 18:29:38,709 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:29:38,790 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,815 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,815 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:29:38,818 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_180|], 12=[|v_#memory_$Pointer$.base_179|]} [2019-12-07 18:29:38,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,831 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 29 treesize of output 13 [2019-12-07 18:29:38,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:29:38,884 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,909 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,910 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:29:38,921 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_180|], 12=[|v_#memory_$Pointer$.offset_181|]} [2019-12-07 18:29:38,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,927 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 128 treesize of output 56 [2019-12-07 18:29:38,928 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:38,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:38,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 18:29:38,959 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:38,982 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:38,982 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:38,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:52 [2019-12-07 18:29:39,020 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_174|], 20=[|v_#memory_$Pointer$.offset_182|]} [2019-12-07 18:29:39,024 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 18:29:39,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,107 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 58 [2019-12-07 18:29:39,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,143 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,143 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:90, output treesize:44 [2019-12-07 18:29:39,203 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_191|], 20=[|v_#memory_$Pointer$.offset_183|]} [2019-12-07 18:29:39,213 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 13 treesize of output 9 [2019-12-07 18:29:39,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,269 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2019-12-07 18:29:39,269 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,298 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:53 [2019-12-07 18:29:39,346 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_181|], 2=[|v_#memory_int_192|], 12=[|v_#memory_$Pointer$.offset_184|]} [2019-12-07 18:29:39,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 18:29:39,354 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 18:29:39,397 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,405 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 29 treesize of output 28 [2019-12-07 18:29:39,405 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,435 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,441 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-12-07 18:29:39,441 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,455 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,455 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:22 [2019-12-07 18:29:39,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:29:39,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,484 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 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 18:29:39,485 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,495 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:29 [2019-12-07 18:29:39,534 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,534 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:29:39,535 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,536 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,536 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 18:29:39,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 18:29:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:29:39,754 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:29:39,791 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 37 treesize of output 25 [2019-12-07 18:29:39,791 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 18:29:39,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,796 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 18:29:39,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:29:39,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,857 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 18:29:39,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,865 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:17 [2019-12-07 18:29:39,901 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_188|], 2=[|v_#memory_$Pointer$.offset_174|]} [2019-12-07 18:29:39,904 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 18:29:39,921 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,922 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 18:29:39,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:39,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:39,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 18:29:40,043 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_187|], 20=[|v_#memory_$Pointer$.offset_190|]} [2019-12-07 18:29:40,046 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 18:29:40,072 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,073 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 18:29:40,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:40,084 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 18:29:40,166 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_188|], 1=[|v_#memory_$Pointer$.offset_191|]} [2019-12-07 18:29:40,169 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 18:29:40,216 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,218 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 18:29:40,232 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:40,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 18:29:40,397 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_189|], 1=[|v_#memory_$Pointer$.offset_192|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.offset_173|]} [2019-12-07 18:29:40,402 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 18:29:40,641 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 18:29:40,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,646 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 18:29:40,780 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:29:40,780 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,783 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 18:29:40,858 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,860 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:40,879 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:40,879 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:40,879 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 18:29:41,117 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_190|], 1=[|v_#memory_$Pointer$.offset_193|]} [2019-12-07 18:29:41,120 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 18:29:41,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:41,169 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 18:29:41,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:41,182 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:41,183 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:199, output treesize:198 [2019-12-07 18:29:41,539 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_191|], 1=[|v_#memory_$Pointer$.offset_194|]} [2019-12-07 18:29:41,542 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 18:29:41,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:41,623 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 18:29:41,654 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:29:41,654 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 18:29:41,655 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 18:29:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:29:43,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279976549] [2019-12-07 18:29:43,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:29:43,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-12-07 18:29:43,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841894793] [2019-12-07 18:29:43,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:29:43,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:29:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:29:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:29:43,998 INFO L87 Difference]: Start difference. First operand 991 states and 1499 transitions. Second operand 16 states. [2019-12-07 18:38:30,425 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2019-12-07 18:38:57,339 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 18:40:19,164 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 18:41:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:31,919 INFO L93 Difference]: Finished difference Result 3813 states and 5849 transitions. [2019-12-07 18:41:31,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:41:31,921 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2019-12-07 18:41:31,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:31,933 INFO L225 Difference]: With dead ends: 3813 [2019-12-07 18:41:31,934 INFO L226 Difference]: Without dead ends: 2830 [2019-12-07 18:41:31,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 308 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 40.7s TimeCoverageRelationStatistics Valid=150, Invalid=339, Unknown=17, NotChecked=0, Total=506 [2019-12-07 18:41:31,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-12-07 18:41:31,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 1247. [2019-12-07 18:41:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2019-12-07 18:41:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1963 transitions. [2019-12-07 18:41:31,986 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1963 transitions. Word has length 164 [2019-12-07 18:41:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:31,986 INFO L462 AbstractCegarLoop]: Abstraction has 1247 states and 1963 transitions. [2019-12-07 18:41:31,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:41:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1963 transitions. [2019-12-07 18:41:31,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 18:41:31,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:31,988 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, 1, 1, 1, 1] [2019-12-07 18:41:32,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 18:41:32,189 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -329499811, now seen corresponding path program 1 times [2019-12-07 18:41:32,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:41:32,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095669344] [2019-12-07 18:41:32,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:41:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:32,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:41:32,463 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:41:32,468 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 18:41:32,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:32,471 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:32,471 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:41:32,471 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:41:32,495 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:41:32,495 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 18:41:32,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:32,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:32,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:41:32,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-12-07 18:41:32,527 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 18:41:32,528 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 18:41:32,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:32,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:32,529 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 18:41:32,529 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 18:41:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 18:41:32,561 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:41:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-12-07 18:41:32,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095669344] [2019-12-07 18:41:32,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:32,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-12-07 18:41:32,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858623801] [2019-12-07 18:41:32,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:41:32,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:41:32,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:41:32,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:41:32,609 INFO L87 Difference]: Start difference. First operand 1247 states and 1963 transitions. Second operand 7 states. [2019-12-07 18:41:39,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:39,413 INFO L93 Difference]: Finished difference Result 4232 states and 6582 transitions. [2019-12-07 18:41:39,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:41:39,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 170 [2019-12-07 18:41:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:39,424 INFO L225 Difference]: With dead ends: 4232 [2019-12-07 18:41:39,424 INFO L226 Difference]: Without dead ends: 2993 [2019-12-07 18:41:39,426 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 332 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:41:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2993 states. [2019-12-07 18:41:39,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2993 to 1446. [2019-12-07 18:41:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2019-12-07 18:41:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2298 transitions. [2019-12-07 18:41:39,482 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2298 transitions. Word has length 170 [2019-12-07 18:41:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:39,483 INFO L462 AbstractCegarLoop]: Abstraction has 1446 states and 2298 transitions. [2019-12-07 18:41:39,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:41:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2298 transitions. [2019-12-07 18:41:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 18:41:39,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:39,485 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, 1, 1, 1, 1] [2019-12-07 18:41:39,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 18:41:39,686 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:39,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1277551777, now seen corresponding path program 1 times [2019-12-07 18:41:39,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:41:39,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993062234] [2019-12-07 18:41:39,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:41:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:39,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:41:39,972 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:41:39,988 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:41:39,988 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 18:41:39,989 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:39,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:39,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:41:39,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 18:41:40,012 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 18:41:40,013 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 18:41:40,013 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:40,014 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:40,014 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 18:41:40,015 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 18:41:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 18:41:40,044 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:41:40,074 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 18:41:40,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993062234] [2019-12-07 18:41:40,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:40,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-12-07 18:41:40,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042820588] [2019-12-07 18:41:40,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:40,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:41:40,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:40,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:40,075 INFO L87 Difference]: Start difference. First operand 1446 states and 2298 transitions. Second operand 5 states. [2019-12-07 18:41:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:43,206 INFO L93 Difference]: Finished difference Result 3392 states and 5368 transitions. [2019-12-07 18:41:43,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:43,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 170 [2019-12-07 18:41:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:43,215 INFO L225 Difference]: With dead ends: 3392 [2019-12-07 18:41:43,215 INFO L226 Difference]: Without dead ends: 1954 [2019-12-07 18:41:43,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 335 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 18:41:43,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-12-07 18:41:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1670. [2019-12-07 18:41:43,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1670 states. [2019-12-07 18:41:43,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2690 transitions. [2019-12-07 18:41:43,270 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2690 transitions. Word has length 170 [2019-12-07 18:41:43,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:43,270 INFO L462 AbstractCegarLoop]: Abstraction has 1670 states and 2690 transitions. [2019-12-07 18:41:43,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:43,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2690 transitions. [2019-12-07 18:41:43,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 18:41:43,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:43,274 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:43,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 18:41:43,474 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:43,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1388988703, now seen corresponding path program 1 times [2019-12-07 18:41:43,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:41:43,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1821726179] [2019-12-07 18:41:43,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:41:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:43,631 INFO L264 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:41:43,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:41:43,637 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_208|, |v_#memory_$Pointer$.base_205|], 4=[|v_#memory_int_220|]} [2019-12-07 18:41:43,639 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 18:41:43,639 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 18:41:43,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:43,650 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 85 treesize of output 49 [2019-12-07 18:41:43,650 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 18:41:43,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:43,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:43,691 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 18:41:43,691 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:51,796 WARN L192 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 18:41:51,796 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:51,796 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:41:51,797 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 18:41:51,804 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 18:41:51,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:51,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:51,806 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 18:41:51,806 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 18:41:51,825 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 18:41:51,825 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:41:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-12-07 18:41:51,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1821726179] [2019-12-07 18:41:51,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:51,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 18:41:51,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085128872] [2019-12-07 18:41:51,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:51,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:41:51,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:51,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:51,844 INFO L87 Difference]: Start difference. First operand 1670 states and 2690 transitions. Second operand 4 states. [2019-12-07 18:41:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:54,122 INFO L93 Difference]: Finished difference Result 3564 states and 5713 transitions. [2019-12-07 18:41:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:54,124 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-12-07 18:41:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:54,131 INFO L225 Difference]: With dead ends: 3564 [2019-12-07 18:41:54,131 INFO L226 Difference]: Without dead ends: 1902 [2019-12-07 18:41:54,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 352 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 18:41:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-07 18:41:54,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1798. [2019-12-07 18:41:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-12-07 18:41:54,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2898 transitions. [2019-12-07 18:41:54,194 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2898 transitions. Word has length 178 [2019-12-07 18:41:54,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:54,194 INFO L462 AbstractCegarLoop]: Abstraction has 1798 states and 2898 transitions. [2019-12-07 18:41:54,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:54,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2898 transitions. [2019-12-07 18:41:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 18:41:54,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:54,198 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 18:41:54,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 18:41:54,400 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:41:54,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431756, now seen corresponding path program 1 times [2019-12-07 18:41:54,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:41:54,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764998328] [2019-12-07 18:41:54,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:41:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:54,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:41:54,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:41:54,623 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 18:41:54,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:54,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:54,626 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:41:54,626 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:41:54,634 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 18:41:54,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:41:54,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:41:54,636 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 18:41:54,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:41:54,662 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:41:54,662 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:41:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:41:54,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764998328] [2019-12-07 18:41:54,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:54,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:41:54,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081435975] [2019-12-07 18:41:54,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:41:54,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:41:54,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:41:54,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:41:54,703 INFO L87 Difference]: Start difference. First operand 1798 states and 2898 transitions. Second operand 6 states. [2019-12-07 18:42:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:01,192 INFO L93 Difference]: Finished difference Result 5745 states and 9180 transitions. [2019-12-07 18:42:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:01,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 178 [2019-12-07 18:42:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:01,208 INFO L225 Difference]: With dead ends: 5745 [2019-12-07 18:42:01,208 INFO L226 Difference]: Without dead ends: 3955 [2019-12-07 18:42:01,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 350 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 18:42:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2019-12-07 18:42:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 2278. [2019-12-07 18:42:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2278 states. [2019-12-07 18:42:01,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 3767 transitions. [2019-12-07 18:42:01,292 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 3767 transitions. Word has length 178 [2019-12-07 18:42:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:01,293 INFO L462 AbstractCegarLoop]: Abstraction has 2278 states and 3767 transitions. [2019-12-07 18:42:01,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:01,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 3767 transitions. [2019-12-07 18:42:01,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 18:42:01,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:01,295 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:42:01,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 18:42:01,496 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1995576182, now seen corresponding path program 1 times [2019-12-07 18:42:01,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:42:01,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1019548128] [2019-12-07 18:42:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:42:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:01,704 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:42:01,706 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:42:01,711 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 18:42:01,711 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:01,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:01,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:42:01,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:42:01,721 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 18:42:01,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:01,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:01,722 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 18:42:01,722 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:42:01,748 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:42:01,748 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:42:01,787 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-12-07 18:42:01,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1019548128] [2019-12-07 18:42:01,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:01,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:42:01,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069078129] [2019-12-07 18:42:01,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:42:01,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:42:01,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:42:01,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:42:01,788 INFO L87 Difference]: Start difference. First operand 2278 states and 3767 transitions. Second operand 6 states. [2019-12-07 18:42:07,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:07,489 INFO L93 Difference]: Finished difference Result 6049 states and 9770 transitions. [2019-12-07 18:42:07,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:07,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-12-07 18:42:07,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:07,504 INFO L225 Difference]: With dead ends: 6049 [2019-12-07 18:42:07,504 INFO L226 Difference]: Without dead ends: 3779 [2019-12-07 18:42:07,506 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 352 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 18:42:07,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3779 states. [2019-12-07 18:42:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3779 to 2406. [2019-12-07 18:42:07,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2019-12-07 18:42:07,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 4015 transitions. [2019-12-07 18:42:07,591 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 4015 transitions. Word has length 179 [2019-12-07 18:42:07,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:07,591 INFO L462 AbstractCegarLoop]: Abstraction has 2406 states and 4015 transitions. [2019-12-07 18:42:07,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 4015 transitions. [2019-12-07 18:42:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-12-07 18:42:07,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:07,594 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:42:07,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 18:42:07,795 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:07,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash -983707367, now seen corresponding path program 1 times [2019-12-07 18:42:07,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:42:07,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [234576933] [2019-12-07 18:42:07,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:42:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:08,011 INFO L264 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:42:08,013 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:42:08,018 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 18:42:08,018 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:08,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:08,021 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:42:08,021 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:42:08,028 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 18:42:08,028 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:08,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:08,030 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 18:42:08,030 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:42:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 18:42:08,058 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:42:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 18:42:08,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [234576933] [2019-12-07 18:42:08,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:08,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:42:08,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058236661] [2019-12-07 18:42:08,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:42:08,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:42:08,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:42:08,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:42:08,099 INFO L87 Difference]: Start difference. First operand 2406 states and 4015 transitions. Second operand 6 states. [2019-12-07 18:42:14,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:14,808 INFO L93 Difference]: Finished difference Result 6497 states and 10578 transitions. [2019-12-07 18:42:14,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:14,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-12-07 18:42:14,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:14,824 INFO L225 Difference]: With dead ends: 6497 [2019-12-07 18:42:14,824 INFO L226 Difference]: Without dead ends: 4099 [2019-12-07 18:42:14,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 362 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 18:42:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2019-12-07 18:42:14,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2741. [2019-12-07 18:42:14,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2741 states. [2019-12-07 18:42:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4606 transitions. [2019-12-07 18:42:14,919 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4606 transitions. Word has length 184 [2019-12-07 18:42:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:14,919 INFO L462 AbstractCegarLoop]: Abstraction has 2741 states and 4606 transitions. [2019-12-07 18:42:14,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4606 transitions. [2019-12-07 18:42:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 18:42:14,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:14,922 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:42:15,122 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 18:42:15,123 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:15,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1644166725, now seen corresponding path program 1 times [2019-12-07 18:42:15,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:42:15,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141214654] [2019-12-07 18:42:15,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:42:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:15,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:42:15,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:42:15,320 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 18:42:15,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:15,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:15,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:42:15,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:42:15,330 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 18:42:15,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:15,331 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:15,332 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 18:42:15,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:42:15,360 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 18:42:15,360 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:42:15,401 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2019-12-07 18:42:15,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141214654] [2019-12-07 18:42:15,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:15,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:42:15,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632511318] [2019-12-07 18:42:15,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:42:15,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:42:15,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:42:15,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:42:15,402 INFO L87 Difference]: Start difference. First operand 2741 states and 4606 transitions. Second operand 6 states. [2019-12-07 18:42:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:21,342 INFO L93 Difference]: Finished difference Result 6832 states and 11161 transitions. [2019-12-07 18:42:21,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:21,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 185 [2019-12-07 18:42:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:21,351 INFO L225 Difference]: With dead ends: 6832 [2019-12-07 18:42:21,351 INFO L226 Difference]: Without dead ends: 4099 [2019-12-07 18:42:21,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 364 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 18:42:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2019-12-07 18:42:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 2757. [2019-12-07 18:42:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-12-07 18:42:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 4630 transitions. [2019-12-07 18:42:21,443 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 4630 transitions. Word has length 185 [2019-12-07 18:42:21,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:21,444 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 4630 transitions. [2019-12-07 18:42:21,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:21,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 4630 transitions. [2019-12-07 18:42:21,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:42:21,446 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:21,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:42:21,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 18:42:21,648 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:21,648 INFO L82 PathProgramCache]: Analyzing trace with hash 426346312, now seen corresponding path program 1 times [2019-12-07 18:42:21,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:42:21,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404135331] [2019-12-07 18:42:21,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:42:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:42:22,032 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:42:22,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:42:22,056 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 18:42:22,056 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 18:42:22,056 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:22,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:22,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:42:22,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-12-07 18:42:22,085 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 18:42:22,085 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 18:42:22,085 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:42:22,086 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:42:22,086 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 18:42:22,086 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-12-07 18:42:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:42:22,116 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:42:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-12-07 18:42:22,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404135331] [2019-12-07 18:42:22,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:42:22,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:42:22,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484161986] [2019-12-07 18:42:22,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:42:22,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:42:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:42:22,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:42:22,155 INFO L87 Difference]: Start difference. First operand 2757 states and 4630 transitions. Second operand 6 states. [2019-12-07 18:42:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:42:27,718 INFO L93 Difference]: Finished difference Result 6662 states and 10923 transitions. [2019-12-07 18:42:27,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:42:27,720 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-12-07 18:42:27,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:42:27,734 INFO L225 Difference]: With dead ends: 6662 [2019-12-07 18:42:27,734 INFO L226 Difference]: Without dead ends: 3913 [2019-12-07 18:42:27,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 378 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 18:42:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3913 states. [2019-12-07 18:42:27,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3913 to 2911. [2019-12-07 18:42:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2911 states. [2019-12-07 18:42:27,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2911 states to 2911 states and 4856 transitions. [2019-12-07 18:42:27,815 INFO L78 Accepts]: Start accepts. Automaton has 2911 states and 4856 transitions. Word has length 192 [2019-12-07 18:42:27,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:42:27,815 INFO L462 AbstractCegarLoop]: Abstraction has 2911 states and 4856 transitions. [2019-12-07 18:42:27,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:42:27,816 INFO L276 IsEmpty]: Start isEmpty. Operand 2911 states and 4856 transitions. [2019-12-07 18:42:27,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 18:42:27,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:42:27,818 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:42:28,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 18:42:28,019 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:42:28,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:42:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1815772062, now seen corresponding path program 1 times [2019-12-07 18:42:28,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:42:28,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529951191] [2019-12-07 18:42:28,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/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 18:42:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:42:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:42:28,932 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-12-07 18:42:28,932 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:42:29,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 18:42:29,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:42:29 BoogieIcfgContainer [2019-12-07 18:42:29,305 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:42:29,305 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:42:29,305 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:42:29,305 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:42:29,306 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:29:22" (3/4) ... [2019-12-07 18:42:29,307 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:42:29,388 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a6338f18-e9d4-45aa-8f8a-b5c374b5f31c/bin/uautomizer/witness.graphml [2019-12-07 18:42:29,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:42:29,389 INFO L168 Benchmark]: Toolchain (without parser) took 790034.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 945.7 MB in the beginning and 931.3 MB in the end (delta: 14.4 MB). Peak memory consumption was 203.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:29,390 INFO L168 Benchmark]: CDTParser took 0.14 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 18:42:29,390 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:29,390 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.37 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 18:42:29,390 INFO L168 Benchmark]: Boogie Preprocessor took 54.60 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 18:42:29,391 INFO L168 Benchmark]: RCFGBuilder took 2578.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:29,391 INFO L168 Benchmark]: TraceAbstraction took 786821.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 960.7 MB in the beginning and 956.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:29,391 INFO L168 Benchmark]: Witness Printer took 83.44 ms. Allocated memory is still 1.2 GB. Free memory was 956.4 MB in the beginning and 931.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:42:29,392 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.14 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 437.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.6 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -120.6 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.37 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.60 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 2578.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 92.1 MB). Peak memory consumption was 92.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 786821.62 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 90.2 MB). Free memory was 960.7 MB in the beginning and 956.4 MB in the end (delta: 4.4 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. * Witness Printer took 83.44 ms. Allocated memory is still 1.2 GB. Free memory was 956.4 MB in the beginning and 931.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1726]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={15:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={15:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={15:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={15:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={15:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={15:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={15:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND TRUE s->state == 8656 [L1570] EXPR s->session [L1570] EXPR s->s3 [L1570] EXPR (s->s3)->tmp.new_cipher [L1570] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1571] COND FALSE !(! tmp___9) [L1577] ret = __VERIFIER_nondet_int() [L1578] COND TRUE blastFlag == 2 [L1579] blastFlag = 3 VAL [init=1, SSLv3_server_data={15:0}] [L1591] COND FALSE !(ret <= 0) [L1596] s->state = 8672 [L1597] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1598] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={15:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1235] COND TRUE s->state == 8672 [L1607] ret = __VERIFIER_nondet_int() [L1608] COND TRUE blastFlag == 3 [L1609] blastFlag = 4 VAL [init=1, SSLv3_server_data={15:0}] [L1613] COND FALSE !(ret <= 0) [L1618] s->state = 8448 [L1619] s->hit VAL [init=1, SSLv3_server_data={15:0}] [L1619] COND TRUE s->hit [L1620] EXPR s->s3 [L1620] (s->s3)->tmp.next_state = 8640 [L1624] s->init_num = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={15:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1685] EXPR s->s3 [L1685] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={15:0}] [L1685] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1714] skip = 0 VAL [init=1, SSLv3_server_data={15:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={15:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={15:0}] [L1223] COND TRUE s->state == 8640 [L1550] ret = __VERIFIER_nondet_int() [L1551] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={15:0}] [L1726] __VERIFIER_error() VAL [init=1, SSLv3_server_data={15:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 1 error locations. Result: UNSAFE, OverallTime: 786.6s, OverallIterations: 14, TraceHistogramMax: 7, AutomataDifference: 753.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3231 SDtfs, 3541 SDslu, 5543 SDs, 0 SdLazy, 5362 SolverSat, 687 SolverUnsat, 315 SolverUnknown, 0 SolverNotchecked, 702.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3897 GetRequests, 3820 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 41.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2911occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 10274 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 25.8s InterpolantComputationTime, 2144 NumberOfCodeBlocks, 2144 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3876 ConstructedInterpolants, 197 QuantifiedInterpolants, 4868974 SizeOfPredicates, 53 NumberOfNonLiveVariables, 4638 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 26 InterpolantComputations, 24 PerfectInterpolantSequences, 5033/5364 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 proved your program to be incorrect! Received shutdown request...