./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.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_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 8ae4fea535defe079744031ef9589bd179b2820b ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 8ae4fea535defe079744031ef9589bd179b2820b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:53:33,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:53:33,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:53:33,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:53:33,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:53:33,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:53:33,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:53:33,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:53:33,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:53:33,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:53:33,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:53:33,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:53:33,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:53:33,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:53:33,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:53:33,139 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:53:33,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:53:33,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:53:33,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:53:33,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:53:33,144 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:53:33,144 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:53:33,145 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:53:33,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:53:33,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:53:33,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:53:33,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:53:33,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:53:33,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:53:33,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:53:33,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:53:33,149 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:53:33,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:53:33,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:53:33,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:53:33,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:53:33,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:53:33,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:53:33,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:53:33,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:53:33,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:53:33,153 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:53:33,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:53:33,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:53:33,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:53:33,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:53:33,163 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:53:33,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:53:33,163 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:53:33,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:53:33,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:53:33,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:53:33,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:53:33,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:53:33,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:53:33,166 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_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-12-07 12:53:33,266 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:53:33,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:53:33,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:53:33,280 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:53:33,281 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:53:33,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:53:33,328 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/9ad1e7721/cd86c8e3b4a44700828a32c26928e288/FLAG147c06db6 [2019-12-07 12:53:33,726 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:53:33,727 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:53:33,739 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/9ad1e7721/cd86c8e3b4a44700828a32c26928e288/FLAG147c06db6 [2019-12-07 12:53:33,747 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/9ad1e7721/cd86c8e3b4a44700828a32c26928e288 [2019-12-07 12:53:33,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:53:33,750 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:53:33,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:53:33,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:53:33,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:53:33,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:53:33" (1/1) ... [2019-12-07 12:53:33,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a30f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:33, skipping insertion in model container [2019-12-07 12:53:33,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:53:33" (1/1) ... [2019-12-07 12:53:33,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:53:33,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:53:34,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:53:34,082 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:53:34,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:53:34,164 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:53:34,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34 WrapperNode [2019-12-07 12:53:34,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:53:34,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:53:34,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:53:34,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:53:34,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,218 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:53:34,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:53:34,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:53:34,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:53:34,225 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... [2019-12-07 12:53:34,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:53:34,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:53:34,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:53:34,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:53:34,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:53:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:53:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:53:34,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:53:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 12:53:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:53:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:53:34,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:53:34,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:53:34,452 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:53:34,970 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 12:53:34,970 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 12:53:34,971 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:53:34,971 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:53:34,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:34 BoogieIcfgContainer [2019-12-07 12:53:34,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:53:34,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:53:34,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:53:34,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:53:34,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:53:33" (1/3) ... [2019-12-07 12:53:34,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5885e17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:53:34, skipping insertion in model container [2019-12-07 12:53:34,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:53:34" (2/3) ... [2019-12-07 12:53:34,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5885e17a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:53:34, skipping insertion in model container [2019-12-07 12:53:34,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:34" (3/3) ... [2019-12-07 12:53:34,978 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:53:34,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:53:34,990 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:53:34,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:53:35,017 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:53:35,017 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:53:35,017 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:53:35,017 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:53:35,017 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:53:35,018 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:53:35,018 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:53:35,018 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:53:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-12-07 12:53:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:53:35,039 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:35,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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:35,040 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash 557484008, now seen corresponding path program 1 times [2019-12-07 12:53:35,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:35,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146484929] [2019-12-07 12:53:35,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:35,276 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 12:53:35,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146484929] [2019-12-07 12:53:35,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:35,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:35,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43460884] [2019-12-07 12:53:35,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:35,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:35,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:35,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:35,291 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2019-12-07 12:53:35,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:35,603 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2019-12-07 12:53:35,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:35,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 12:53:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:35,613 INFO L225 Difference]: With dead ends: 333 [2019-12-07 12:53:35,613 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 12:53:35,616 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 12:53:35,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 12:53:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-12-07 12:53:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2019-12-07 12:53:35,649 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 42 [2019-12-07 12:53:35,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:35,649 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2019-12-07 12:53:35,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2019-12-07 12:53:35,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:53:35,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:35,652 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:35,652 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:35,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1860834976, now seen corresponding path program 1 times [2019-12-07 12:53:35,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:35,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336729326] [2019-12-07 12:53:35,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:35,730 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 12:53:35,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336729326] [2019-12-07 12:53:35,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:35,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:35,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904079919] [2019-12-07 12:53:35,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:35,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:35,733 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand 4 states. [2019-12-07 12:53:35,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:35,974 INFO L93 Difference]: Finished difference Result 300 states and 463 transitions. [2019-12-07 12:53:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:35,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 12:53:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:35,977 INFO L225 Difference]: With dead ends: 300 [2019-12-07 12:53:35,977 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 12:53:35,979 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 12:53:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 12:53:35,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-12-07 12:53:35,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2019-12-07 12:53:35,991 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 55 [2019-12-07 12:53:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:35,992 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2019-12-07 12:53:35,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2019-12-07 12:53:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:53:35,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:35,994 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:35,995 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:35,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:35,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2101358450, now seen corresponding path program 1 times [2019-12-07 12:53:35,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:35,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048855751] [2019-12-07 12:53:35,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:36,083 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 12:53:36,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048855751] [2019-12-07 12:53:36,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:36,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:36,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957144018] [2019-12-07 12:53:36,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:36,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:36,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:36,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:36,085 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand 4 states. [2019-12-07 12:53:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:36,318 INFO L93 Difference]: Finished difference Result 299 states and 461 transitions. [2019-12-07 12:53:36,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:36,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 12:53:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:36,319 INFO L225 Difference]: With dead ends: 299 [2019-12-07 12:53:36,320 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 12:53:36,320 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 12:53:36,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 12:53:36,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 151. [2019-12-07 12:53:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 234 transitions. [2019-12-07 12:53:36,327 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 234 transitions. Word has length 56 [2019-12-07 12:53:36,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:36,327 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 234 transitions. [2019-12-07 12:53:36,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 234 transitions. [2019-12-07 12:53:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:53:36,329 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:36,329 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:36,329 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1331085059, now seen corresponding path program 1 times [2019-12-07 12:53:36,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:36,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127803888] [2019-12-07 12:53:36,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:36,376 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 12:53:36,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127803888] [2019-12-07 12:53:36,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:36,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:36,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145065125] [2019-12-07 12:53:36,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:36,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:36,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:36,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:36,377 INFO L87 Difference]: Start difference. First operand 151 states and 234 transitions. Second operand 4 states. [2019-12-07 12:53:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:36,571 INFO L93 Difference]: Finished difference Result 297 states and 458 transitions. [2019-12-07 12:53:36,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:36,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 12:53:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:36,573 INFO L225 Difference]: With dead ends: 297 [2019-12-07 12:53:36,573 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 12:53:36,574 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 12:53:36,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 12:53:36,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-12-07 12:53:36,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:36,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2019-12-07 12:53:36,581 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 56 [2019-12-07 12:53:36,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:36,581 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2019-12-07 12:53:36,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:36,581 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2019-12-07 12:53:36,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:53:36,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:36,583 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:36,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 10231747, now seen corresponding path program 1 times [2019-12-07 12:53:36,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:36,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689866902] [2019-12-07 12:53:36,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:36,637 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 12:53:36,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689866902] [2019-12-07 12:53:36,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:36,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:36,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818581169] [2019-12-07 12:53:36,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:36,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:36,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:36,638 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand 4 states. [2019-12-07 12:53:36,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:36,832 INFO L93 Difference]: Finished difference Result 296 states and 456 transitions. [2019-12-07 12:53:36,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:36,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 12:53:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:36,834 INFO L225 Difference]: With dead ends: 296 [2019-12-07 12:53:36,834 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 12:53:36,835 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 12:53:36,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 12:53:36,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-12-07 12:53:36,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 232 transitions. [2019-12-07 12:53:36,839 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 232 transitions. Word has length 56 [2019-12-07 12:53:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:36,839 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 232 transitions. [2019-12-07 12:53:36,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:36,839 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 232 transitions. [2019-12-07 12:53:36,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:53:36,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:36,840 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:36,840 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:36,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1146098042, now seen corresponding path program 1 times [2019-12-07 12:53:36,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:36,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063012521] [2019-12-07 12:53:36,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:36,877 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 12:53:36,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063012521] [2019-12-07 12:53:36,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:36,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:36,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251096947] [2019-12-07 12:53:36,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:36,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:36,879 INFO L87 Difference]: Start difference. First operand 151 states and 232 transitions. Second operand 4 states. [2019-12-07 12:53:37,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:37,078 INFO L93 Difference]: Finished difference Result 296 states and 455 transitions. [2019-12-07 12:53:37,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:37,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 12:53:37,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:37,079 INFO L225 Difference]: With dead ends: 296 [2019-12-07 12:53:37,079 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 12:53:37,080 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 12:53:37,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 12:53:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-12-07 12:53:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2019-12-07 12:53:37,084 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 56 [2019-12-07 12:53:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:37,084 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2019-12-07 12:53:37,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2019-12-07 12:53:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:53:37,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:37,085 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:37,085 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:37,085 INFO L82 PathProgramCache]: Analyzing trace with hash -618208905, now seen corresponding path program 1 times [2019-12-07 12:53:37,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:37,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983055341] [2019-12-07 12:53:37,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:37,119 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 12:53:37,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983055341] [2019-12-07 12:53:37,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:37,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:37,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870763757] [2019-12-07 12:53:37,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:37,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:37,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:37,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:37,120 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand 4 states. [2019-12-07 12:53:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:37,298 INFO L93 Difference]: Finished difference Result 296 states and 454 transitions. [2019-12-07 12:53:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:37,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 12:53:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:37,300 INFO L225 Difference]: With dead ends: 296 [2019-12-07 12:53:37,300 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 12:53:37,300 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 12:53:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 12:53:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-12-07 12:53:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 230 transitions. [2019-12-07 12:53:37,304 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 230 transitions. Word has length 57 [2019-12-07 12:53:37,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:37,304 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 230 transitions. [2019-12-07 12:53:37,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:37,304 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 230 transitions. [2019-12-07 12:53:37,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 12:53:37,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:37,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:37,305 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:37,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:37,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1098918603, now seen corresponding path program 1 times [2019-12-07 12:53:37,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:37,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408296577] [2019-12-07 12:53:37,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:37,347 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 12:53:37,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408296577] [2019-12-07 12:53:37,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:37,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:37,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096654505] [2019-12-07 12:53:37,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:37,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:37,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:37,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:37,348 INFO L87 Difference]: Start difference. First operand 151 states and 230 transitions. Second operand 4 states. [2019-12-07 12:53:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:37,573 INFO L93 Difference]: Finished difference Result 296 states and 453 transitions. [2019-12-07 12:53:37,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:37,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 12:53:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:37,574 INFO L225 Difference]: With dead ends: 296 [2019-12-07 12:53:37,574 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 12:53:37,575 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 12:53:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 12:53:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 151. [2019-12-07 12:53:37,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 229 transitions. [2019-12-07 12:53:37,579 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 229 transitions. Word has length 58 [2019-12-07 12:53:37,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:37,579 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 229 transitions. [2019-12-07 12:53:37,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:37,579 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 229 transitions. [2019-12-07 12:53:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:53:37,580 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:37,580 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:37,580 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:37,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:37,580 INFO L82 PathProgramCache]: Analyzing trace with hash -442819246, now seen corresponding path program 1 times [2019-12-07 12:53:37,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:37,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915033457] [2019-12-07 12:53:37,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:37,617 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 12:53:37,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915033457] [2019-12-07 12:53:37,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:37,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:37,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287807302] [2019-12-07 12:53:37,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:37,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:37,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:37,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:37,618 INFO L87 Difference]: Start difference. First operand 151 states and 229 transitions. Second operand 4 states. [2019-12-07 12:53:37,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:37,773 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2019-12-07 12:53:37,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:37,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:53:37,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:37,774 INFO L225 Difference]: With dead ends: 286 [2019-12-07 12:53:37,774 INFO L226 Difference]: Without dead ends: 154 [2019-12-07 12:53:37,774 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 12:53:37,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-07 12:53:37,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-12-07 12:53:37,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:53:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 228 transitions. [2019-12-07 12:53:37,777 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 228 transitions. Word has length 59 [2019-12-07 12:53:37,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:37,777 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 228 transitions. [2019-12-07 12:53:37,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:37,778 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 228 transitions. [2019-12-07 12:53:37,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:53:37,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:37,778 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:37,778 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:37,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:37,778 INFO L82 PathProgramCache]: Analyzing trace with hash 230179562, now seen corresponding path program 1 times [2019-12-07 12:53:37,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:37,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664820830] [2019-12-07 12:53:37,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:37,812 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 12:53:37,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664820830] [2019-12-07 12:53:37,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:37,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:37,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330354369] [2019-12-07 12:53:37,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:37,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:37,813 INFO L87 Difference]: Start difference. First operand 151 states and 228 transitions. Second operand 4 states. [2019-12-07 12:53:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:38,030 INFO L93 Difference]: Finished difference Result 326 states and 500 transitions. [2019-12-07 12:53:38,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:38,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 12:53:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:38,032 INFO L225 Difference]: With dead ends: 326 [2019-12-07 12:53:38,032 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 12:53:38,032 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 12:53:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 12:53:38,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2019-12-07 12:53:38,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 266 transitions. [2019-12-07 12:53:38,036 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 266 transitions. Word has length 59 [2019-12-07 12:53:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:38,036 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 266 transitions. [2019-12-07 12:53:38,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 266 transitions. [2019-12-07 12:53:38,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 12:53:38,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:38,037 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:38,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:38,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1572577694, now seen corresponding path program 1 times [2019-12-07 12:53:38,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:38,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143188623] [2019-12-07 12:53:38,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:38,074 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 12:53:38,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143188623] [2019-12-07 12:53:38,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:38,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:38,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985429409] [2019-12-07 12:53:38,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:38,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:38,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:38,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:38,075 INFO L87 Difference]: Start difference. First operand 173 states and 266 transitions. Second operand 4 states. [2019-12-07 12:53:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:38,300 INFO L93 Difference]: Finished difference Result 348 states and 537 transitions. [2019-12-07 12:53:38,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:38,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 12:53:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:38,302 INFO L225 Difference]: With dead ends: 348 [2019-12-07 12:53:38,302 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 12:53:38,302 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 12:53:38,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 12:53:38,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 173. [2019-12-07 12:53:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:38,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 265 transitions. [2019-12-07 12:53:38,306 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 265 transitions. Word has length 72 [2019-12-07 12:53:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:38,306 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 265 transitions. [2019-12-07 12:53:38,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 265 transitions. [2019-12-07 12:53:38,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:53:38,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:38,307 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:38,307 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:38,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1255219216, now seen corresponding path program 1 times [2019-12-07 12:53:38,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:38,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117546989] [2019-12-07 12:53:38,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:38,340 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 12:53:38,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117546989] [2019-12-07 12:53:38,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:38,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:38,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959978899] [2019-12-07 12:53:38,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:38,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:38,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:38,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:38,342 INFO L87 Difference]: Start difference. First operand 173 states and 265 transitions. Second operand 4 states. [2019-12-07 12:53:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:38,607 INFO L93 Difference]: Finished difference Result 347 states and 534 transitions. [2019-12-07 12:53:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:38,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 12:53:38,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:38,608 INFO L225 Difference]: With dead ends: 347 [2019-12-07 12:53:38,608 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 12:53:38,609 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 12:53:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 12:53:38,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2019-12-07 12:53:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 264 transitions. [2019-12-07 12:53:38,612 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 264 transitions. Word has length 73 [2019-12-07 12:53:38,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:38,612 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 264 transitions. [2019-12-07 12:53:38,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:38,612 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 264 transitions. [2019-12-07 12:53:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:53:38,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:38,613 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:38,613 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:38,613 INFO L82 PathProgramCache]: Analyzing trace with hash 392695429, now seen corresponding path program 1 times [2019-12-07 12:53:38,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:38,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539953355] [2019-12-07 12:53:38,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:38,641 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 12:53:38,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539953355] [2019-12-07 12:53:38,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:38,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:38,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997815851] [2019-12-07 12:53:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:38,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:38,642 INFO L87 Difference]: Start difference. First operand 173 states and 264 transitions. Second operand 4 states. [2019-12-07 12:53:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:38,888 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2019-12-07 12:53:38,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:38,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 12:53:38,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:38,889 INFO L225 Difference]: With dead ends: 345 [2019-12-07 12:53:38,889 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 12:53:38,890 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 12:53:38,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 12:53:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 173. [2019-12-07 12:53:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 263 transitions. [2019-12-07 12:53:38,894 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 263 transitions. Word has length 73 [2019-12-07 12:53:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:38,894 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 263 transitions. [2019-12-07 12:53:38,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:38,894 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 263 transitions. [2019-12-07 12:53:38,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:53:38,894 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:38,894 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:38,895 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -928157883, now seen corresponding path program 1 times [2019-12-07 12:53:38,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:38,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240210392] [2019-12-07 12:53:38,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:38,925 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 12:53:38,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240210392] [2019-12-07 12:53:38,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:38,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:38,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382165882] [2019-12-07 12:53:38,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:38,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:38,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:38,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:38,926 INFO L87 Difference]: Start difference. First operand 173 states and 263 transitions. Second operand 4 states. [2019-12-07 12:53:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:39,170 INFO L93 Difference]: Finished difference Result 344 states and 527 transitions. [2019-12-07 12:53:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:39,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 12:53:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:39,171 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:53:39,171 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 12:53:39,172 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 12:53:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 12:53:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-12-07 12:53:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 262 transitions. [2019-12-07 12:53:39,185 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 262 transitions. Word has length 73 [2019-12-07 12:53:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:39,185 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 262 transitions. [2019-12-07 12:53:39,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 262 transitions. [2019-12-07 12:53:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 12:53:39,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:39,186 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:39,186 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 207708412, now seen corresponding path program 1 times [2019-12-07 12:53:39,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:39,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358642791] [2019-12-07 12:53:39,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:39,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:39,222 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 12:53:39,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358642791] [2019-12-07 12:53:39,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:39,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:39,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424175889] [2019-12-07 12:53:39,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:39,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:39,224 INFO L87 Difference]: Start difference. First operand 173 states and 262 transitions. Second operand 4 states. [2019-12-07 12:53:39,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:39,485 INFO L93 Difference]: Finished difference Result 344 states and 525 transitions. [2019-12-07 12:53:39,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:39,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 12:53:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:39,486 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:53:39,486 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 12:53:39,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:39,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 12:53:39,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-12-07 12:53:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 261 transitions. [2019-12-07 12:53:39,490 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 261 transitions. Word has length 73 [2019-12-07 12:53:39,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:39,490 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 261 transitions. [2019-12-07 12:53:39,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 261 transitions. [2019-12-07 12:53:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 12:53:39,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:39,491 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:39,491 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:39,491 INFO L82 PathProgramCache]: Analyzing trace with hash 356483637, now seen corresponding path program 1 times [2019-12-07 12:53:39,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:39,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271055166] [2019-12-07 12:53:39,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:39,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:39,516 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 12:53:39,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271055166] [2019-12-07 12:53:39,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:39,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:39,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612028450] [2019-12-07 12:53:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:39,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:39,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:39,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:39,518 INFO L87 Difference]: Start difference. First operand 173 states and 261 transitions. Second operand 4 states. [2019-12-07 12:53:39,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:39,742 INFO L93 Difference]: Finished difference Result 344 states and 523 transitions. [2019-12-07 12:53:39,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:39,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 12:53:39,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:39,743 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:53:39,743 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 12:53:39,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 12:53:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-12-07 12:53:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:39,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 260 transitions. [2019-12-07 12:53:39,747 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 260 transitions. Word has length 74 [2019-12-07 12:53:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:39,747 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 260 transitions. [2019-12-07 12:53:39,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 260 transitions. [2019-12-07 12:53:39,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 12:53:39,747 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:39,747 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:39,747 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:39,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:39,748 INFO L82 PathProgramCache]: Analyzing trace with hash -948220873, now seen corresponding path program 1 times [2019-12-07 12:53:39,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:39,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416141260] [2019-12-07 12:53:39,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:39,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:39,778 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 12:53:39,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416141260] [2019-12-07 12:53:39,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:39,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:39,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153140494] [2019-12-07 12:53:39,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:39,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:39,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:39,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:39,780 INFO L87 Difference]: Start difference. First operand 173 states and 260 transitions. Second operand 4 states. [2019-12-07 12:53:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:39,982 INFO L93 Difference]: Finished difference Result 344 states and 521 transitions. [2019-12-07 12:53:39,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:39,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 12:53:39,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:39,983 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:53:39,983 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 12:53:39,984 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 12:53:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 12:53:39,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 173. [2019-12-07 12:53:39,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2019-12-07 12:53:39,986 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 75 [2019-12-07 12:53:39,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:39,987 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2019-12-07 12:53:39,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:39,987 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2019-12-07 12:53:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 12:53:39,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:39,987 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:39,987 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:39,988 INFO L82 PathProgramCache]: Analyzing trace with hash -66156912, now seen corresponding path program 1 times [2019-12-07 12:53:39,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:39,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302004579] [2019-12-07 12:53:39,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:40,014 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 12:53:40,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302004579] [2019-12-07 12:53:40,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:40,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:40,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511542217] [2019-12-07 12:53:40,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:40,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:40,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:40,016 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand 4 states. [2019-12-07 12:53:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:40,195 INFO L93 Difference]: Finished difference Result 334 states and 506 transitions. [2019-12-07 12:53:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:40,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 12:53:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:40,196 INFO L225 Difference]: With dead ends: 334 [2019-12-07 12:53:40,196 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 12:53:40,197 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 12:53:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 12:53:40,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2019-12-07 12:53:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-12-07 12:53:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 258 transitions. [2019-12-07 12:53:40,200 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 258 transitions. Word has length 76 [2019-12-07 12:53:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:40,200 INFO L462 AbstractCegarLoop]: Abstraction has 173 states and 258 transitions. [2019-12-07 12:53:40,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:40,200 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 258 transitions. [2019-12-07 12:53:40,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 12:53:40,200 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:40,201 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 12:53:40,201 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:40,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:40,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1806658122, now seen corresponding path program 1 times [2019-12-07 12:53:40,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:40,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099448573] [2019-12-07 12:53:40,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:40,252 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 12:53:40,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099448573] [2019-12-07 12:53:40,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:40,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:40,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809658115] [2019-12-07 12:53:40,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:40,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:40,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:40,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:40,253 INFO L87 Difference]: Start difference. First operand 173 states and 258 transitions. Second operand 4 states. [2019-12-07 12:53:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:40,548 INFO L93 Difference]: Finished difference Result 438 states and 667 transitions. [2019-12-07 12:53:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:40,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 12:53:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:40,550 INFO L225 Difference]: With dead ends: 438 [2019-12-07 12:53:40,550 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 12:53:40,550 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 12:53:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 12:53:40,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2019-12-07 12:53:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-12-07 12:53:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 332 transitions. [2019-12-07 12:53:40,554 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 332 transitions. Word has length 81 [2019-12-07 12:53:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:40,554 INFO L462 AbstractCegarLoop]: Abstraction has 214 states and 332 transitions. [2019-12-07 12:53:40,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 332 transitions. [2019-12-07 12:53:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 12:53:40,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:40,555 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 12:53:40,555 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:40,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:40,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1116501876, now seen corresponding path program 1 times [2019-12-07 12:53:40,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:40,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905849046] [2019-12-07 12:53:40,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:40,601 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 12:53:40,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905849046] [2019-12-07 12:53:40,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:40,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:40,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662315570] [2019-12-07 12:53:40,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:40,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:40,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:40,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:40,603 INFO L87 Difference]: Start difference. First operand 214 states and 332 transitions. Second operand 4 states. [2019-12-07 12:53:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:40,852 INFO L93 Difference]: Finished difference Result 459 states and 719 transitions. [2019-12-07 12:53:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:40,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 12:53:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:40,854 INFO L225 Difference]: With dead ends: 459 [2019-12-07 12:53:40,854 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 12:53:40,854 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 12:53:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 12:53:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 238. [2019-12-07 12:53:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-12-07 12:53:40,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2019-12-07 12:53:40,859 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 81 [2019-12-07 12:53:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:40,859 INFO L462 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2019-12-07 12:53:40,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2019-12-07 12:53:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 12:53:40,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:40,860 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:40,860 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash -413023236, now seen corresponding path program 1 times [2019-12-07 12:53:40,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:40,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314987865] [2019-12-07 12:53:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:40,909 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 12:53:40,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314987865] [2019-12-07 12:53:40,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:40,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:40,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672070973] [2019-12-07 12:53:40,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:40,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:40,911 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand 4 states. [2019-12-07 12:53:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:41,239 INFO L93 Difference]: Finished difference Result 520 states and 815 transitions. [2019-12-07 12:53:41,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:41,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 12:53:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:41,242 INFO L225 Difference]: With dead ends: 520 [2019-12-07 12:53:41,242 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 12:53:41,243 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 12:53:41,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 12:53:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2019-12-07 12:53:41,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 375 transitions. [2019-12-07 12:53:41,253 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 375 transitions. Word has length 82 [2019-12-07 12:53:41,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:41,253 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 375 transitions. [2019-12-07 12:53:41,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:41,254 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 375 transitions. [2019-12-07 12:53:41,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:53:41,255 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:41,255 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:41,255 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:41,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:41,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1433746002, now seen corresponding path program 1 times [2019-12-07 12:53:41,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:41,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220371051] [2019-12-07 12:53:41,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:41,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:41,302 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 12:53:41,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220371051] [2019-12-07 12:53:41,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:41,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:41,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011542129] [2019-12-07 12:53:41,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:41,304 INFO L87 Difference]: Start difference. First operand 239 states and 375 transitions. Second operand 4 states. [2019-12-07 12:53:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:41,602 INFO L93 Difference]: Finished difference Result 521 states and 815 transitions. [2019-12-07 12:53:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:41,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 12:53:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:41,604 INFO L225 Difference]: With dead ends: 521 [2019-12-07 12:53:41,604 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 12:53:41,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 12:53:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2019-12-07 12:53:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 374 transitions. [2019-12-07 12:53:41,609 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 374 transitions. Word has length 94 [2019-12-07 12:53:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:41,609 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 374 transitions. [2019-12-07 12:53:41,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:41,610 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 374 transitions. [2019-12-07 12:53:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 12:53:41,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:41,610 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:41,611 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:41,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:41,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1877646676, now seen corresponding path program 1 times [2019-12-07 12:53:41,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:41,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703104133] [2019-12-07 12:53:41,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:41,651 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 12:53:41,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703104133] [2019-12-07 12:53:41,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:41,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:41,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965578142] [2019-12-07 12:53:41,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:41,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:41,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:41,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:41,652 INFO L87 Difference]: Start difference. First operand 239 states and 374 transitions. Second operand 4 states. [2019-12-07 12:53:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:41,907 INFO L93 Difference]: Finished difference Result 485 states and 760 transitions. [2019-12-07 12:53:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:41,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 12:53:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:41,909 INFO L225 Difference]: With dead ends: 485 [2019-12-07 12:53:41,909 INFO L226 Difference]: Without dead ends: 265 [2019-12-07 12:53:41,909 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 12:53:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-12-07 12:53:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2019-12-07 12:53:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 373 transitions. [2019-12-07 12:53:41,913 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 373 transitions. Word has length 94 [2019-12-07 12:53:41,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:41,913 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 373 transitions. [2019-12-07 12:53:41,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:41,913 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 373 transitions. [2019-12-07 12:53:41,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:41,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:41,914 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:41,914 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:41,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:41,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1246404060, now seen corresponding path program 1 times [2019-12-07 12:53:41,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:41,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102966361] [2019-12-07 12:53:41,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:41,946 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 12:53:41,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102966361] [2019-12-07 12:53:41,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:41,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:41,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867458773] [2019-12-07 12:53:41,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:41,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:41,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:41,947 INFO L87 Difference]: Start difference. First operand 239 states and 373 transitions. Second operand 4 states. [2019-12-07 12:53:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:42,238 INFO L93 Difference]: Finished difference Result 520 states and 810 transitions. [2019-12-07 12:53:42,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:42,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 12:53:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:42,240 INFO L225 Difference]: With dead ends: 520 [2019-12-07 12:53:42,240 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 12:53:42,241 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 12:53:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 12:53:42,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 239. [2019-12-07 12:53:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 372 transitions. [2019-12-07 12:53:42,246 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 372 transitions. Word has length 95 [2019-12-07 12:53:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:42,246 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 372 transitions. [2019-12-07 12:53:42,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 372 transitions. [2019-12-07 12:53:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:42,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:42,247 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:42,247 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:42,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash 383880273, now seen corresponding path program 1 times [2019-12-07 12:53:42,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:42,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58170375] [2019-12-07 12:53:42,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:42,280 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 12:53:42,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58170375] [2019-12-07 12:53:42,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:42,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:42,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665516848] [2019-12-07 12:53:42,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:42,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:42,282 INFO L87 Difference]: Start difference. First operand 239 states and 372 transitions. Second operand 4 states. [2019-12-07 12:53:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:42,568 INFO L93 Difference]: Finished difference Result 518 states and 806 transitions. [2019-12-07 12:53:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:42,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 12:53:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:42,570 INFO L225 Difference]: With dead ends: 518 [2019-12-07 12:53:42,570 INFO L226 Difference]: Without dead ends: 298 [2019-12-07 12:53:42,571 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 12:53:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2019-12-07 12:53:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 239. [2019-12-07 12:53:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 371 transitions. [2019-12-07 12:53:42,575 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 371 transitions. Word has length 95 [2019-12-07 12:53:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:42,575 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 371 transitions. [2019-12-07 12:53:42,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:42,576 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 371 transitions. [2019-12-07 12:53:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:42,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:42,576 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:42,576 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:42,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:42,577 INFO L82 PathProgramCache]: Analyzing trace with hash -936973039, now seen corresponding path program 1 times [2019-12-07 12:53:42,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:42,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725158082] [2019-12-07 12:53:42,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:42,616 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 12:53:42,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725158082] [2019-12-07 12:53:42,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:42,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:42,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977535044] [2019-12-07 12:53:42,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:42,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:42,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:42,617 INFO L87 Difference]: Start difference. First operand 239 states and 371 transitions. Second operand 4 states. [2019-12-07 12:53:42,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:42,904 INFO L93 Difference]: Finished difference Result 517 states and 803 transitions. [2019-12-07 12:53:42,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:42,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 12:53:42,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:42,906 INFO L225 Difference]: With dead ends: 517 [2019-12-07 12:53:42,906 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 12:53:42,907 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 12:53:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 12:53:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 239. [2019-12-07 12:53:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-12-07 12:53:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2019-12-07 12:53:42,911 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 95 [2019-12-07 12:53:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:42,911 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2019-12-07 12:53:42,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2019-12-07 12:53:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:42,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:42,912 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:42,912 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:42,912 INFO L82 PathProgramCache]: Analyzing trace with hash 198893256, now seen corresponding path program 1 times [2019-12-07 12:53:42,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:42,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070442931] [2019-12-07 12:53:42,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:42,961 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 12:53:42,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070442931] [2019-12-07 12:53:42,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:42,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:53:42,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292044750] [2019-12-07 12:53:42,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:53:42,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:42,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:53:42,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:42,962 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand 5 states. [2019-12-07 12:53:43,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:43,276 INFO L93 Difference]: Finished difference Result 480 states and 748 transitions. [2019-12-07 12:53:43,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:53:43,277 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-07 12:53:43,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:43,278 INFO L225 Difference]: With dead ends: 480 [2019-12-07 12:53:43,278 INFO L226 Difference]: Without dead ends: 260 [2019-12-07 12:53:43,278 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 12:53:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-12-07 12:53:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-12-07 12:53:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:43,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 396 transitions. [2019-12-07 12:53:43,283 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 396 transitions. Word has length 95 [2019-12-07 12:53:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:43,283 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 396 transitions. [2019-12-07 12:53:43,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:53:43,283 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 396 transitions. [2019-12-07 12:53:43,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:43,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:43,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:43,284 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:43,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:43,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1259899279, now seen corresponding path program 1 times [2019-12-07 12:53:43,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:43,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268158] [2019-12-07 12:53:43,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:43,316 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 12:53:43,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268158] [2019-12-07 12:53:43,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:43,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:43,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888896389] [2019-12-07 12:53:43,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:43,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:43,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:43,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:43,317 INFO L87 Difference]: Start difference. First operand 259 states and 396 transitions. Second operand 4 states. [2019-12-07 12:53:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:43,534 INFO L93 Difference]: Finished difference Result 522 states and 800 transitions. [2019-12-07 12:53:43,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:43,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 12:53:43,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:43,535 INFO L225 Difference]: With dead ends: 522 [2019-12-07 12:53:43,535 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 12:53:43,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:43,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 12:53:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 259. [2019-12-07 12:53:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:43,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 395 transitions. [2019-12-07 12:53:43,540 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 395 transitions. Word has length 95 [2019-12-07 12:53:43,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:43,540 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 395 transitions. [2019-12-07 12:53:43,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:43,540 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 395 transitions. [2019-12-07 12:53:43,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 12:53:43,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:43,541 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:43,541 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash -60954033, now seen corresponding path program 1 times [2019-12-07 12:53:43,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:43,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354126596] [2019-12-07 12:53:43,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:43,576 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 12:53:43,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354126596] [2019-12-07 12:53:43,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:43,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:43,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45178995] [2019-12-07 12:53:43,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:43,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:43,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:43,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:43,577 INFO L87 Difference]: Start difference. First operand 259 states and 395 transitions. Second operand 4 states. [2019-12-07 12:53:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:43,806 INFO L93 Difference]: Finished difference Result 521 states and 797 transitions. [2019-12-07 12:53:43,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:43,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 12:53:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:43,807 INFO L225 Difference]: With dead ends: 521 [2019-12-07 12:53:43,807 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:53:43,808 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 12:53:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:53:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-12-07 12:53:43,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 394 transitions. [2019-12-07 12:53:43,814 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 394 transitions. Word has length 95 [2019-12-07 12:53:43,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:43,814 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 394 transitions. [2019-12-07 12:53:43,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:43,814 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 394 transitions. [2019-12-07 12:53:43,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 12:53:43,815 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:43,815 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:43,815 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:43,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1696535082, now seen corresponding path program 1 times [2019-12-07 12:53:43,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:43,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530941081] [2019-12-07 12:53:43,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:43,860 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 12:53:43,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530941081] [2019-12-07 12:53:43,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:43,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:43,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83167896] [2019-12-07 12:53:43,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:43,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:43,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:43,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:43,862 INFO L87 Difference]: Start difference. First operand 259 states and 394 transitions. Second operand 4 states. [2019-12-07 12:53:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:44,124 INFO L93 Difference]: Finished difference Result 557 states and 848 transitions. [2019-12-07 12:53:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:44,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 12:53:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:44,126 INFO L225 Difference]: With dead ends: 557 [2019-12-07 12:53:44,126 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 12:53:44,126 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 12:53:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 12:53:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-12-07 12:53:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 393 transitions. [2019-12-07 12:53:44,132 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 393 transitions. Word has length 96 [2019-12-07 12:53:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:44,132 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 393 transitions. [2019-12-07 12:53:44,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 393 transitions. [2019-12-07 12:53:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 12:53:44,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:44,134 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:44,134 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash -309749672, now seen corresponding path program 1 times [2019-12-07 12:53:44,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:44,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890037341] [2019-12-07 12:53:44,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:44,173 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 12:53:44,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890037341] [2019-12-07 12:53:44,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:44,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:44,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229340557] [2019-12-07 12:53:44,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:44,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:44,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:44,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:44,174 INFO L87 Difference]: Start difference. First operand 259 states and 393 transitions. Second operand 4 states. [2019-12-07 12:53:44,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:44,418 INFO L93 Difference]: Finished difference Result 521 states and 793 transitions. [2019-12-07 12:53:44,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:44,419 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 12:53:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:44,420 INFO L225 Difference]: With dead ends: 521 [2019-12-07 12:53:44,420 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:53:44,420 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 12:53:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:53:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-12-07 12:53:44,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 392 transitions. [2019-12-07 12:53:44,424 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 392 transitions. Word has length 96 [2019-12-07 12:53:44,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:44,424 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 392 transitions. [2019-12-07 12:53:44,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 392 transitions. [2019-12-07 12:53:44,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:53:44,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:44,425 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:44,425 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:44,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:44,425 INFO L82 PathProgramCache]: Analyzing trace with hash -987630891, now seen corresponding path program 1 times [2019-12-07 12:53:44,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:44,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360521343] [2019-12-07 12:53:44,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:44,455 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 12:53:44,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360521343] [2019-12-07 12:53:44,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:44,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:44,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509072309] [2019-12-07 12:53:44,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:44,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:44,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:44,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:44,456 INFO L87 Difference]: Start difference. First operand 259 states and 392 transitions. Second operand 4 states. [2019-12-07 12:53:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:44,702 INFO L93 Difference]: Finished difference Result 557 states and 844 transitions. [2019-12-07 12:53:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:44,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 12:53:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:44,704 INFO L225 Difference]: With dead ends: 557 [2019-12-07 12:53:44,704 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 12:53:44,704 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 12:53:44,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 12:53:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-12-07 12:53:44,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 391 transitions. [2019-12-07 12:53:44,708 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 391 transitions. Word has length 97 [2019-12-07 12:53:44,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:44,709 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 391 transitions. [2019-12-07 12:53:44,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:44,709 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 391 transitions. [2019-12-07 12:53:44,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 12:53:44,709 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:44,709 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:44,709 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:44,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:44,710 INFO L82 PathProgramCache]: Analyzing trace with hash -946956141, now seen corresponding path program 1 times [2019-12-07 12:53:44,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:44,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142851950] [2019-12-07 12:53:44,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:44,740 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 12:53:44,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142851950] [2019-12-07 12:53:44,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:44,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:44,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565236986] [2019-12-07 12:53:44,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:44,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:44,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:44,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:44,741 INFO L87 Difference]: Start difference. First operand 259 states and 391 transitions. Second operand 4 states. [2019-12-07 12:53:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:44,955 INFO L93 Difference]: Finished difference Result 521 states and 789 transitions. [2019-12-07 12:53:44,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:44,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 12:53:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:44,956 INFO L225 Difference]: With dead ends: 521 [2019-12-07 12:53:44,957 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:53:44,957 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 12:53:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:53:44,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-12-07 12:53:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:44,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 390 transitions. [2019-12-07 12:53:44,961 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 390 transitions. Word has length 97 [2019-12-07 12:53:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:44,961 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 390 transitions. [2019-12-07 12:53:44,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 390 transitions. [2019-12-07 12:53:44,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:53:44,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:44,962 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:44,962 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:44,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:44,962 INFO L82 PathProgramCache]: Analyzing trace with hash 778325243, now seen corresponding path program 1 times [2019-12-07 12:53:44,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:44,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507381217] [2019-12-07 12:53:44,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:44,995 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 12:53:44,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507381217] [2019-12-07 12:53:44,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:44,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:44,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735645823] [2019-12-07 12:53:44,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:44,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:44,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:44,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:44,997 INFO L87 Difference]: Start difference. First operand 259 states and 390 transitions. Second operand 4 states. [2019-12-07 12:53:45,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:45,306 INFO L93 Difference]: Finished difference Result 557 states and 840 transitions. [2019-12-07 12:53:45,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:45,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:53:45,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:45,310 INFO L225 Difference]: With dead ends: 557 [2019-12-07 12:53:45,310 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 12:53:45,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 12:53:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 12:53:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 259. [2019-12-07 12:53:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 389 transitions. [2019-12-07 12:53:45,320 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 389 transitions. Word has length 98 [2019-12-07 12:53:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:45,320 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 389 transitions. [2019-12-07 12:53:45,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:45,320 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 389 transitions. [2019-12-07 12:53:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:53:45,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:45,322 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:45,322 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:45,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:45,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2039242493, now seen corresponding path program 1 times [2019-12-07 12:53:45,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:45,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452024439] [2019-12-07 12:53:45,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:45,361 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 12:53:45,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452024439] [2019-12-07 12:53:45,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:45,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:45,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71550383] [2019-12-07 12:53:45,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:45,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:45,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:45,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:45,362 INFO L87 Difference]: Start difference. First operand 259 states and 389 transitions. Second operand 4 states. [2019-12-07 12:53:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:45,605 INFO L93 Difference]: Finished difference Result 521 states and 785 transitions. [2019-12-07 12:53:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:45,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 12:53:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:45,607 INFO L225 Difference]: With dead ends: 521 [2019-12-07 12:53:45,607 INFO L226 Difference]: Without dead ends: 281 [2019-12-07 12:53:45,608 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 12:53:45,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-12-07 12:53:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 259. [2019-12-07 12:53:45,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 388 transitions. [2019-12-07 12:53:45,612 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 388 transitions. Word has length 98 [2019-12-07 12:53:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:45,612 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 388 transitions. [2019-12-07 12:53:45,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 388 transitions. [2019-12-07 12:53:45,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:53:45,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:45,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:45,613 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:45,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash 953153242, now seen corresponding path program 1 times [2019-12-07 12:53:45,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:45,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916185972] [2019-12-07 12:53:45,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:45,653 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 12:53:45,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916185972] [2019-12-07 12:53:45,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:45,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:45,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465178779] [2019-12-07 12:53:45,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:45,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:45,654 INFO L87 Difference]: Start difference. First operand 259 states and 388 transitions. Second operand 4 states. [2019-12-07 12:53:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:45,898 INFO L93 Difference]: Finished difference Result 547 states and 824 transitions. [2019-12-07 12:53:45,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:45,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 12:53:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:45,900 INFO L225 Difference]: With dead ends: 547 [2019-12-07 12:53:45,900 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 12:53:45,900 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 12:53:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 12:53:45,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2019-12-07 12:53:45,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 387 transitions. [2019-12-07 12:53:45,905 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 387 transitions. Word has length 99 [2019-12-07 12:53:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:45,905 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 387 transitions. [2019-12-07 12:53:45,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 387 transitions. [2019-12-07 12:53:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:53:45,905 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:45,906 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:45,906 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1386882328, now seen corresponding path program 1 times [2019-12-07 12:53:45,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:45,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131478925] [2019-12-07 12:53:45,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:45,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:45,937 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 12:53:45,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131478925] [2019-12-07 12:53:45,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:45,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:45,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600046574] [2019-12-07 12:53:45,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:45,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:45,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:45,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:45,938 INFO L87 Difference]: Start difference. First operand 259 states and 387 transitions. Second operand 4 states. [2019-12-07 12:53:46,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:46,232 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-12-07 12:53:46,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:46,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 12:53:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:46,236 INFO L225 Difference]: With dead ends: 511 [2019-12-07 12:53:46,236 INFO L226 Difference]: Without dead ends: 271 [2019-12-07 12:53:46,237 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 12:53:46,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-07 12:53:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 259. [2019-12-07 12:53:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:46,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 386 transitions. [2019-12-07 12:53:46,247 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 386 transitions. Word has length 99 [2019-12-07 12:53:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:46,248 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 386 transitions. [2019-12-07 12:53:46,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:46,248 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 386 transitions. [2019-12-07 12:53:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 12:53:46,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:46,250 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] [2019-12-07 12:53:46,250 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1409187564, now seen corresponding path program 1 times [2019-12-07 12:53:46,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:46,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648805238] [2019-12-07 12:53:46,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:46,314 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 12:53:46,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648805238] [2019-12-07 12:53:46,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:46,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:46,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436353621] [2019-12-07 12:53:46,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:46,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:46,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:46,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:46,315 INFO L87 Difference]: Start difference. First operand 259 states and 386 transitions. Second operand 4 states. [2019-12-07 12:53:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:46,632 INFO L93 Difference]: Finished difference Result 547 states and 820 transitions. [2019-12-07 12:53:46,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:46,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 12:53:46,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:46,634 INFO L225 Difference]: With dead ends: 547 [2019-12-07 12:53:46,634 INFO L226 Difference]: Without dead ends: 307 [2019-12-07 12:53:46,634 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 12:53:46,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-12-07 12:53:46,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 259. [2019-12-07 12:53:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-12-07 12:53:46,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 385 transitions. [2019-12-07 12:53:46,639 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 385 transitions. Word has length 103 [2019-12-07 12:53:46,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:46,639 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 385 transitions. [2019-12-07 12:53:46,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:46,639 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 385 transitions. [2019-12-07 12:53:46,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-07 12:53:46,639 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:46,639 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] [2019-12-07 12:53:46,640 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:46,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:46,640 INFO L82 PathProgramCache]: Analyzing trace with hash -729915310, now seen corresponding path program 1 times [2019-12-07 12:53:46,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:46,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727730312] [2019-12-07 12:53:46,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:46,675 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 12:53:46,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727730312] [2019-12-07 12:53:46,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:46,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:46,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524148209] [2019-12-07 12:53:46,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:46,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:46,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:46,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:46,676 INFO L87 Difference]: Start difference. First operand 259 states and 385 transitions. Second operand 4 states. [2019-12-07 12:53:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:46,932 INFO L93 Difference]: Finished difference Result 552 states and 829 transitions. [2019-12-07 12:53:46,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:46,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-12-07 12:53:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:46,933 INFO L225 Difference]: With dead ends: 552 [2019-12-07 12:53:46,933 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 12:53:46,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:53:46,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 12:53:46,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-12-07 12:53:46,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 430 transitions. [2019-12-07 12:53:46,938 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 430 transitions. Word has length 103 [2019-12-07 12:53:46,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:46,938 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 430 transitions. [2019-12-07 12:53:46,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:46,938 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 430 transitions. [2019-12-07 12:53:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 12:53:46,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:46,939 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] [2019-12-07 12:53:46,939 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1317661803, now seen corresponding path program 1 times [2019-12-07 12:53:46,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:46,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680366655] [2019-12-07 12:53:46,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:46,977 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 12:53:46,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680366655] [2019-12-07 12:53:46,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:46,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:46,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396575417] [2019-12-07 12:53:46,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:46,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:46,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:46,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:46,978 INFO L87 Difference]: Start difference. First operand 285 states and 430 transitions. Second operand 4 states. [2019-12-07 12:53:47,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:47,233 INFO L93 Difference]: Finished difference Result 599 states and 908 transitions. [2019-12-07 12:53:47,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:47,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 12:53:47,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:47,235 INFO L225 Difference]: With dead ends: 599 [2019-12-07 12:53:47,235 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 12:53:47,236 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 12:53:47,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 12:53:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 285. [2019-12-07 12:53:47,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 429 transitions. [2019-12-07 12:53:47,240 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 429 transitions. Word has length 106 [2019-12-07 12:53:47,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:47,240 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 429 transitions. [2019-12-07 12:53:47,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:47,240 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 429 transitions. [2019-12-07 12:53:47,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 12:53:47,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:47,241 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:47,241 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:47,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:47,241 INFO L82 PathProgramCache]: Analyzing trace with hash -449262892, now seen corresponding path program 1 times [2019-12-07 12:53:47,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:47,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178496092] [2019-12-07 12:53:47,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:47,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178496092] [2019-12-07 12:53:47,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:47,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:47,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934981328] [2019-12-07 12:53:47,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:47,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:47,280 INFO L87 Difference]: Start difference. First operand 285 states and 429 transitions. Second operand 4 states. [2019-12-07 12:53:47,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:47,533 INFO L93 Difference]: Finished difference Result 591 states and 893 transitions. [2019-12-07 12:53:47,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:47,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 12:53:47,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:47,535 INFO L225 Difference]: With dead ends: 591 [2019-12-07 12:53:47,535 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 12:53:47,535 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 12:53:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 12:53:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-12-07 12:53:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 428 transitions. [2019-12-07 12:53:47,540 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 428 transitions. Word has length 107 [2019-12-07 12:53:47,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:47,540 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 428 transitions. [2019-12-07 12:53:47,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:47,540 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 428 transitions. [2019-12-07 12:53:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 12:53:47,541 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:47,541 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:47,541 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:47,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2126978123, now seen corresponding path program 1 times [2019-12-07 12:53:47,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:47,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129381189] [2019-12-07 12:53:47,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:47,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129381189] [2019-12-07 12:53:47,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:47,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:47,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343595561] [2019-12-07 12:53:47,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:47,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:47,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:47,580 INFO L87 Difference]: Start difference. First operand 285 states and 428 transitions. Second operand 4 states. [2019-12-07 12:53:47,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:47,819 INFO L93 Difference]: Finished difference Result 591 states and 891 transitions. [2019-12-07 12:53:47,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:47,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 12:53:47,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:47,821 INFO L225 Difference]: With dead ends: 591 [2019-12-07 12:53:47,821 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 12:53:47,821 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 12:53:47,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 12:53:47,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-12-07 12:53:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2019-12-07 12:53:47,825 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 108 [2019-12-07 12:53:47,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:47,826 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2019-12-07 12:53:47,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:47,826 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2019-12-07 12:53:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 12:53:47,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:47,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:47,826 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:47,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1091839583, now seen corresponding path program 1 times [2019-12-07 12:53:47,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:47,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320883213] [2019-12-07 12:53:47,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:47,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320883213] [2019-12-07 12:53:47,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:47,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:47,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893293875] [2019-12-07 12:53:47,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:47,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:47,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:47,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:47,871 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand 4 states. [2019-12-07 12:53:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:48,125 INFO L93 Difference]: Finished difference Result 591 states and 889 transitions. [2019-12-07 12:53:48,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:48,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 12:53:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:48,126 INFO L225 Difference]: With dead ends: 591 [2019-12-07 12:53:48,126 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 12:53:48,127 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 12:53:48,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 12:53:48,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-12-07 12:53:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:48,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 426 transitions. [2019-12-07 12:53:48,132 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 426 transitions. Word has length 109 [2019-12-07 12:53:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:48,132 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 426 transitions. [2019-12-07 12:53:48,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:48,132 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 426 transitions. [2019-12-07 12:53:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 12:53:48,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:48,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:48,133 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1287280684, now seen corresponding path program 1 times [2019-12-07 12:53:48,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:48,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530809862] [2019-12-07 12:53:48,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:48,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530809862] [2019-12-07 12:53:48,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:48,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:48,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622291979] [2019-12-07 12:53:48,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:48,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:48,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:48,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:48,192 INFO L87 Difference]: Start difference. First operand 285 states and 426 transitions. Second operand 4 states. [2019-12-07 12:53:48,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:48,429 INFO L93 Difference]: Finished difference Result 589 states and 885 transitions. [2019-12-07 12:53:48,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:48,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 12:53:48,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:48,431 INFO L225 Difference]: With dead ends: 589 [2019-12-07 12:53:48,431 INFO L226 Difference]: Without dead ends: 323 [2019-12-07 12:53:48,431 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 12:53:48,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-12-07 12:53:48,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 285. [2019-12-07 12:53:48,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:48,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 425 transitions. [2019-12-07 12:53:48,436 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 425 transitions. Word has length 109 [2019-12-07 12:53:48,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:48,436 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 425 transitions. [2019-12-07 12:53:48,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:48,436 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 425 transitions. [2019-12-07 12:53:48,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 12:53:48,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:48,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:48,437 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:48,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:48,437 INFO L82 PathProgramCache]: Analyzing trace with hash -576923808, now seen corresponding path program 1 times [2019-12-07 12:53:48,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:48,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092541498] [2019-12-07 12:53:48,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:48,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:48,474 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:48,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092541498] [2019-12-07 12:53:48,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:48,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:48,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693929673] [2019-12-07 12:53:48,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:48,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:48,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:48,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:48,475 INFO L87 Difference]: Start difference. First operand 285 states and 425 transitions. Second operand 4 states. [2019-12-07 12:53:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:48,709 INFO L93 Difference]: Finished difference Result 587 states and 880 transitions. [2019-12-07 12:53:48,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:48,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 12:53:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:48,710 INFO L225 Difference]: With dead ends: 587 [2019-12-07 12:53:48,711 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 12:53:48,711 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 12:53:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 12:53:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 285. [2019-12-07 12:53:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:48,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 424 transitions. [2019-12-07 12:53:48,715 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 424 transitions. Word has length 110 [2019-12-07 12:53:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:48,716 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 424 transitions. [2019-12-07 12:53:48,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:48,716 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 424 transitions. [2019-12-07 12:53:48,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 12:53:48,716 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:48,716 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:48,716 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:48,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:48,717 INFO L82 PathProgramCache]: Analyzing trace with hash 685628119, now seen corresponding path program 1 times [2019-12-07 12:53:48,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:48,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940225855] [2019-12-07 12:53:48,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:48,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940225855] [2019-12-07 12:53:48,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:48,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:48,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919879569] [2019-12-07 12:53:48,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:48,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:48,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:48,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:48,755 INFO L87 Difference]: Start difference. First operand 285 states and 424 transitions. Second operand 4 states. [2019-12-07 12:53:48,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:48,981 INFO L93 Difference]: Finished difference Result 584 states and 874 transitions. [2019-12-07 12:53:48,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:48,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 12:53:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:48,982 INFO L225 Difference]: With dead ends: 584 [2019-12-07 12:53:48,983 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 12:53:48,983 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 12:53:48,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 12:53:48,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2019-12-07 12:53:48,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:48,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 423 transitions. [2019-12-07 12:53:48,988 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 423 transitions. Word has length 110 [2019-12-07 12:53:48,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:48,988 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 423 transitions. [2019-12-07 12:53:48,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:48,988 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 423 transitions. [2019-12-07 12:53:48,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 12:53:48,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:48,989 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:48,989 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:48,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:48,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1612775450, now seen corresponding path program 1 times [2019-12-07 12:53:48,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:48,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512130562] [2019-12-07 12:53:48,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:49,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512130562] [2019-12-07 12:53:49,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:49,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:49,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636784880] [2019-12-07 12:53:49,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:49,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:49,029 INFO L87 Difference]: Start difference. First operand 285 states and 423 transitions. Second operand 4 states. [2019-12-07 12:53:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:49,262 INFO L93 Difference]: Finished difference Result 584 states and 872 transitions. [2019-12-07 12:53:49,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:49,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 12:53:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:49,264 INFO L225 Difference]: With dead ends: 584 [2019-12-07 12:53:49,264 INFO L226 Difference]: Without dead ends: 318 [2019-12-07 12:53:49,264 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 12:53:49,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-12-07 12:53:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 285. [2019-12-07 12:53:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 422 transitions. [2019-12-07 12:53:49,269 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 422 transitions. Word has length 113 [2019-12-07 12:53:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:49,269 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 422 transitions. [2019-12-07 12:53:49,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:49,269 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 422 transitions. [2019-12-07 12:53:49,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 12:53:49,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:49,269 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:49,270 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:49,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1906443136, now seen corresponding path program 1 times [2019-12-07 12:53:49,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:49,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520831257] [2019-12-07 12:53:49,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:49,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520831257] [2019-12-07 12:53:49,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:49,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:49,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932622945] [2019-12-07 12:53:49,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:49,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:49,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:49,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:49,314 INFO L87 Difference]: Start difference. First operand 285 states and 422 transitions. Second operand 4 states. [2019-12-07 12:53:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:49,540 INFO L93 Difference]: Finished difference Result 578 states and 861 transitions. [2019-12-07 12:53:49,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:49,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 12:53:49,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:49,542 INFO L225 Difference]: With dead ends: 578 [2019-12-07 12:53:49,542 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 12:53:49,542 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 12:53:49,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 12:53:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-12-07 12:53:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 421 transitions. [2019-12-07 12:53:49,547 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 421 transitions. Word has length 114 [2019-12-07 12:53:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:49,547 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 421 transitions. [2019-12-07 12:53:49,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 421 transitions. [2019-12-07 12:53:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 12:53:49,548 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:49,548 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, 1, 1, 1, 1, 1, 1, 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 12:53:49,548 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:49,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1845596870, now seen corresponding path program 1 times [2019-12-07 12:53:49,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:49,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108261597] [2019-12-07 12:53:49,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:49,589 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:49,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108261597] [2019-12-07 12:53:49,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:49,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:49,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474939163] [2019-12-07 12:53:49,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:49,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:49,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:49,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:49,590 INFO L87 Difference]: Start difference. First operand 285 states and 421 transitions. Second operand 4 states. [2019-12-07 12:53:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:49,824 INFO L93 Difference]: Finished difference Result 578 states and 859 transitions. [2019-12-07 12:53:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:49,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 12:53:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:49,826 INFO L225 Difference]: With dead ends: 578 [2019-12-07 12:53:49,826 INFO L226 Difference]: Without dead ends: 312 [2019-12-07 12:53:49,826 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 12:53:49,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-12-07 12:53:49,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 285. [2019-12-07 12:53:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 420 transitions. [2019-12-07 12:53:49,831 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 420 transitions. Word has length 114 [2019-12-07 12:53:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:49,831 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 420 transitions. [2019-12-07 12:53:49,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 420 transitions. [2019-12-07 12:53:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 12:53:49,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:49,832 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, 1, 1, 1, 1, 1, 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 12:53:49,832 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:49,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1499113856, now seen corresponding path program 1 times [2019-12-07 12:53:49,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:49,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535876565] [2019-12-07 12:53:49,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:49,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535876565] [2019-12-07 12:53:49,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:49,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:49,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715113327] [2019-12-07 12:53:49,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:49,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:49,882 INFO L87 Difference]: Start difference. First operand 285 states and 420 transitions. Second operand 4 states. [2019-12-07 12:53:50,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:50,100 INFO L93 Difference]: Finished difference Result 575 states and 853 transitions. [2019-12-07 12:53:50,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:50,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 12:53:50,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:50,101 INFO L225 Difference]: With dead ends: 575 [2019-12-07 12:53:50,101 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 12:53:50,102 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 12:53:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 12:53:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2019-12-07 12:53:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 419 transitions. [2019-12-07 12:53:50,106 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 419 transitions. Word has length 115 [2019-12-07 12:53:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:50,107 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 419 transitions. [2019-12-07 12:53:50,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 419 transitions. [2019-12-07 12:53:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 12:53:50,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:50,107 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, 1, 1, 1, 1, 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 12:53:50,107 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:50,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:50,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1831341134, now seen corresponding path program 1 times [2019-12-07 12:53:50,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:50,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612376639] [2019-12-07 12:53:50,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:50,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612376639] [2019-12-07 12:53:50,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:50,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:50,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182641732] [2019-12-07 12:53:50,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:50,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:50,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:50,152 INFO L87 Difference]: Start difference. First operand 285 states and 419 transitions. Second operand 4 states. [2019-12-07 12:53:50,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:50,382 INFO L93 Difference]: Finished difference Result 575 states and 851 transitions. [2019-12-07 12:53:50,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:50,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 12:53:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:50,383 INFO L225 Difference]: With dead ends: 575 [2019-12-07 12:53:50,383 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 12:53:50,384 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 12:53:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 12:53:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2019-12-07 12:53:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-12-07 12:53:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 418 transitions. [2019-12-07 12:53:50,388 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 418 transitions. Word has length 116 [2019-12-07 12:53:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:50,389 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 418 transitions. [2019-12-07 12:53:50,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 418 transitions. [2019-12-07 12:53:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 12:53:50,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:50,389 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:50,389 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash 715558198, now seen corresponding path program 1 times [2019-12-07 12:53:50,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:50,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992727060] [2019-12-07 12:53:50,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 12:53:50,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992727060] [2019-12-07 12:53:50,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:50,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:50,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777034919] [2019-12-07 12:53:50,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:50,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:50,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:50,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:50,427 INFO L87 Difference]: Start difference. First operand 285 states and 418 transitions. Second operand 4 states. [2019-12-07 12:53:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:50,702 INFO L93 Difference]: Finished difference Result 623 states and 926 transitions. [2019-12-07 12:53:50,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:50,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 12:53:50,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:50,704 INFO L225 Difference]: With dead ends: 623 [2019-12-07 12:53:50,704 INFO L226 Difference]: Without dead ends: 357 [2019-12-07 12:53:50,705 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 12:53:50,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-12-07 12:53:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 317. [2019-12-07 12:53:50,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-07 12:53:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 475 transitions. [2019-12-07 12:53:50,709 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 475 transitions. Word has length 116 [2019-12-07 12:53:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:50,710 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 475 transitions. [2019-12-07 12:53:50,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 475 transitions. [2019-12-07 12:53:50,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:53:50,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:50,710 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, 1, 1, 1, 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 12:53:50,710 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:50,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:50,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1423246104, now seen corresponding path program 1 times [2019-12-07 12:53:50,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:50,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077682145] [2019-12-07 12:53:50,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:50,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077682145] [2019-12-07 12:53:50,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:50,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:50,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303869927] [2019-12-07 12:53:50,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:50,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:50,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:50,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:50,753 INFO L87 Difference]: Start difference. First operand 317 states and 475 transitions. Second operand 4 states. [2019-12-07 12:53:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:50,980 INFO L93 Difference]: Finished difference Result 636 states and 959 transitions. [2019-12-07 12:53:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:50,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 12:53:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:50,982 INFO L225 Difference]: With dead ends: 636 [2019-12-07 12:53:50,982 INFO L226 Difference]: Without dead ends: 338 [2019-12-07 12:53:50,982 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 12:53:50,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-12-07 12:53:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 317. [2019-12-07 12:53:50,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-07 12:53:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 474 transitions. [2019-12-07 12:53:50,989 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 474 transitions. Word has length 117 [2019-12-07 12:53:50,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:50,989 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 474 transitions. [2019-12-07 12:53:50,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 474 transitions. [2019-12-07 12:53:50,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:53:50,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:50,990 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:50,990 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:50,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:50,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1725958483, now seen corresponding path program 1 times [2019-12-07 12:53:50,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:50,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75201351] [2019-12-07 12:53:50,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:51,032 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:51,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75201351] [2019-12-07 12:53:51,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:51,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:51,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317948668] [2019-12-07 12:53:51,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:51,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:51,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:51,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:51,033 INFO L87 Difference]: Start difference. First operand 317 states and 474 transitions. Second operand 4 states. [2019-12-07 12:53:51,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:51,324 INFO L93 Difference]: Finished difference Result 723 states and 1094 transitions. [2019-12-07 12:53:51,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:51,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 12:53:51,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:51,326 INFO L225 Difference]: With dead ends: 723 [2019-12-07 12:53:51,326 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 12:53:51,327 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 12:53:51,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 12:53:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 356. [2019-12-07 12:53:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-07 12:53:51,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 545 transitions. [2019-12-07 12:53:51,332 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 545 transitions. Word has length 117 [2019-12-07 12:53:51,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:51,332 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 545 transitions. [2019-12-07 12:53:51,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:51,333 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 545 transitions. [2019-12-07 12:53:51,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 12:53:51,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:51,333 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:51,333 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:51,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:51,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2088665573, now seen corresponding path program 1 times [2019-12-07 12:53:51,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:51,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327035967] [2019-12-07 12:53:51,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:51,371 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:51,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327035967] [2019-12-07 12:53:51,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:51,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:51,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380629513] [2019-12-07 12:53:51,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:51,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:51,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:51,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:51,372 INFO L87 Difference]: Start difference. First operand 356 states and 545 transitions. Second operand 4 states. [2019-12-07 12:53:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:51,670 INFO L93 Difference]: Finished difference Result 755 states and 1155 transitions. [2019-12-07 12:53:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:51,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 12:53:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:51,673 INFO L225 Difference]: With dead ends: 755 [2019-12-07 12:53:51,673 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 12:53:51,673 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 12:53:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 12:53:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 355. [2019-12-07 12:53:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 12:53:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 544 transitions. [2019-12-07 12:53:51,679 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 544 transitions. Word has length 118 [2019-12-07 12:53:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:51,679 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 544 transitions. [2019-12-07 12:53:51,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 544 transitions. [2019-12-07 12:53:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 12:53:51,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:51,680 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:51,680 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:51,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:51,680 INFO L82 PathProgramCache]: Analyzing trace with hash -385280070, now seen corresponding path program 1 times [2019-12-07 12:53:51,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:51,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203616836] [2019-12-07 12:53:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:51,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203616836] [2019-12-07 12:53:51,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:51,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:51,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537120218] [2019-12-07 12:53:51,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:51,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:51,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:51,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:51,726 INFO L87 Difference]: Start difference. First operand 355 states and 544 transitions. Second operand 4 states. [2019-12-07 12:53:51,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:51,937 INFO L93 Difference]: Finished difference Result 718 states and 1101 transitions. [2019-12-07 12:53:51,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:51,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 12:53:51,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:51,939 INFO L225 Difference]: With dead ends: 718 [2019-12-07 12:53:51,939 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 12:53:51,939 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 12:53:51,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 12:53:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-12-07 12:53:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 12:53:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 543 transitions. [2019-12-07 12:53:51,944 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 543 transitions. Word has length 118 [2019-12-07 12:53:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:51,945 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 543 transitions. [2019-12-07 12:53:51,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 543 transitions. [2019-12-07 12:53:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 12:53:51,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:51,945 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:51,945 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:51,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:51,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1006568817, now seen corresponding path program 1 times [2019-12-07 12:53:51,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:51,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529875192] [2019-12-07 12:53:51,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:51,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529875192] [2019-12-07 12:53:51,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:51,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:51,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275951583] [2019-12-07 12:53:51,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:51,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:51,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:51,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:51,980 INFO L87 Difference]: Start difference. First operand 355 states and 543 transitions. Second operand 4 states. [2019-12-07 12:53:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:52,195 INFO L93 Difference]: Finished difference Result 718 states and 1099 transitions. [2019-12-07 12:53:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:52,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 12:53:52,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:52,197 INFO L225 Difference]: With dead ends: 718 [2019-12-07 12:53:52,197 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 12:53:52,198 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 12:53:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 12:53:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-12-07 12:53:52,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 12:53:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-12-07 12:53:52,203 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 119 [2019-12-07 12:53:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:52,203 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-12-07 12:53:52,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-12-07 12:53:52,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 12:53:52,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:52,204 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:52,204 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:52,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:52,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1825993249, now seen corresponding path program 1 times [2019-12-07 12:53:52,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:52,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863685988] [2019-12-07 12:53:52,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:52,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863685988] [2019-12-07 12:53:52,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:52,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:52,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482580030] [2019-12-07 12:53:52,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:52,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:52,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:52,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:52,238 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-12-07 12:53:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:52,454 INFO L93 Difference]: Finished difference Result 718 states and 1097 transitions. [2019-12-07 12:53:52,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:52,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 12:53:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:52,456 INFO L225 Difference]: With dead ends: 718 [2019-12-07 12:53:52,456 INFO L226 Difference]: Without dead ends: 382 [2019-12-07 12:53:52,457 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 12:53:52,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-12-07 12:53:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 355. [2019-12-07 12:53:52,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 12:53:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 541 transitions. [2019-12-07 12:53:52,462 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 541 transitions. Word has length 120 [2019-12-07 12:53:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:52,463 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 541 transitions. [2019-12-07 12:53:52,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 541 transitions. [2019-12-07 12:53:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 12:53:52,463 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:52,463 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:52,463 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:52,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1823658614, now seen corresponding path program 1 times [2019-12-07 12:53:52,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:52,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224366746] [2019-12-07 12:53:52,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:52,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224366746] [2019-12-07 12:53:52,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:52,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:52,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367178451] [2019-12-07 12:53:52,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:52,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:52,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:52,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:52,498 INFO L87 Difference]: Start difference. First operand 355 states and 541 transitions. Second operand 4 states. [2019-12-07 12:53:52,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:52,697 INFO L93 Difference]: Finished difference Result 708 states and 1083 transitions. [2019-12-07 12:53:52,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:52,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 12:53:52,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:52,698 INFO L225 Difference]: With dead ends: 708 [2019-12-07 12:53:52,698 INFO L226 Difference]: Without dead ends: 372 [2019-12-07 12:53:52,699 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 12:53:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2019-12-07 12:53:52,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 355. [2019-12-07 12:53:52,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-12-07 12:53:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 540 transitions. [2019-12-07 12:53:52,705 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 540 transitions. Word has length 121 [2019-12-07 12:53:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:52,705 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 540 transitions. [2019-12-07 12:53:52,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 540 transitions. [2019-12-07 12:53:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 12:53:52,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:52,706 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, 1] [2019-12-07 12:53:52,706 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1963622454, now seen corresponding path program 1 times [2019-12-07 12:53:52,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:52,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911130422] [2019-12-07 12:53:52,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:52,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911130422] [2019-12-07 12:53:52,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:52,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:53:52,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663563345] [2019-12-07 12:53:52,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:53:52,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:52,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:53:52,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:53:52,741 INFO L87 Difference]: Start difference. First operand 355 states and 540 transitions. Second operand 3 states. [2019-12-07 12:53:52,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:52,786 INFO L93 Difference]: Finished difference Result 1023 states and 1571 transitions. [2019-12-07 12:53:52,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:53:52,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-12-07 12:53:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:52,789 INFO L225 Difference]: With dead ends: 1023 [2019-12-07 12:53:52,789 INFO L226 Difference]: Without dead ends: 687 [2019-12-07 12:53:52,790 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 12:53:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-12-07 12:53:52,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 685. [2019-12-07 12:53:52,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 12:53:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1040 transitions. [2019-12-07 12:53:52,801 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1040 transitions. Word has length 122 [2019-12-07 12:53:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:52,801 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1040 transitions. [2019-12-07 12:53:52,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:53:52,801 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1040 transitions. [2019-12-07 12:53:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 12:53:52,802 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:52,802 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, 1, 1] [2019-12-07 12:53:52,802 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:52,803 INFO L82 PathProgramCache]: Analyzing trace with hash -964530569, now seen corresponding path program 1 times [2019-12-07 12:53:52,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:52,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139948518] [2019-12-07 12:53:52,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:52,845 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 12:53:52,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139948518] [2019-12-07 12:53:52,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:52,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:52,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857195719] [2019-12-07 12:53:52,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:52,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:52,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:52,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:52,846 INFO L87 Difference]: Start difference. First operand 685 states and 1040 transitions. Second operand 4 states. [2019-12-07 12:53:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:53,184 INFO L93 Difference]: Finished difference Result 1563 states and 2382 transitions. [2019-12-07 12:53:53,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:53,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 12:53:53,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:53,188 INFO L225 Difference]: With dead ends: 1563 [2019-12-07 12:53:53,188 INFO L226 Difference]: Without dead ends: 897 [2019-12-07 12:53:53,188 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 12:53:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-12-07 12:53:53,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 763. [2019-12-07 12:53:53,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-12-07 12:53:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1182 transitions. [2019-12-07 12:53:53,201 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1182 transitions. Word has length 123 [2019-12-07 12:53:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:53,201 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1182 transitions. [2019-12-07 12:53:53,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1182 transitions. [2019-12-07 12:53:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 12:53:53,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:53,202 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, 2, 1, 1, 1, 1, 1, 1, 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 12:53:53,202 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:53,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:53,202 INFO L82 PathProgramCache]: Analyzing trace with hash -76872869, now seen corresponding path program 1 times [2019-12-07 12:53:53,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:53,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318263396] [2019-12-07 12:53:53,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:53,252 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:53,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318263396] [2019-12-07 12:53:53,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:53,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:53,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108951632] [2019-12-07 12:53:53,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:53,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:53,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:53,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:53,253 INFO L87 Difference]: Start difference. First operand 763 states and 1182 transitions. Second operand 4 states. [2019-12-07 12:53:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:53,561 INFO L93 Difference]: Finished difference Result 1631 states and 2510 transitions. [2019-12-07 12:53:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:53,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-12-07 12:53:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:53,564 INFO L225 Difference]: With dead ends: 1631 [2019-12-07 12:53:53,564 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 12:53:53,565 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 12:53:53,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 12:53:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 685. [2019-12-07 12:53:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 12:53:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1040 transitions. [2019-12-07 12:53:53,581 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1040 transitions. Word has length 124 [2019-12-07 12:53:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:53,581 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1040 transitions. [2019-12-07 12:53:53,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1040 transitions. [2019-12-07 12:53:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 12:53:53,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:53,583 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, 1, 1, 1, 1] [2019-12-07 12:53:53,583 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:53,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -357296708, now seen corresponding path program 1 times [2019-12-07 12:53:53,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:53,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093296983] [2019-12-07 12:53:53,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 12:53:53,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093296983] [2019-12-07 12:53:53,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:53,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:53,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77784248] [2019-12-07 12:53:53,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:53,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:53,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:53,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:53,655 INFO L87 Difference]: Start difference. First operand 685 states and 1040 transitions. Second operand 4 states. [2019-12-07 12:53:53,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:53,934 INFO L93 Difference]: Finished difference Result 1383 states and 2102 transitions. [2019-12-07 12:53:53,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:53,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-12-07 12:53:53,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:53,937 INFO L225 Difference]: With dead ends: 1383 [2019-12-07 12:53:53,937 INFO L226 Difference]: Without dead ends: 717 [2019-12-07 12:53:53,937 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 12:53:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-12-07 12:53:53,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 691. [2019-12-07 12:53:53,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 12:53:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1046 transitions. [2019-12-07 12:53:53,949 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1046 transitions. Word has length 125 [2019-12-07 12:53:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:53,949 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1046 transitions. [2019-12-07 12:53:53,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:53,949 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1046 transitions. [2019-12-07 12:53:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 12:53:53,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:53,950 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:53,950 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1978467926, now seen corresponding path program 1 times [2019-12-07 12:53:53,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:53,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747693796] [2019-12-07 12:53:53,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:53:53,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747693796] [2019-12-07 12:53:53,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:53,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:53,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626752891] [2019-12-07 12:53:53,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:53,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:53,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:53,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:53,987 INFO L87 Difference]: Start difference. First operand 691 states and 1046 transitions. Second operand 4 states. [2019-12-07 12:53:54,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:54,202 INFO L93 Difference]: Finished difference Result 1397 states and 2116 transitions. [2019-12-07 12:53:54,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:54,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 12:53:54,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:54,205 INFO L225 Difference]: With dead ends: 1397 [2019-12-07 12:53:54,205 INFO L226 Difference]: Without dead ends: 725 [2019-12-07 12:53:54,206 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 12:53:54,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2019-12-07 12:53:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 691. [2019-12-07 12:53:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 12:53:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1044 transitions. [2019-12-07 12:53:54,218 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1044 transitions. Word has length 131 [2019-12-07 12:53:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:54,218 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1044 transitions. [2019-12-07 12:53:54,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:54,218 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1044 transitions. [2019-12-07 12:53:54,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 12:53:54,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:54,219 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:54,219 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:54,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:54,219 INFO L82 PathProgramCache]: Analyzing trace with hash -490852613, now seen corresponding path program 1 times [2019-12-07 12:53:54,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:54,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589077881] [2019-12-07 12:53:54,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:54,256 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 12:53:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589077881] [2019-12-07 12:53:54,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:54,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:54,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851037093] [2019-12-07 12:53:54,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:54,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:54,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:54,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:54,257 INFO L87 Difference]: Start difference. First operand 691 states and 1044 transitions. Second operand 4 states. [2019-12-07 12:53:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:54,548 INFO L93 Difference]: Finished difference Result 1489 states and 2262 transitions. [2019-12-07 12:53:54,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:54,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 12:53:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:54,551 INFO L225 Difference]: With dead ends: 1489 [2019-12-07 12:53:54,551 INFO L226 Difference]: Without dead ends: 817 [2019-12-07 12:53:54,551 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 12:53:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2019-12-07 12:53:54,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 747. [2019-12-07 12:53:54,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 12:53:54,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1142 transitions. [2019-12-07 12:53:54,564 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1142 transitions. Word has length 131 [2019-12-07 12:53:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:54,564 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1142 transitions. [2019-12-07 12:53:54,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1142 transitions. [2019-12-07 12:53:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 12:53:54,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:54,565 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:54,565 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:54,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:54,566 INFO L82 PathProgramCache]: Analyzing trace with hash -127035201, now seen corresponding path program 1 times [2019-12-07 12:53:54,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:54,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957082903] [2019-12-07 12:53:54,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:53:54,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957082903] [2019-12-07 12:53:54,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:54,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:54,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194232906] [2019-12-07 12:53:54,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:54,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:54,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:54,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:54,610 INFO L87 Difference]: Start difference. First operand 747 states and 1142 transitions. Second operand 4 states. [2019-12-07 12:53:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:54,819 INFO L93 Difference]: Finished difference Result 1505 states and 2304 transitions. [2019-12-07 12:53:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:54,819 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 12:53:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:54,822 INFO L225 Difference]: With dead ends: 1505 [2019-12-07 12:53:54,822 INFO L226 Difference]: Without dead ends: 777 [2019-12-07 12:53:54,823 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 12:53:54,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-12-07 12:53:54,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 747. [2019-12-07 12:53:54,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 12:53:54,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1140 transitions. [2019-12-07 12:53:54,835 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1140 transitions. Word has length 132 [2019-12-07 12:53:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:54,835 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1140 transitions. [2019-12-07 12:53:54,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1140 transitions. [2019-12-07 12:53:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 12:53:54,836 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:54,836 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:54,837 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:54,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:54,837 INFO L82 PathProgramCache]: Analyzing trace with hash -719151105, now seen corresponding path program 1 times [2019-12-07 12:53:54,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:54,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459146527] [2019-12-07 12:53:54,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:54,880 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:54,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459146527] [2019-12-07 12:53:54,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:54,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:54,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133373153] [2019-12-07 12:53:54,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:54,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:54,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:54,882 INFO L87 Difference]: Start difference. First operand 747 states and 1140 transitions. Second operand 4 states. [2019-12-07 12:53:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:55,161 INFO L93 Difference]: Finished difference Result 1677 states and 2566 transitions. [2019-12-07 12:53:55,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:55,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 12:53:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:55,165 INFO L225 Difference]: With dead ends: 1677 [2019-12-07 12:53:55,165 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:55,165 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 12:53:55,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 771. [2019-12-07 12:53:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-07 12:53:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1174 transitions. [2019-12-07 12:53:55,179 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1174 transitions. Word has length 132 [2019-12-07 12:53:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:55,179 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1174 transitions. [2019-12-07 12:53:55,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:55,179 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1174 transitions. [2019-12-07 12:53:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 12:53:55,180 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:55,180 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:55,181 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:55,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:55,181 INFO L82 PathProgramCache]: Analyzing trace with hash -753498676, now seen corresponding path program 1 times [2019-12-07 12:53:55,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:55,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649798535] [2019-12-07 12:53:55,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:55,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:55,225 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:55,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649798535] [2019-12-07 12:53:55,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:55,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:55,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157976126] [2019-12-07 12:53:55,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:55,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:55,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:55,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:55,226 INFO L87 Difference]: Start difference. First operand 771 states and 1174 transitions. Second operand 4 states. [2019-12-07 12:53:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:55,506 INFO L93 Difference]: Finished difference Result 1701 states and 2598 transitions. [2019-12-07 12:53:55,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:55,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 12:53:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:55,510 INFO L225 Difference]: With dead ends: 1701 [2019-12-07 12:53:55,510 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:55,510 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 12:53:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 773. [2019-12-07 12:53:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-07 12:53:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1176 transitions. [2019-12-07 12:53:55,533 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1176 transitions. Word has length 133 [2019-12-07 12:53:55,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:55,533 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1176 transitions. [2019-12-07 12:53:55,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1176 transitions. [2019-12-07 12:53:55,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 12:53:55,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:55,534 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:55,534 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash -553510684, now seen corresponding path program 1 times [2019-12-07 12:53:55,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:55,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049131659] [2019-12-07 12:53:55,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:55,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049131659] [2019-12-07 12:53:55,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:55,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:55,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389882413] [2019-12-07 12:53:55,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:55,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:55,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:55,578 INFO L87 Difference]: Start difference. First operand 773 states and 1176 transitions. Second operand 4 states. [2019-12-07 12:53:55,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:55,873 INFO L93 Difference]: Finished difference Result 1703 states and 2598 transitions. [2019-12-07 12:53:55,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:55,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 12:53:55,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:55,877 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 12:53:55,877 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:55,877 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 12:53:55,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 775. [2019-12-07 12:53:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-12-07 12:53:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1178 transitions. [2019-12-07 12:53:55,892 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1178 transitions. Word has length 134 [2019-12-07 12:53:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:55,892 INFO L462 AbstractCegarLoop]: Abstraction has 775 states and 1178 transitions. [2019-12-07 12:53:55,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1178 transitions. [2019-12-07 12:53:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 12:53:55,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:55,893 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:55,893 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:55,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1679054831, now seen corresponding path program 1 times [2019-12-07 12:53:55,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:55,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467643828] [2019-12-07 12:53:55,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:55,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:55,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467643828] [2019-12-07 12:53:55,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:55,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:55,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957957502] [2019-12-07 12:53:55,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:55,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:55,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:55,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:55,928 INFO L87 Difference]: Start difference. First operand 775 states and 1178 transitions. Second operand 4 states. [2019-12-07 12:53:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:56,225 INFO L93 Difference]: Finished difference Result 1685 states and 2574 transitions. [2019-12-07 12:53:56,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:56,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 12:53:56,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:56,229 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 12:53:56,229 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 12:53:56,230 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 12:53:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 12:53:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 777. [2019-12-07 12:53:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 12:53:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1180 transitions. [2019-12-07 12:53:56,247 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1180 transitions. Word has length 135 [2019-12-07 12:53:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:56,247 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1180 transitions. [2019-12-07 12:53:56,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1180 transitions. [2019-12-07 12:53:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 12:53:56,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:56,248 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:56,249 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1027843339, now seen corresponding path program 1 times [2019-12-07 12:53:56,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:56,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566218781] [2019-12-07 12:53:56,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:56,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566218781] [2019-12-07 12:53:56,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:56,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:56,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639120054] [2019-12-07 12:53:56,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:56,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:56,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:56,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:56,284 INFO L87 Difference]: Start difference. First operand 777 states and 1180 transitions. Second operand 4 states. [2019-12-07 12:53:56,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:56,610 INFO L93 Difference]: Finished difference Result 1707 states and 2598 transitions. [2019-12-07 12:53:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:56,611 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 12:53:56,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:56,613 INFO L225 Difference]: With dead ends: 1707 [2019-12-07 12:53:56,613 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:56,614 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 12:53:56,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-12-07 12:53:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 12:53:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1178 transitions. [2019-12-07 12:53:56,629 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1178 transitions. Word has length 138 [2019-12-07 12:53:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:56,630 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1178 transitions. [2019-12-07 12:53:56,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1178 transitions. [2019-12-07 12:53:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 12:53:56,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:56,631 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:56,631 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:56,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:56,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1733023338, now seen corresponding path program 1 times [2019-12-07 12:53:56,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:56,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416146708] [2019-12-07 12:53:56,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:56,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416146708] [2019-12-07 12:53:56,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:56,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:56,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217411431] [2019-12-07 12:53:56,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:56,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:56,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:56,668 INFO L87 Difference]: Start difference. First operand 777 states and 1178 transitions. Second operand 4 states. [2019-12-07 12:53:57,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:57,017 INFO L93 Difference]: Finished difference Result 1707 states and 2594 transitions. [2019-12-07 12:53:57,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:57,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-12-07 12:53:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:57,018 INFO L225 Difference]: With dead ends: 1707 [2019-12-07 12:53:57,018 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:57,019 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 12:53:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:57,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-12-07 12:53:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 12:53:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1176 transitions. [2019-12-07 12:53:57,035 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1176 transitions. Word has length 139 [2019-12-07 12:53:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:57,035 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1176 transitions. [2019-12-07 12:53:57,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1176 transitions. [2019-12-07 12:53:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 12:53:57,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:57,036 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:57,036 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:57,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:57,036 INFO L82 PathProgramCache]: Analyzing trace with hash -854004134, now seen corresponding path program 1 times [2019-12-07 12:53:57,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:57,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461483799] [2019-12-07 12:53:57,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:57,071 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:57,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461483799] [2019-12-07 12:53:57,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:57,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:57,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870255410] [2019-12-07 12:53:57,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:57,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:57,072 INFO L87 Difference]: Start difference. First operand 777 states and 1176 transitions. Second operand 4 states. [2019-12-07 12:53:57,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:57,450 INFO L93 Difference]: Finished difference Result 1707 states and 2590 transitions. [2019-12-07 12:53:57,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:57,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-12-07 12:53:57,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:57,453 INFO L225 Difference]: With dead ends: 1707 [2019-12-07 12:53:57,453 INFO L226 Difference]: Without dead ends: 949 [2019-12-07 12:53:57,454 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 12:53:57,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2019-12-07 12:53:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 777. [2019-12-07 12:53:57,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 12:53:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1174 transitions. [2019-12-07 12:53:57,477 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1174 transitions. Word has length 140 [2019-12-07 12:53:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:57,477 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1174 transitions. [2019-12-07 12:53:57,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1174 transitions. [2019-12-07 12:53:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 12:53:57,478 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:57,478 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:57,478 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1890550107, now seen corresponding path program 1 times [2019-12-07 12:53:57,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:57,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763837734] [2019-12-07 12:53:57,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:57,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:53:57,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763837734] [2019-12-07 12:53:57,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:57,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:57,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061452256] [2019-12-07 12:53:57,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:57,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:57,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:57,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:57,520 INFO L87 Difference]: Start difference. First operand 777 states and 1174 transitions. Second operand 4 states. [2019-12-07 12:53:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:57,860 INFO L93 Difference]: Finished difference Result 1687 states and 2562 transitions. [2019-12-07 12:53:57,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:57,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 12:53:57,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:57,862 INFO L225 Difference]: With dead ends: 1687 [2019-12-07 12:53:57,862 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 12:53:57,862 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 12:53:57,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 12:53:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 747. [2019-12-07 12:53:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2019-12-07 12:53:57,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1132 transitions. [2019-12-07 12:53:57,878 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1132 transitions. Word has length 141 [2019-12-07 12:53:57,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:57,878 INFO L462 AbstractCegarLoop]: Abstraction has 747 states and 1132 transitions. [2019-12-07 12:53:57,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:57,878 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1132 transitions. [2019-12-07 12:53:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 12:53:57,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:57,879 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:57,879 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:57,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1419647362, now seen corresponding path program 1 times [2019-12-07 12:53:57,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:57,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852247872] [2019-12-07 12:53:57,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:57,917 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:57,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852247872] [2019-12-07 12:53:57,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:57,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:57,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226006149] [2019-12-07 12:53:57,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:57,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:57,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:57,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:57,918 INFO L87 Difference]: Start difference. First operand 747 states and 1132 transitions. Second operand 4 states. [2019-12-07 12:53:58,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:58,194 INFO L93 Difference]: Finished difference Result 1657 states and 2518 transitions. [2019-12-07 12:53:58,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:58,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 12:53:58,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:58,196 INFO L225 Difference]: With dead ends: 1657 [2019-12-07 12:53:58,196 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 12:53:58,196 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 12:53:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 12:53:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 803. [2019-12-07 12:53:58,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2019-12-07 12:53:58,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1222 transitions. [2019-12-07 12:53:58,213 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1222 transitions. Word has length 142 [2019-12-07 12:53:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:58,214 INFO L462 AbstractCegarLoop]: Abstraction has 803 states and 1222 transitions. [2019-12-07 12:53:58,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1222 transitions. [2019-12-07 12:53:58,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 12:53:58,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:58,215 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:58,215 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 684152075, now seen corresponding path program 1 times [2019-12-07 12:53:58,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:58,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462174715] [2019-12-07 12:53:58,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:58,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462174715] [2019-12-07 12:53:58,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:58,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:58,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961097188] [2019-12-07 12:53:58,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:58,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:58,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:58,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:58,255 INFO L87 Difference]: Start difference. First operand 803 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:53:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:58,551 INFO L93 Difference]: Finished difference Result 1697 states and 2580 transitions. [2019-12-07 12:53:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:58,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 12:53:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:58,552 INFO L225 Difference]: With dead ends: 1697 [2019-12-07 12:53:58,553 INFO L226 Difference]: Without dead ends: 913 [2019-12-07 12:53:58,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 12:53:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-07 12:53:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 805. [2019-12-07 12:53:58,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 12:53:58,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1224 transitions. [2019-12-07 12:53:58,571 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1224 transitions. Word has length 143 [2019-12-07 12:53:58,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:58,571 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1224 transitions. [2019-12-07 12:53:58,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:58,571 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1224 transitions. [2019-12-07 12:53:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 12:53:58,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:58,572 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:58,572 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:58,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:58,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1851250225, now seen corresponding path program 1 times [2019-12-07 12:53:58,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:58,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090806463] [2019-12-07 12:53:58,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:53:58,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090806463] [2019-12-07 12:53:58,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:58,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:58,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968544061] [2019-12-07 12:53:58,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:58,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:58,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:58,610 INFO L87 Difference]: Start difference. First operand 805 states and 1224 transitions. Second operand 4 states. [2019-12-07 12:53:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:58,888 INFO L93 Difference]: Finished difference Result 1699 states and 2580 transitions. [2019-12-07 12:53:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:58,888 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 12:53:58,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:58,889 INFO L225 Difference]: With dead ends: 1699 [2019-12-07 12:53:58,889 INFO L226 Difference]: Without dead ends: 913 [2019-12-07 12:53:58,890 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 12:53:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-07 12:53:58,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 805. [2019-12-07 12:53:58,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 12:53:58,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1222 transitions. [2019-12-07 12:53:58,907 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1222 transitions. Word has length 145 [2019-12-07 12:53:58,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:58,908 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1222 transitions. [2019-12-07 12:53:58,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:58,908 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1222 transitions. [2019-12-07 12:53:58,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 12:53:58,909 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:58,909 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:58,909 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:58,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:58,909 INFO L82 PathProgramCache]: Analyzing trace with hash 224183364, now seen corresponding path program 1 times [2019-12-07 12:53:58,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:58,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020132308] [2019-12-07 12:53:58,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:58,947 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:53:58,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020132308] [2019-12-07 12:53:58,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:58,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:58,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585282017] [2019-12-07 12:53:58,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:58,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:58,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:58,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:58,948 INFO L87 Difference]: Start difference. First operand 805 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:53:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:59,218 INFO L93 Difference]: Finished difference Result 1695 states and 2572 transitions. [2019-12-07 12:53:59,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:59,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 12:53:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:59,219 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 12:53:59,219 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 12:53:59,220 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 12:53:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 12:53:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 805. [2019-12-07 12:53:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 12:53:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1220 transitions. [2019-12-07 12:53:59,237 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1220 transitions. Word has length 146 [2019-12-07 12:53:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:59,237 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1220 transitions. [2019-12-07 12:53:59,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1220 transitions. [2019-12-07 12:53:59,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 12:53:59,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:59,238 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:53:59,238 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:59,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:59,238 INFO L82 PathProgramCache]: Analyzing trace with hash -781971136, now seen corresponding path program 1 times [2019-12-07 12:53:59,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:59,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380565525] [2019-12-07 12:53:59,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:59,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:53:59,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380565525] [2019-12-07 12:53:59,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:59,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:59,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499577451] [2019-12-07 12:53:59,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:59,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:59,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:59,280 INFO L87 Difference]: Start difference. First operand 805 states and 1220 transitions. Second operand 4 states. [2019-12-07 12:53:59,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:59,537 INFO L93 Difference]: Finished difference Result 1689 states and 2560 transitions. [2019-12-07 12:53:59,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:59,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 12:53:59,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:59,539 INFO L225 Difference]: With dead ends: 1689 [2019-12-07 12:53:59,539 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 12:53:59,539 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 12:53:59,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 12:53:59,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 811. [2019-12-07 12:53:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:53:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1230 transitions. [2019-12-07 12:53:59,557 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1230 transitions. Word has length 146 [2019-12-07 12:53:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:59,557 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1230 transitions. [2019-12-07 12:53:59,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1230 transitions. [2019-12-07 12:53:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 12:53:59,558 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:59,558 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:59,559 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:59,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:59,559 INFO L82 PathProgramCache]: Analyzing trace with hash -21036559, now seen corresponding path program 1 times [2019-12-07 12:53:59,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:59,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713437006] [2019-12-07 12:53:59,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:59,621 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 12:53:59,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713437006] [2019-12-07 12:53:59,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:59,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:59,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203193973] [2019-12-07 12:53:59,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:59,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:59,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:59,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:59,622 INFO L87 Difference]: Start difference. First operand 811 states and 1230 transitions. Second operand 4 states. [2019-12-07 12:53:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:53:59,910 INFO L93 Difference]: Finished difference Result 1673 states and 2534 transitions. [2019-12-07 12:53:59,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:53:59,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 12:53:59,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:53:59,911 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 12:53:59,911 INFO L226 Difference]: Without dead ends: 881 [2019-12-07 12:53:59,912 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 12:53:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-12-07 12:53:59,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-12-07 12:53:59,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:53:59,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1228 transitions. [2019-12-07 12:53:59,928 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1228 transitions. Word has length 146 [2019-12-07 12:53:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:53:59,928 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1228 transitions. [2019-12-07 12:53:59,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:53:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1228 transitions. [2019-12-07 12:53:59,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 12:53:59,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:53:59,929 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:53:59,929 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:53:59,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:53:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash -586784230, now seen corresponding path program 1 times [2019-12-07 12:53:59,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:53:59,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373045575] [2019-12-07 12:53:59,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:53:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:53:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 12:53:59,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373045575] [2019-12-07 12:53:59,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:53:59,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:53:59,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477773510] [2019-12-07 12:53:59,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:53:59,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:53:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:53:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:53:59,969 INFO L87 Difference]: Start difference. First operand 811 states and 1228 transitions. Second operand 4 states. [2019-12-07 12:54:00,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:00,241 INFO L93 Difference]: Finished difference Result 1673 states and 2530 transitions. [2019-12-07 12:54:00,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:00,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 12:54:00,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:00,242 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 12:54:00,242 INFO L226 Difference]: Without dead ends: 881 [2019-12-07 12:54:00,243 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 12:54:00,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-12-07 12:54:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-12-07 12:54:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:54:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1226 transitions. [2019-12-07 12:54:00,260 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1226 transitions. Word has length 147 [2019-12-07 12:54:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:00,260 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1226 transitions. [2019-12-07 12:54:00,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1226 transitions. [2019-12-07 12:54:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 12:54:00,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:00,261 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, 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] [2019-12-07 12:54:00,261 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:00,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:00,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1801381364, now seen corresponding path program 1 times [2019-12-07 12:54:00,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:00,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270578689] [2019-12-07 12:54:00,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:00,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270578689] [2019-12-07 12:54:00,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:00,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:00,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226487527] [2019-12-07 12:54:00,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:00,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:00,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:00,303 INFO L87 Difference]: Start difference. First operand 811 states and 1226 transitions. Second operand 4 states. [2019-12-07 12:54:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:00,615 INFO L93 Difference]: Finished difference Result 1721 states and 2598 transitions. [2019-12-07 12:54:00,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:00,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 12:54:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:00,616 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 12:54:00,616 INFO L226 Difference]: Without dead ends: 929 [2019-12-07 12:54:00,616 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 12:54:00,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2019-12-07 12:54:00,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 811. [2019-12-07 12:54:00,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:54:00,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1224 transitions. [2019-12-07 12:54:00,633 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1224 transitions. Word has length 148 [2019-12-07 12:54:00,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:00,634 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1224 transitions. [2019-12-07 12:54:00,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:00,634 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1224 transitions. [2019-12-07 12:54:00,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 12:54:00,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:00,635 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:00,635 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:00,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:00,635 INFO L82 PathProgramCache]: Analyzing trace with hash 319669846, now seen corresponding path program 1 times [2019-12-07 12:54:00,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:00,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456410475] [2019-12-07 12:54:00,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 12:54:00,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456410475] [2019-12-07 12:54:00,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:00,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:00,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608134690] [2019-12-07 12:54:00,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:00,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:00,674 INFO L87 Difference]: Start difference. First operand 811 states and 1224 transitions. Second operand 4 states. [2019-12-07 12:54:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:00,938 INFO L93 Difference]: Finished difference Result 1673 states and 2522 transitions. [2019-12-07 12:54:00,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:00,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 12:54:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:00,939 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 12:54:00,939 INFO L226 Difference]: Without dead ends: 881 [2019-12-07 12:54:00,940 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 12:54:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-12-07 12:54:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 811. [2019-12-07 12:54:00,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:54:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1222 transitions. [2019-12-07 12:54:00,960 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1222 transitions. Word has length 148 [2019-12-07 12:54:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:00,960 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1222 transitions. [2019-12-07 12:54:00,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1222 transitions. [2019-12-07 12:54:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 12:54:00,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:00,961 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, 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] [2019-12-07 12:54:00,962 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:00,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1751794773, now seen corresponding path program 1 times [2019-12-07 12:54:00,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:00,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800436548] [2019-12-07 12:54:00,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:01,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800436548] [2019-12-07 12:54:01,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:01,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:01,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806649522] [2019-12-07 12:54:01,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:01,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:01,003 INFO L87 Difference]: Start difference. First operand 811 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:01,289 INFO L93 Difference]: Finished difference Result 1705 states and 2564 transitions. [2019-12-07 12:54:01,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:01,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 12:54:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:01,290 INFO L225 Difference]: With dead ends: 1705 [2019-12-07 12:54:01,291 INFO L226 Difference]: Without dead ends: 913 [2019-12-07 12:54:01,291 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 12:54:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-07 12:54:01,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 811. [2019-12-07 12:54:01,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 12:54:01,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1220 transitions. [2019-12-07 12:54:01,309 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1220 transitions. Word has length 149 [2019-12-07 12:54:01,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:01,309 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1220 transitions. [2019-12-07 12:54:01,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:01,309 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1220 transitions. [2019-12-07 12:54:01,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 12:54:01,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:01,310 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:01,310 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:01,310 INFO L82 PathProgramCache]: Analyzing trace with hash -740877549, now seen corresponding path program 1 times [2019-12-07 12:54:01,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:01,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327596995] [2019-12-07 12:54:01,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:01,352 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:01,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327596995] [2019-12-07 12:54:01,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:01,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:01,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124171874] [2019-12-07 12:54:01,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:01,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:01,353 INFO L87 Difference]: Start difference. First operand 811 states and 1220 transitions. Second operand 4 states. [2019-12-07 12:54:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:01,629 INFO L93 Difference]: Finished difference Result 1695 states and 2548 transitions. [2019-12-07 12:54:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:01,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 12:54:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:01,630 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 12:54:01,630 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 12:54:01,631 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 12:54:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 12:54:01,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 813. [2019-12-07 12:54:01,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 12:54:01,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1222 transitions. [2019-12-07 12:54:01,657 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1222 transitions. Word has length 149 [2019-12-07 12:54:01,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:01,658 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1222 transitions. [2019-12-07 12:54:01,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:01,658 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1222 transitions. [2019-12-07 12:54:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 12:54:01,659 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:01,659 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:01,659 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:01,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:01,659 INFO L82 PathProgramCache]: Analyzing trace with hash -380262177, now seen corresponding path program 1 times [2019-12-07 12:54:01,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:01,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039863123] [2019-12-07 12:54:01,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:01,697 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 12:54:01,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039863123] [2019-12-07 12:54:01,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:01,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:01,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060411123] [2019-12-07 12:54:01,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:01,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:01,698 INFO L87 Difference]: Start difference. First operand 813 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:01,964 INFO L93 Difference]: Finished difference Result 1657 states and 2494 transitions. [2019-12-07 12:54:01,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:01,965 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 12:54:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:01,966 INFO L225 Difference]: With dead ends: 1657 [2019-12-07 12:54:01,966 INFO L226 Difference]: Without dead ends: 863 [2019-12-07 12:54:01,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-12-07 12:54:01,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 813. [2019-12-07 12:54:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 12:54:01,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1220 transitions. [2019-12-07 12:54:01,984 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1220 transitions. Word has length 149 [2019-12-07 12:54:01,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:01,984 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1220 transitions. [2019-12-07 12:54:01,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1220 transitions. [2019-12-07 12:54:01,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 12:54:01,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:01,986 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:01,986 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:01,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:01,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1679741845, now seen corresponding path program 1 times [2019-12-07 12:54:01,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:01,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606289057] [2019-12-07 12:54:01,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:02,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606289057] [2019-12-07 12:54:02,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:02,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:02,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107829062] [2019-12-07 12:54:02,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:02,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:02,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:02,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:02,027 INFO L87 Difference]: Start difference. First operand 813 states and 1220 transitions. Second operand 4 states. [2019-12-07 12:54:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:02,301 INFO L93 Difference]: Finished difference Result 1685 states and 2528 transitions. [2019-12-07 12:54:02,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:02,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 12:54:02,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:02,302 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 12:54:02,302 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 12:54:02,303 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 12:54:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 12:54:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 815. [2019-12-07 12:54:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-07 12:54:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1222 transitions. [2019-12-07 12:54:02,321 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1222 transitions. Word has length 150 [2019-12-07 12:54:02,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:02,321 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1222 transitions. [2019-12-07 12:54:02,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1222 transitions. [2019-12-07 12:54:02,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 12:54:02,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:02,322 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:02,322 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:02,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:02,322 INFO L82 PathProgramCache]: Analyzing trace with hash 276844141, now seen corresponding path program 1 times [2019-12-07 12:54:02,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:02,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353102803] [2019-12-07 12:54:02,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:02,362 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:02,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353102803] [2019-12-07 12:54:02,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:02,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:02,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084092914] [2019-12-07 12:54:02,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:02,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:02,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:02,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:02,363 INFO L87 Difference]: Start difference. First operand 815 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:02,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:02,616 INFO L93 Difference]: Finished difference Result 1687 states and 2528 transitions. [2019-12-07 12:54:02,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:02,616 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 12:54:02,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:02,617 INFO L225 Difference]: With dead ends: 1687 [2019-12-07 12:54:02,617 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 12:54:02,618 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 12:54:02,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 12:54:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 817. [2019-12-07 12:54:02,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 12:54:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1224 transitions. [2019-12-07 12:54:02,636 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1224 transitions. Word has length 150 [2019-12-07 12:54:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:02,636 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1224 transitions. [2019-12-07 12:54:02,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1224 transitions. [2019-12-07 12:54:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 12:54:02,637 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:02,637 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:02,637 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:02,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1358699259, now seen corresponding path program 1 times [2019-12-07 12:54:02,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:02,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587225184] [2019-12-07 12:54:02,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:54:02,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587225184] [2019-12-07 12:54:02,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:02,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:02,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257277413] [2019-12-07 12:54:02,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:02,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:02,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:02,681 INFO L87 Difference]: Start difference. First operand 817 states and 1224 transitions. Second operand 4 states. [2019-12-07 12:54:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:02,966 INFO L93 Difference]: Finished difference Result 1711 states and 2556 transitions. [2019-12-07 12:54:02,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:02,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 12:54:02,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:02,967 INFO L225 Difference]: With dead ends: 1711 [2019-12-07 12:54:02,967 INFO L226 Difference]: Without dead ends: 913 [2019-12-07 12:54:02,968 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 12:54:02,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2019-12-07 12:54:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 817. [2019-12-07 12:54:02,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 12:54:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1222 transitions. [2019-12-07 12:54:02,986 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1222 transitions. Word has length 151 [2019-12-07 12:54:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:02,987 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1222 transitions. [2019-12-07 12:54:02,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1222 transitions. [2019-12-07 12:54:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 12:54:02,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:02,988 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 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] [2019-12-07 12:54:02,988 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:02,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:02,988 INFO L82 PathProgramCache]: Analyzing trace with hash -386294923, now seen corresponding path program 1 times [2019-12-07 12:54:02,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:02,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492410427] [2019-12-07 12:54:02,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:02,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:03,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492410427] [2019-12-07 12:54:03,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:03,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:03,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128972897] [2019-12-07 12:54:03,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:03,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:03,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:03,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:03,030 INFO L87 Difference]: Start difference. First operand 817 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:03,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:03,278 INFO L93 Difference]: Finished difference Result 1683 states and 2517 transitions. [2019-12-07 12:54:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:03,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 12:54:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:03,279 INFO L225 Difference]: With dead ends: 1683 [2019-12-07 12:54:03,279 INFO L226 Difference]: Without dead ends: 885 [2019-12-07 12:54:03,280 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 12:54:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-12-07 12:54:03,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 819. [2019-12-07 12:54:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 12:54:03,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1224 transitions. [2019-12-07 12:54:03,308 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1224 transitions. Word has length 151 [2019-12-07 12:54:03,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:03,308 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1224 transitions. [2019-12-07 12:54:03,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:03,308 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1224 transitions. [2019-12-07 12:54:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 12:54:03,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:03,309 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:03,309 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:03,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:03,309 INFO L82 PathProgramCache]: Analyzing trace with hash 2134972602, now seen corresponding path program 1 times [2019-12-07 12:54:03,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:03,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795622075] [2019-12-07 12:54:03,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:03,347 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:54:03,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795622075] [2019-12-07 12:54:03,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:03,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:03,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051060420] [2019-12-07 12:54:03,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:03,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:03,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:03,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:03,348 INFO L87 Difference]: Start difference. First operand 819 states and 1224 transitions. Second operand 4 states. [2019-12-07 12:54:03,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:03,633 INFO L93 Difference]: Finished difference Result 1709 states and 2548 transitions. [2019-12-07 12:54:03,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:03,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 12:54:03,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:03,634 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 12:54:03,634 INFO L226 Difference]: Without dead ends: 909 [2019-12-07 12:54:03,635 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 12:54:03,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-07 12:54:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 819. [2019-12-07 12:54:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 12:54:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1222 transitions. [2019-12-07 12:54:03,654 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1222 transitions. Word has length 152 [2019-12-07 12:54:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:03,654 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1222 transitions. [2019-12-07 12:54:03,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1222 transitions. [2019-12-07 12:54:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 12:54:03,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:03,656 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:03,656 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1128818102, now seen corresponding path program 1 times [2019-12-07 12:54:03,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:03,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349989469] [2019-12-07 12:54:03,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:03,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349989469] [2019-12-07 12:54:03,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:03,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:03,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267139248] [2019-12-07 12:54:03,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:03,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:03,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:03,698 INFO L87 Difference]: Start difference. First operand 819 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:03,985 INFO L93 Difference]: Finished difference Result 1703 states and 2536 transitions. [2019-12-07 12:54:03,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:03,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 12:54:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:03,986 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 12:54:03,986 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 12:54:03,986 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 12:54:03,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 12:54:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 819. [2019-12-07 12:54:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 12:54:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1220 transitions. [2019-12-07 12:54:04,006 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1220 transitions. Word has length 152 [2019-12-07 12:54:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:04,007 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1220 transitions. [2019-12-07 12:54:04,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1220 transitions. [2019-12-07 12:54:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 12:54:04,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:04,008 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 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] [2019-12-07 12:54:04,008 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:04,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:04,008 INFO L82 PathProgramCache]: Analyzing trace with hash 173535669, now seen corresponding path program 1 times [2019-12-07 12:54:04,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:04,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203210354] [2019-12-07 12:54:04,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:04,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203210354] [2019-12-07 12:54:04,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:04,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:04,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311614441] [2019-12-07 12:54:04,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:04,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:04,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:04,050 INFO L87 Difference]: Start difference. First operand 819 states and 1220 transitions. Second operand 4 states. [2019-12-07 12:54:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:04,320 INFO L93 Difference]: Finished difference Result 1685 states and 2509 transitions. [2019-12-07 12:54:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:04,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 12:54:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:04,321 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 12:54:04,321 INFO L226 Difference]: Without dead ends: 885 [2019-12-07 12:54:04,322 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 12:54:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-12-07 12:54:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 821. [2019-12-07 12:54:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-12-07 12:54:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1222 transitions. [2019-12-07 12:54:04,347 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1222 transitions. Word has length 152 [2019-12-07 12:54:04,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:04,347 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1222 transitions. [2019-12-07 12:54:04,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:04,347 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1222 transitions. [2019-12-07 12:54:04,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 12:54:04,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:04,348 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:04,348 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:04,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1223905309, now seen corresponding path program 1 times [2019-12-07 12:54:04,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:04,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142255441] [2019-12-07 12:54:04,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:04,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142255441] [2019-12-07 12:54:04,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:04,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:04,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210038788] [2019-12-07 12:54:04,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:04,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:04,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:04,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:04,391 INFO L87 Difference]: Start difference. First operand 821 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:04,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:04,806 INFO L93 Difference]: Finished difference Result 1681 states and 2502 transitions. [2019-12-07 12:54:04,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:04,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 12:54:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:04,807 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 12:54:04,807 INFO L226 Difference]: Without dead ends: 879 [2019-12-07 12:54:04,808 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 12:54:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-07 12:54:04,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 823. [2019-12-07 12:54:04,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 12:54:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1224 transitions. [2019-12-07 12:54:04,840 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1224 transitions. Word has length 153 [2019-12-07 12:54:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:04,840 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1224 transitions. [2019-12-07 12:54:04,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1224 transitions. [2019-12-07 12:54:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 12:54:04,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:04,841 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:04,841 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:04,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1915229475, now seen corresponding path program 1 times [2019-12-07 12:54:04,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:04,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130065902] [2019-12-07 12:54:04,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:04,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130065902] [2019-12-07 12:54:04,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:04,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:04,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573784345] [2019-12-07 12:54:04,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:04,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:04,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:04,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:04,883 INFO L87 Difference]: Start difference. First operand 823 states and 1224 transitions. Second operand 4 states. [2019-12-07 12:54:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:05,155 INFO L93 Difference]: Finished difference Result 1707 states and 2532 transitions. [2019-12-07 12:54:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:05,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 12:54:05,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:05,156 INFO L225 Difference]: With dead ends: 1707 [2019-12-07 12:54:05,156 INFO L226 Difference]: Without dead ends: 903 [2019-12-07 12:54:05,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 12:54:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-07 12:54:05,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 823. [2019-12-07 12:54:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 12:54:05,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1222 transitions. [2019-12-07 12:54:05,178 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1222 transitions. Word has length 155 [2019-12-07 12:54:05,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:05,178 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1222 transitions. [2019-12-07 12:54:05,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:05,178 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1222 transitions. [2019-12-07 12:54:05,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:54:05,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:05,179 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:05,179 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:05,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:05,180 INFO L82 PathProgramCache]: Analyzing trace with hash 570054113, now seen corresponding path program 1 times [2019-12-07 12:54:05,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:05,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199223460] [2019-12-07 12:54:05,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:05,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199223460] [2019-12-07 12:54:05,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:05,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:05,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925786333] [2019-12-07 12:54:05,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:05,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:05,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:05,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:05,223 INFO L87 Difference]: Start difference. First operand 823 states and 1222 transitions. Second operand 4 states. [2019-12-07 12:54:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:05,486 INFO L93 Difference]: Finished difference Result 1695 states and 2512 transitions. [2019-12-07 12:54:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:05,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 12:54:05,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:05,487 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 12:54:05,487 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 12:54:05,488 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 12:54:05,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 12:54:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 823. [2019-12-07 12:54:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 12:54:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1220 transitions. [2019-12-07 12:54:05,509 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1220 transitions. Word has length 156 [2019-12-07 12:54:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:05,509 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1220 transitions. [2019-12-07 12:54:05,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1220 transitions. [2019-12-07 12:54:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:54:05,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:05,510 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:05,510 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1768327197, now seen corresponding path program 1 times [2019-12-07 12:54:05,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:05,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795555442] [2019-12-07 12:54:05,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:05,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:05,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795555442] [2019-12-07 12:54:05,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:05,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:05,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128021621] [2019-12-07 12:54:05,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:05,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:05,565 INFO L87 Difference]: Start difference. First operand 823 states and 1220 transitions. Second operand 4 states. [2019-12-07 12:54:05,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:05,833 INFO L93 Difference]: Finished difference Result 1695 states and 2508 transitions. [2019-12-07 12:54:05,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:05,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 12:54:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:05,834 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 12:54:05,834 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 12:54:05,835 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 12:54:05,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 12:54:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 823. [2019-12-07 12:54:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 12:54:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1218 transitions. [2019-12-07 12:54:05,855 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1218 transitions. Word has length 156 [2019-12-07 12:54:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:05,856 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1218 transitions. [2019-12-07 12:54:05,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1218 transitions. [2019-12-07 12:54:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 12:54:05,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:05,857 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] [2019-12-07 12:54:05,857 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:05,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:05,857 INFO L82 PathProgramCache]: Analyzing trace with hash -370540048, now seen corresponding path program 1 times [2019-12-07 12:54:05,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:05,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129206058] [2019-12-07 12:54:05,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:05,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129206058] [2019-12-07 12:54:05,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:05,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:05,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721768114] [2019-12-07 12:54:05,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:05,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:05,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:05,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:05,902 INFO L87 Difference]: Start difference. First operand 823 states and 1218 transitions. Second operand 4 states. [2019-12-07 12:54:06,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:06,198 INFO L93 Difference]: Finished difference Result 1761 states and 2622 transitions. [2019-12-07 12:54:06,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:06,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 12:54:06,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:06,199 INFO L225 Difference]: With dead ends: 1761 [2019-12-07 12:54:06,199 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 12:54:06,200 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 12:54:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 12:54:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 883. [2019-12-07 12:54:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 12:54:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1324 transitions. [2019-12-07 12:54:06,221 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1324 transitions. Word has length 156 [2019-12-07 12:54:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:06,222 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1324 transitions. [2019-12-07 12:54:06,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:06,222 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1324 transitions. [2019-12-07 12:54:06,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 12:54:06,223 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:06,223 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:06,223 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash 637903039, now seen corresponding path program 1 times [2019-12-07 12:54:06,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:06,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290899893] [2019-12-07 12:54:06,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:06,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290899893] [2019-12-07 12:54:06,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:06,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:06,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516444685] [2019-12-07 12:54:06,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:06,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:06,266 INFO L87 Difference]: Start difference. First operand 883 states and 1324 transitions. Second operand 4 states. [2019-12-07 12:54:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:06,527 INFO L93 Difference]: Finished difference Result 1809 states and 2709 transitions. [2019-12-07 12:54:06,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:06,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 12:54:06,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:06,528 INFO L225 Difference]: With dead ends: 1809 [2019-12-07 12:54:06,528 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 12:54:06,529 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 12:54:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 12:54:06,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 883. [2019-12-07 12:54:06,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 12:54:06,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1322 transitions. [2019-12-07 12:54:06,550 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1322 transitions. Word has length 157 [2019-12-07 12:54:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:06,550 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1322 transitions. [2019-12-07 12:54:06,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1322 transitions. [2019-12-07 12:54:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:54:06,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:06,552 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:06,552 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1858901419, now seen corresponding path program 1 times [2019-12-07 12:54:06,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:06,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94099629] [2019-12-07 12:54:06,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:06,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94099629] [2019-12-07 12:54:06,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:06,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:06,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210145803] [2019-12-07 12:54:06,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:06,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:06,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:06,596 INFO L87 Difference]: Start difference. First operand 883 states and 1322 transitions. Second operand 4 states. [2019-12-07 12:54:06,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:06,863 INFO L93 Difference]: Finished difference Result 1809 states and 2705 transitions. [2019-12-07 12:54:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:06,864 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 12:54:06,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:06,864 INFO L225 Difference]: With dead ends: 1809 [2019-12-07 12:54:06,864 INFO L226 Difference]: Without dead ends: 945 [2019-12-07 12:54:06,865 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 12:54:06,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-12-07 12:54:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 883. [2019-12-07 12:54:06,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 883 states. [2019-12-07 12:54:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1320 transitions. [2019-12-07 12:54:06,888 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1320 transitions. Word has length 158 [2019-12-07 12:54:06,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:06,888 INFO L462 AbstractCegarLoop]: Abstraction has 883 states and 1320 transitions. [2019-12-07 12:54:06,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:06,888 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1320 transitions. [2019-12-07 12:54:06,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 12:54:06,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:06,890 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:06,890 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:06,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:06,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1930636007, now seen corresponding path program 1 times [2019-12-07 12:54:06,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:06,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715849637] [2019-12-07 12:54:06,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 12:54:06,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715849637] [2019-12-07 12:54:06,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:06,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:06,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627142720] [2019-12-07 12:54:06,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:06,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:06,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:06,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:06,946 INFO L87 Difference]: Start difference. First operand 883 states and 1320 transitions. Second operand 4 states. [2019-12-07 12:54:07,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:07,231 INFO L93 Difference]: Finished difference Result 1803 states and 2694 transitions. [2019-12-07 12:54:07,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:07,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 12:54:07,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:07,232 INFO L225 Difference]: With dead ends: 1803 [2019-12-07 12:54:07,232 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 12:54:07,233 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 12:54:07,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 12:54:07,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 807. [2019-12-07 12:54:07,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 12:54:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1208 transitions. [2019-12-07 12:54:07,255 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1208 transitions. Word has length 159 [2019-12-07 12:54:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:07,255 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1208 transitions. [2019-12-07 12:54:07,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1208 transitions. [2019-12-07 12:54:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 12:54:07,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:07,256 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:07,256 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash 515522094, now seen corresponding path program 1 times [2019-12-07 12:54:07,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:07,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568391327] [2019-12-07 12:54:07,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:54:07,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568391327] [2019-12-07 12:54:07,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:07,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:07,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77312636] [2019-12-07 12:54:07,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:07,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:07,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:07,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:07,299 INFO L87 Difference]: Start difference. First operand 807 states and 1208 transitions. Second operand 4 states. [2019-12-07 12:54:07,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:07,590 INFO L93 Difference]: Finished difference Result 1727 states and 2580 transitions. [2019-12-07 12:54:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:07,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 12:54:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:07,591 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 12:54:07,591 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 12:54:07,592 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 12:54:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 12:54:07,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 867. [2019-12-07 12:54:07,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-12-07 12:54:07,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1298 transitions. [2019-12-07 12:54:07,622 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1298 transitions. Word has length 159 [2019-12-07 12:54:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:07,623 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1298 transitions. [2019-12-07 12:54:07,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1298 transitions. [2019-12-07 12:54:07,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 12:54:07,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:07,624 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:07,624 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:07,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1330228607, now seen corresponding path program 1 times [2019-12-07 12:54:07,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:07,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964476766] [2019-12-07 12:54:07,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 12:54:07,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964476766] [2019-12-07 12:54:07,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:07,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:07,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356898044] [2019-12-07 12:54:07,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:07,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:07,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:07,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:07,664 INFO L87 Difference]: Start difference. First operand 867 states and 1298 transitions. Second operand 4 states. [2019-12-07 12:54:07,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:07,924 INFO L93 Difference]: Finished difference Result 1765 states and 2646 transitions. [2019-12-07 12:54:07,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:07,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 12:54:07,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:07,926 INFO L225 Difference]: With dead ends: 1765 [2019-12-07 12:54:07,926 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 12:54:07,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:07,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 12:54:07,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 867. [2019-12-07 12:54:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2019-12-07 12:54:07,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1296 transitions. [2019-12-07 12:54:07,949 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1296 transitions. Word has length 159 [2019-12-07 12:54:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:07,949 INFO L462 AbstractCegarLoop]: Abstraction has 867 states and 1296 transitions. [2019-12-07 12:54:07,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:07,950 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1296 transitions. [2019-12-07 12:54:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 12:54:07,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:07,950 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:07,950 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:07,951 INFO L82 PathProgramCache]: Analyzing trace with hash 762046113, now seen corresponding path program 1 times [2019-12-07 12:54:07,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:07,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520710085] [2019-12-07 12:54:07,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 12:54:07,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520710085] [2019-12-07 12:54:07,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:07,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:07,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164379047] [2019-12-07 12:54:07,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:07,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:07,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:07,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:07,992 INFO L87 Difference]: Start difference. First operand 867 states and 1296 transitions. Second operand 4 states. [2019-12-07 12:54:08,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:08,268 INFO L93 Difference]: Finished difference Result 1783 states and 2660 transitions. [2019-12-07 12:54:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:08,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 12:54:08,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:08,269 INFO L225 Difference]: With dead ends: 1783 [2019-12-07 12:54:08,269 INFO L226 Difference]: Without dead ends: 935 [2019-12-07 12:54:08,269 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 12:54:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-12-07 12:54:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 869. [2019-12-07 12:54:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 12:54:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1298 transitions. [2019-12-07 12:54:08,292 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1298 transitions. Word has length 160 [2019-12-07 12:54:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:08,293 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1298 transitions. [2019-12-07 12:54:08,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1298 transitions. [2019-12-07 12:54:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 12:54:08,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:08,293 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:08,294 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:08,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1252382390, now seen corresponding path program 1 times [2019-12-07 12:54:08,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:08,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480338768] [2019-12-07 12:54:08,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:08,334 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 12:54:08,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480338768] [2019-12-07 12:54:08,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:08,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:08,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083223533] [2019-12-07 12:54:08,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:08,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:08,335 INFO L87 Difference]: Start difference. First operand 869 states and 1298 transitions. Second operand 4 states. [2019-12-07 12:54:08,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:08,590 INFO L93 Difference]: Finished difference Result 1765 states and 2642 transitions. [2019-12-07 12:54:08,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:08,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 12:54:08,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:08,592 INFO L225 Difference]: With dead ends: 1765 [2019-12-07 12:54:08,592 INFO L226 Difference]: Without dead ends: 915 [2019-12-07 12:54:08,592 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 12:54:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-12-07 12:54:08,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 869. [2019-12-07 12:54:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 12:54:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1296 transitions. [2019-12-07 12:54:08,615 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1296 transitions. Word has length 160 [2019-12-07 12:54:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:08,615 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1296 transitions. [2019-12-07 12:54:08,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1296 transitions. [2019-12-07 12:54:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 12:54:08,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:08,616 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:08,616 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:08,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:08,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1357963213, now seen corresponding path program 1 times [2019-12-07 12:54:08,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:08,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874017154] [2019-12-07 12:54:08,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:08,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874017154] [2019-12-07 12:54:08,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:08,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:08,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248630504] [2019-12-07 12:54:08,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:08,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:08,663 INFO L87 Difference]: Start difference. First operand 869 states and 1296 transitions. Second operand 4 states. [2019-12-07 12:54:08,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:08,930 INFO L93 Difference]: Finished difference Result 1785 states and 2656 transitions. [2019-12-07 12:54:08,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:08,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 12:54:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:08,931 INFO L225 Difference]: With dead ends: 1785 [2019-12-07 12:54:08,931 INFO L226 Difference]: Without dead ends: 935 [2019-12-07 12:54:08,932 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 12:54:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 935 states. [2019-12-07 12:54:08,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 935 to 893. [2019-12-07 12:54:08,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-12-07 12:54:08,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1324 transitions. [2019-12-07 12:54:08,956 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1324 transitions. Word has length 161 [2019-12-07 12:54:08,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:08,956 INFO L462 AbstractCegarLoop]: Abstraction has 893 states and 1324 transitions. [2019-12-07 12:54:08,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:08,956 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1324 transitions. [2019-12-07 12:54:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 12:54:08,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:08,957 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:08,957 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1425723221, now seen corresponding path program 1 times [2019-12-07 12:54:08,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:08,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697918229] [2019-12-07 12:54:08,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:09,003 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 12:54:09,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697918229] [2019-12-07 12:54:09,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:09,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:09,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171976491] [2019-12-07 12:54:09,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:09,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:09,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:09,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:09,004 INFO L87 Difference]: Start difference. First operand 893 states and 1324 transitions. Second operand 4 states. [2019-12-07 12:54:09,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:09,269 INFO L93 Difference]: Finished difference Result 1801 states and 2672 transitions. [2019-12-07 12:54:09,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:09,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 162 [2019-12-07 12:54:09,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:09,270 INFO L225 Difference]: With dead ends: 1801 [2019-12-07 12:54:09,270 INFO L226 Difference]: Without dead ends: 923 [2019-12-07 12:54:09,270 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 12:54:09,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-07 12:54:09,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 891. [2019-12-07 12:54:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-12-07 12:54:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1320 transitions. [2019-12-07 12:54:09,294 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1320 transitions. Word has length 162 [2019-12-07 12:54:09,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:09,294 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1320 transitions. [2019-12-07 12:54:09,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:09,294 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1320 transitions. [2019-12-07 12:54:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 12:54:09,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:09,295 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] [2019-12-07 12:54:09,295 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1881078131, now seen corresponding path program 1 times [2019-12-07 12:54:09,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:09,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137682512] [2019-12-07 12:54:09,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:09,386 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:09,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137682512] [2019-12-07 12:54:09,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:09,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:54:09,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779788933] [2019-12-07 12:54:09,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:54:09,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:09,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:54:09,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:09,387 INFO L87 Difference]: Start difference. First operand 891 states and 1320 transitions. Second operand 5 states. [2019-12-07 12:54:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:09,858 INFO L93 Difference]: Finished difference Result 1921 states and 2862 transitions. [2019-12-07 12:54:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:54:09,859 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 162 [2019-12-07 12:54:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:09,860 INFO L225 Difference]: With dead ends: 1921 [2019-12-07 12:54:09,860 INFO L226 Difference]: Without dead ends: 1049 [2019-12-07 12:54:09,860 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:54:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-12-07 12:54:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 957. [2019-12-07 12:54:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-07 12:54:09,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1438 transitions. [2019-12-07 12:54:09,885 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1438 transitions. Word has length 162 [2019-12-07 12:54:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:09,885 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1438 transitions. [2019-12-07 12:54:09,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:54:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1438 transitions. [2019-12-07 12:54:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 12:54:09,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:09,886 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:09,886 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:09,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1044817544, now seen corresponding path program 1 times [2019-12-07 12:54:09,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:09,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163337129] [2019-12-07 12:54:09,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:09,933 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:54:09,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163337129] [2019-12-07 12:54:09,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:09,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:09,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043276606] [2019-12-07 12:54:09,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:09,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:09,934 INFO L87 Difference]: Start difference. First operand 957 states and 1438 transitions. Second operand 4 states. [2019-12-07 12:54:10,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:10,201 INFO L93 Difference]: Finished difference Result 1947 states and 2926 transitions. [2019-12-07 12:54:10,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:10,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 12:54:10,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:10,202 INFO L225 Difference]: With dead ends: 1947 [2019-12-07 12:54:10,202 INFO L226 Difference]: Without dead ends: 1009 [2019-12-07 12:54:10,203 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 12:54:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2019-12-07 12:54:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 957. [2019-12-07 12:54:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-07 12:54:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1436 transitions. [2019-12-07 12:54:10,228 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1436 transitions. Word has length 165 [2019-12-07 12:54:10,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:10,228 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1436 transitions. [2019-12-07 12:54:10,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1436 transitions. [2019-12-07 12:54:10,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 12:54:10,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:10,229 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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:10,229 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:10,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:10,229 INFO L82 PathProgramCache]: Analyzing trace with hash -363842409, now seen corresponding path program 1 times [2019-12-07 12:54:10,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:10,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163480218] [2019-12-07 12:54:10,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:10,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:10,275 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 12:54:10,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163480218] [2019-12-07 12:54:10,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:10,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:10,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205574128] [2019-12-07 12:54:10,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:10,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:10,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:10,277 INFO L87 Difference]: Start difference. First operand 957 states and 1436 transitions. Second operand 4 states. [2019-12-07 12:54:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:10,546 INFO L93 Difference]: Finished difference Result 1943 states and 2918 transitions. [2019-12-07 12:54:10,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:10,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 12:54:10,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:10,547 INFO L225 Difference]: With dead ends: 1943 [2019-12-07 12:54:10,547 INFO L226 Difference]: Without dead ends: 1005 [2019-12-07 12:54:10,548 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 12:54:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2019-12-07 12:54:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 957. [2019-12-07 12:54:10,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2019-12-07 12:54:10,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1434 transitions. [2019-12-07 12:54:10,573 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1434 transitions. Word has length 166 [2019-12-07 12:54:10,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:10,573 INFO L462 AbstractCegarLoop]: Abstraction has 957 states and 1434 transitions. [2019-12-07 12:54:10,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:10,573 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1434 transitions. [2019-12-07 12:54:10,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 12:54:10,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:10,574 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:10,574 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:10,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:10,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1900769027, now seen corresponding path program 1 times [2019-12-07 12:54:10,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:10,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997230109] [2019-12-07 12:54:10,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:10,785 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 12:54:10,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997230109] [2019-12-07 12:54:10,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900883013] [2019-12-07 12:54:10,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:10,910 INFO L264 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 12:54:10,924 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:10,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:10,993 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 12:54:10,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,022 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 12:54:11,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,050 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 12:54:11,051 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,068 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,081 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 12:54:11,082 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,121 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:11,121 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 12:54:11,122 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,131 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 12:54:11,131 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 12:54:11,169 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:11,169 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 12:54:11,170 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,177 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:11,203 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:11,203 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 12:54:11,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:11,212 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 12:54:11,215 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 12:54:11,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,259 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:11,259 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 12:54:11,260 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,266 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,267 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:11,291 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:11,291 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 12:54:11,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,297 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,298 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,298 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:11,320 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:11,320 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 12:54:11,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,327 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:11,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:11,333 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 12:54:11,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:11,337 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 12:54:11,338 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 12:54:11,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:11,463 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 12:54:11,464 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 12:54:11,464 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 12:54:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:11,835 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 12:54:12,990 WARN L192 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 12:54:12,991 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 12:54:12,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:12,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 12:54:12,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:12,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:13,001 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 12:54:13,001 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 12:54:13,230 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 12:54:13,234 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 12:54:13,236 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 12:54:13,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:13,372 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 12:54:13,373 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 12:54:13,373 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 12:54:13,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,374 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:13,407 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 12:54:13,407 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 12:54:13,407 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 12:54:13,426 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 12:54:13,429 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 12:54:13,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:13,443 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:13,445 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,446 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,542 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 12:54:13,543 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 12:54:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,547 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:13,676 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 12:54:13,677 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 12:54:13,677 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 12:54:13,677 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 12:54:13,698 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 12:54:13,700 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 12:54:13,700 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 12:54:13,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:13,714 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 12:54:13,715 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:13,725 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:13,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:13,758 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:13,759 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 12:54:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:13,814 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 12:54:16,345 WARN L192 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 12:54:16,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:16,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 12:54:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 12:54:16,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:16,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:16,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 12:54:16,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 12:54:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 12:54:16,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:16,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 12:54:16,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 12:54:16,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 12:54:16,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:16,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 12:54:16,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:16,388 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 12:54:16,388 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 12:54:17,174 WARN L192 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 12:54:17,186 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:54:17,187 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 12:54:17,187 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:17,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:17,197 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 12:54:17,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 12:54:17,231 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 12:54:17,231 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 12:54:17,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:17,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:17,239 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 12:54:17,239 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 12:54:17,434 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 12:54:17,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:17,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 12:54:17,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431896221] [2019-12-07 12:54:17,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:54:17,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:17,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:54:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:54:17,436 INFO L87 Difference]: Start difference. First operand 957 states and 1434 transitions. Second operand 13 states. [2019-12-07 12:54:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:20,587 INFO L93 Difference]: Finished difference Result 3593 states and 5360 transitions. [2019-12-07 12:54:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:54:20,587 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 167 [2019-12-07 12:54:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:20,590 INFO L225 Difference]: With dead ends: 3593 [2019-12-07 12:54:20,591 INFO L226 Difference]: Without dead ends: 2655 [2019-12-07 12:54:20,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 168 SyntacticMatches, 1 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 12:54:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2019-12-07 12:54:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 1784. [2019-12-07 12:54:20,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:54:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2674 transitions. [2019-12-07 12:54:20,671 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2674 transitions. Word has length 167 [2019-12-07 12:54:20,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:20,671 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2674 transitions. [2019-12-07 12:54:20,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:54:20,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2674 transitions. [2019-12-07 12:54:20,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 12:54:20,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:20,673 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] [2019-12-07 12:54:20,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:20,875 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash -456243620, now seen corresponding path program 1 times [2019-12-07 12:54:20,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:20,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625285481] [2019-12-07 12:54:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:20,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625285481] [2019-12-07 12:54:20,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:20,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:20,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349892523] [2019-12-07 12:54:20,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:20,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:20,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:20,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:20,982 INFO L87 Difference]: Start difference. First operand 1784 states and 2674 transitions. Second operand 4 states. [2019-12-07 12:54:21,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:21,353 INFO L93 Difference]: Finished difference Result 2850 states and 4262 transitions. [2019-12-07 12:54:21,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:21,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 12:54:21,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:21,355 INFO L225 Difference]: With dead ends: 2850 [2019-12-07 12:54:21,355 INFO L226 Difference]: Without dead ends: 1912 [2019-12-07 12:54:21,356 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 12:54:21,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-12-07 12:54:21,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-12-07 12:54:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:54:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2670 transitions. [2019-12-07 12:54:21,414 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2670 transitions. Word has length 171 [2019-12-07 12:54:21,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:21,414 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2670 transitions. [2019-12-07 12:54:21,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:21,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2670 transitions. [2019-12-07 12:54:21,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 12:54:21,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:21,415 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] [2019-12-07 12:54:21,415 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:21,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1193301233, now seen corresponding path program 1 times [2019-12-07 12:54:21,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:21,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465750791] [2019-12-07 12:54:21,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:21,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465750791] [2019-12-07 12:54:21,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:21,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:21,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715396581] [2019-12-07 12:54:21,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:21,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:21,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:21,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:21,459 INFO L87 Difference]: Start difference. First operand 1784 states and 2670 transitions. Second operand 4 states. [2019-12-07 12:54:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:21,829 INFO L93 Difference]: Finished difference Result 2850 states and 4256 transitions. [2019-12-07 12:54:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:21,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 12:54:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:21,832 INFO L225 Difference]: With dead ends: 2850 [2019-12-07 12:54:21,832 INFO L226 Difference]: Without dead ends: 1912 [2019-12-07 12:54:21,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-12-07 12:54:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-12-07 12:54:21,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:54:21,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2666 transitions. [2019-12-07 12:54:21,892 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2666 transitions. Word has length 172 [2019-12-07 12:54:21,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:21,892 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2666 transitions. [2019-12-07 12:54:21,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:21,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2666 transitions. [2019-12-07 12:54:21,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 12:54:21,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:21,893 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] [2019-12-07 12:54:21,893 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:21,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:21,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1302488063, now seen corresponding path program 1 times [2019-12-07 12:54:21,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:21,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771935264] [2019-12-07 12:54:21,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:21,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:21,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771935264] [2019-12-07 12:54:21,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:21,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:21,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617918959] [2019-12-07 12:54:21,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:21,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:21,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:21,939 INFO L87 Difference]: Start difference. First operand 1784 states and 2666 transitions. Second operand 4 states. [2019-12-07 12:54:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:22,273 INFO L93 Difference]: Finished difference Result 2850 states and 4250 transitions. [2019-12-07 12:54:22,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:22,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 12:54:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:22,275 INFO L225 Difference]: With dead ends: 2850 [2019-12-07 12:54:22,275 INFO L226 Difference]: Without dead ends: 1912 [2019-12-07 12:54:22,276 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 12:54:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1912 states. [2019-12-07 12:54:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1912 to 1784. [2019-12-07 12:54:22,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:54:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2662 transitions. [2019-12-07 12:54:22,334 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2662 transitions. Word has length 173 [2019-12-07 12:54:22,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:22,334 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2662 transitions. [2019-12-07 12:54:22,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2662 transitions. [2019-12-07 12:54:22,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 12:54:22,335 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:22,335 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] [2019-12-07 12:54:22,335 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:22,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:22,335 INFO L82 PathProgramCache]: Analyzing trace with hash 872450196, now seen corresponding path program 1 times [2019-12-07 12:54:22,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:22,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700625429] [2019-12-07 12:54:22,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:22,380 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:22,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700625429] [2019-12-07 12:54:22,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:22,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:54:22,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785661601] [2019-12-07 12:54:22,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:22,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:22,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:22,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:22,381 INFO L87 Difference]: Start difference. First operand 1784 states and 2662 transitions. Second operand 4 states. [2019-12-07 12:54:22,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:22,921 INFO L93 Difference]: Finished difference Result 2830 states and 4220 transitions. [2019-12-07 12:54:22,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:22,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 12:54:22,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:22,923 INFO L225 Difference]: With dead ends: 2830 [2019-12-07 12:54:22,923 INFO L226 Difference]: Without dead ends: 1892 [2019-12-07 12:54:22,924 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 12:54:22,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2019-12-07 12:54:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1784. [2019-12-07 12:54:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1784 states. [2019-12-07 12:54:22,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2658 transitions. [2019-12-07 12:54:22,988 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2658 transitions. Word has length 174 [2019-12-07 12:54:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:22,988 INFO L462 AbstractCegarLoop]: Abstraction has 1784 states and 2658 transitions. [2019-12-07 12:54:22,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2658 transitions. [2019-12-07 12:54:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 12:54:22,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:22,989 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] [2019-12-07 12:54:22,989 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:22,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash -623839111, now seen corresponding path program 1 times [2019-12-07 12:54:22,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:22,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13687567] [2019-12-07 12:54:22,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 12:54:23,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13687567] [2019-12-07 12:54:23,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:23,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:54:23,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361802200] [2019-12-07 12:54:23,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:54:23,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:23,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:54:23,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:23,064 INFO L87 Difference]: Start difference. First operand 1784 states and 2658 transitions. Second operand 5 states. [2019-12-07 12:54:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:23,468 INFO L93 Difference]: Finished difference Result 4072 states and 6120 transitions. [2019-12-07 12:54:23,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:23,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-12-07 12:54:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:23,469 INFO L225 Difference]: With dead ends: 4072 [2019-12-07 12:54:23,469 INFO L226 Difference]: Without dead ends: 2307 [2019-12-07 12:54:23,470 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 12:54:23,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-12-07 12:54:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 1942. [2019-12-07 12:54:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1942 states. [2019-12-07 12:54:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1942 states to 1942 states and 2944 transitions. [2019-12-07 12:54:23,532 INFO L78 Accepts]: Start accepts. Automaton has 1942 states and 2944 transitions. Word has length 177 [2019-12-07 12:54:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:23,532 INFO L462 AbstractCegarLoop]: Abstraction has 1942 states and 2944 transitions. [2019-12-07 12:54:23,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:54:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states and 2944 transitions. [2019-12-07 12:54:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 12:54:23,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:23,533 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] [2019-12-07 12:54:23,533 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1894627737, now seen corresponding path program 1 times [2019-12-07 12:54:23,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:23,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449605195] [2019-12-07 12:54:23,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 12:54:23,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449605195] [2019-12-07 12:54:23,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:23,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:54:23,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286379846] [2019-12-07 12:54:23,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:54:23,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:54:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:23,605 INFO L87 Difference]: Start difference. First operand 1942 states and 2944 transitions. Second operand 5 states. [2019-12-07 12:54:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:24,018 INFO L93 Difference]: Finished difference Result 4276 states and 6510 transitions. [2019-12-07 12:54:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:24,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-12-07 12:54:24,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:24,020 INFO L225 Difference]: With dead ends: 4276 [2019-12-07 12:54:24,020 INFO L226 Difference]: Without dead ends: 2353 [2019-12-07 12:54:24,021 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 12:54:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-12-07 12:54:24,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2050. [2019-12-07 12:54:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2019-12-07 12:54:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3164 transitions. [2019-12-07 12:54:24,084 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3164 transitions. Word has length 178 [2019-12-07 12:54:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:24,084 INFO L462 AbstractCegarLoop]: Abstraction has 2050 states and 3164 transitions. [2019-12-07 12:54:24,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:54:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3164 transitions. [2019-12-07 12:54:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 12:54:24,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:24,085 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:24,085 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1918301126, now seen corresponding path program 1 times [2019-12-07 12:54:24,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:24,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976526223] [2019-12-07 12:54:24,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:24,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976526223] [2019-12-07 12:54:24,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170700516] [2019-12-07 12:54:24,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:24,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 12:54:24,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:24,440 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,440 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 12:54:24,440 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,473 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,474 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-12-07 12:54:24,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,494 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 12:54:24,495 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,520 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:24,531 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 12:54:24,531 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,572 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:24,572 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 12:54:24,573 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,596 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 12:54:24,596 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 12:54:24,632 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:24,632 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 12:54:24,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,639 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,639 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,639 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:24,664 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:24,664 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 12:54:24,664 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:24,672 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-12-07 12:54:24,673 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 12:54:24,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,719 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:24,720 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 12:54:24,720 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,727 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,727 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:24,752 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:24,752 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 12:54:24,753 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,758 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,758 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,758 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:24,777 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:24,777 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 12:54:24,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:24,786 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 12=[|v_#memory_$Pointer$.base_183|]} [2019-12-07 12:54:24,787 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 12:54:24,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,829 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:24,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 12:54:24,830 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,836 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:24,841 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-12-07 12:54:24,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 12:54:24,844 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,859 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 12:54:24,860 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:24,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:24,947 INFO L343 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-12-07 12:54:24,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 263 [2019-12-07 12:54:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:24,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:24,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:24,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:24,951 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:25,010 INFO L614 ElimStorePlain]: treesize reduction 1074, result has 6.4 percent of original size [2019-12-07 12:54:25,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:25,011 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:182, output treesize:74 [2019-12-07 12:54:25,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 43 treesize of output 31 [2019-12-07 12:54:25,028 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 12:54:25,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:25,039 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 7 [2019-12-07 12:54:25,039 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:25,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:25,046 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:25,046 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2019-12-07 12:54:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 12:54:25,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 12:54:25,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 12:54:25,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947272098] [2019-12-07 12:54:25,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:54:25,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:25,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:54:25,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:54:25,159 INFO L87 Difference]: Start difference. First operand 2050 states and 3164 transitions. Second operand 5 states. [2019-12-07 12:54:25,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:25,992 INFO L93 Difference]: Finished difference Result 5118 states and 7874 transitions. [2019-12-07 12:54:25,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:54:25,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 191 [2019-12-07 12:54:25,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:25,994 INFO L225 Difference]: With dead ends: 5118 [2019-12-07 12:54:25,994 INFO L226 Difference]: Without dead ends: 3087 [2019-12-07 12:54:25,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:54:25,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3087 states. [2019-12-07 12:54:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3087 to 2054. [2019-12-07 12:54:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2019-12-07 12:54:26,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 3168 transitions. [2019-12-07 12:54:26,061 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 3168 transitions. Word has length 191 [2019-12-07 12:54:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:26,061 INFO L462 AbstractCegarLoop]: Abstraction has 2054 states and 3168 transitions. [2019-12-07 12:54:26,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:54:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 3168 transitions. [2019-12-07 12:54:26,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 12:54:26,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:26,062 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:54:26,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:26,263 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:26,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:26,264 INFO L82 PathProgramCache]: Analyzing trace with hash -529007112, now seen corresponding path program 1 times [2019-12-07 12:54:26,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:26,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530843028] [2019-12-07 12:54:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:26,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530843028] [2019-12-07 12:54:26,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310217342] [2019-12-07 12:54:26,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:26,597 INFO L264 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 12:54:26,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:26,630 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,630 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 12:54:26,631 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,662 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.base_185|]} [2019-12-07 12:54:26,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,685 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 12:54:26,686 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:26,715 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 12:54:26,715 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,748 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:26,748 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 12:54:26,748 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,757 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 12:54:26,757 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 12:54:26,786 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:26,787 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 12:54:26,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,793 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,793 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:26,814 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:26,815 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 12:54:26,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,820 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,820 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:26,821 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 12:54:26,823 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 12:54:26,833 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,877 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:26,877 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 12:54:26,877 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,884 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,884 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:26,906 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:26,907 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 12:54:26,907 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,912 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,913 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:26,932 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 12:54:26,932 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 12:54:26,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:26,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 12:54:26,942 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_188|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-12-07 12:54:26,944 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 12:54:26,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:26,995 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:26,996 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 12:54:26,996 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,002 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,002 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:27,005 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 12:54:27,007 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 12:54:27,008 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 12:54:27,016 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,083 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 12:54:27,084 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 12:54:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,086 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,103 INFO L614 ElimStorePlain]: treesize reduction 139, result has 27.6 percent of original size [2019-12-07 12:54:27,104 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,104 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 12:54:27,106 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-12-07 12:54:27,107 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 12:54:27,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,154 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 12:54:27,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 12:54:27,155 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,162 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 12:54:27,165 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-12-07 12:54:27,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 12:54:27,168 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 12:54:27,175 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,241 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 12:54:27,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 12:54:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 12:54:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,246 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 12:54:27,297 INFO L614 ElimStorePlain]: treesize reduction 619, result has 7.9 percent of original size [2019-12-07 12:54:27,297 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,297 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 12:54:27,299 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_191|, |v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_190|], 12=[|v_#memory_$Pointer$.base_202|]} [2019-12-07 12:54:27,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 12:54:27,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,372 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 12:54:27,373 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,412 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 12:54:27,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,450 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 116 treesize of output 88 [2019-12-07 12:54:27,451 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,477 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,478 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 12:54:27,509 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,512 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 12:54:27,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-12-07 12:54:27,526 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,628 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 12:54:27,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 12:54:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 12:54:27,630 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,656 INFO L614 ElimStorePlain]: treesize reduction 48, result has 68.4 percent of original size [2019-12-07 12:54:27,656 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,670 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,671 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,671 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 12:54:27,698 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_183|]} [2019-12-07 12:54:27,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 12:54:27,701 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 12:54:27,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:54:27,720 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 93 treesize of output 45 [2019-12-07 12:54:27,721 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 12:54:27,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,739 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 12:54:27,740 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 12:54:27,740 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:27,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:27,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 12:54:27,745 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-12-07 12:54:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 12:54:27,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:54:27,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 12:54:27,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732764803] [2019-12-07 12:54:27,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:54:27,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:54:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:54:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:54:27,999 INFO L87 Difference]: Start difference. First operand 2054 states and 3168 transitions. Second operand 10 states. [2019-12-07 12:54:29,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:29,732 INFO L93 Difference]: Finished difference Result 5566 states and 8520 transitions. [2019-12-07 12:54:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:54:29,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2019-12-07 12:54:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:29,735 INFO L225 Difference]: With dead ends: 5566 [2019-12-07 12:54:29,735 INFO L226 Difference]: Without dead ends: 3531 [2019-12-07 12:54:29,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 12:54:29,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2019-12-07 12:54:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 2366. [2019-12-07 12:54:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2019-12-07 12:54:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3720 transitions. [2019-12-07 12:54:29,810 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3720 transitions. Word has length 191 [2019-12-07 12:54:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:29,810 INFO L462 AbstractCegarLoop]: Abstraction has 2366 states and 3720 transitions. [2019-12-07 12:54:29,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:54:29,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3720 transitions. [2019-12-07 12:54:29,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-12-07 12:54:29,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:29,812 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, 1, 1, 1] [2019-12-07 12:54:30,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 12:54:30,012 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1233344752, now seen corresponding path program 1 times [2019-12-07 12:54:30,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:54:30,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500078878] [2019-12-07 12:54:30,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:54:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:54:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:54:30,182 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:54:30,182 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:54:30,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:54:30 BoogieIcfgContainer [2019-12-07 12:54:30,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:54:30,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:54:30,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:54:30,294 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:54:30,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:53:34" (3/4) ... [2019-12-07 12:54:30,297 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 12:54:30,297 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:54:30,298 INFO L168 Benchmark]: Toolchain (without parser) took 56547.88 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 534.8 MB). Free memory was 940.7 MB in the beginning and 1.3 GB in the end (delta: -399.9 MB). Peak memory consumption was 134.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,298 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:54:30,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,299 INFO L168 Benchmark]: Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,299 INFO L168 Benchmark]: RCFGBuilder took 698.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 99.8 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,299 INFO L168 Benchmark]: TraceAbstraction took 55320.69 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 428.9 MB). Free memory was 968.2 MB in the beginning and 1.3 GB in the end (delta: -372.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:54:30,299 INFO L168 Benchmark]: Witness Printer took 2.94 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:54:30,300 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -138.0 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 698.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 968.2 MB in the end (delta: 99.8 MB). Peak memory consumption was 99.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 55320.69 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 428.9 MB). Free memory was 968.2 MB in the beginning and 1.3 GB in the end (delta: -372.4 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.94 ms. Allocated memory is still 1.6 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6: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={6: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={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6: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={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6: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={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1594] EXPR s->session [L1594] EXPR s->s3 [L1594] EXPR (s->s3)->tmp.new_cipher [L1594] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1595] COND FALSE !(! tmp___9) [L1601] ret = __VERIFIER_nondet_int() [L1602] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1605] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1611] COND FALSE !(ret <= 0) [L1616] s->state = 8672 [L1617] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1618] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1627] ret = __VERIFIER_nondet_int() [L1628] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1631] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1637] COND FALSE !(ret <= 0) [L1642] s->state = 8448 [L1643] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1643] COND TRUE s->hit [L1644] EXPR s->s3 [L1644] (s->s3)->tmp.next_state = 8640 [L1648] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1750] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Result: UNSAFE, OverallTime: 55.1s, OverallIterations: 120, TraceHistogramMax: 7, AutomataDifference: 37.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 27242 SDtfs, 9977 SDslu, 43276 SDs, 0 SdLazy, 28109 SolverSat, 1493 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1236 GetRequests, 801 SyntacticMatches, 45 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2366occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 119 MinimizatonAttempts, 10685 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 15247 NumberOfCodeBlocks, 15247 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 14929 ConstructedInterpolants, 110 QuantifiedInterpolants, 9939998 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1999 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 122 InterpolantComputations, 117 PerfectInterpolantSequences, 16265/17043 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 12:54:31,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:54:31,708 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:54:31,716 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:54:31,716 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:54:31,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:54:31,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:54:31,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:54:31,722 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:54:31,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:54:31,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:54:31,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:54:31,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:54:31,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:54:31,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:54:31,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:54:31,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:54:31,728 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:54:31,730 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:54:31,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:54:31,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:54:31,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:54:31,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:54:31,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:54:31,738 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:54:31,738 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:54:31,738 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:54:31,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:54:31,739 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:54:31,740 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:54:31,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:54:31,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:54:31,741 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:54:31,742 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:54:31,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:54:31,743 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:54:31,743 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:54:31,744 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:54:31,744 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:54:31,744 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:54:31,745 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:54:31,745 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 12:54:31,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:54:31,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:54:31,759 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:54:31,760 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:54:31,760 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:54:31,760 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:54:31,760 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:54:31,760 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:54:31,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:54:31,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:54:31,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:54:31,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:54:31,761 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 12:54:31,762 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 12:54:31,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:54:31,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:54:31,762 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:54:31,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:54:31,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:54:31,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:54:31,763 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:54:31,763 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:54:31,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:54:31,764 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:54:31,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:54:31,764 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:54:31,764 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 12:54:31,764 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 12:54:31,764 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:54:31,765 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:54:31,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:54:31,765 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_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 -> 8ae4fea535defe079744031ef9589bd179b2820b [2019-12-07 12:54:31,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:54:31,949 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:54:31,951 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:54:31,952 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:54:31,953 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:54:31,953 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:54:31,994 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/2f6dba032/eabfd894cd0647e98e8a0f056ef7fe26/FLAG7565f8b2c [2019-12-07 12:54:32,511 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:54:32,512 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/sv-benchmarks/c/ssh/s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:54:32,525 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/2f6dba032/eabfd894cd0647e98e8a0f056ef7fe26/FLAG7565f8b2c [2019-12-07 12:54:32,975 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/data/2f6dba032/eabfd894cd0647e98e8a0f056ef7fe26 [2019-12-07 12:54:32,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:54:32,979 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:54:32,979 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:54:32,979 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:54:32,982 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:54:32,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:54:32" (1/1) ... [2019-12-07 12:54:32,984 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 12:54:32, skipping insertion in model container [2019-12-07 12:54:32,984 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:54:32" (1/1) ... [2019-12-07 12:54:32,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:54:33,025 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:54:33,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:54:33,321 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:54:33,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:54:33,403 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:54:33,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33 WrapperNode [2019-12-07 12:54:33,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:54:33,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:54:33,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:54:33,404 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:54:33,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:54:33,458 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:54:33,458 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:54:33,458 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:54:33,465 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,472 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... [2019-12-07 12:54:33,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:54:33,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:54:33,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:54:33,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:54:33,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 12:54:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:54:33,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 12:54:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 12:54:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 12:54:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:54:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:54:33,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 12:54:33,676 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 12:54:36,321 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 12:54:36,321 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 12:54:36,322 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:54:36,323 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 12:54:36,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:36 BoogieIcfgContainer [2019-12-07 12:54:36,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:54:36,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:54:36,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:54:36,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:54:36,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:54:32" (1/3) ... [2019-12-07 12:54:36,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347a9d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:54:36, skipping insertion in model container [2019-12-07 12:54:36,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:54:33" (2/3) ... [2019-12-07 12:54:36,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@347a9d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:54:36, skipping insertion in model container [2019-12-07 12:54:36,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:36" (3/3) ... [2019-12-07 12:54:36,330 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.14.i.cil-2.c [2019-12-07 12:54:36,336 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:54:36,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 12:54:36,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 12:54:36,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:54:36,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:54:36,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:54:36,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:54:36,367 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:54:36,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:54:36,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:54:36,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:54:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states. [2019-12-07 12:54:36,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 12:54:36,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:36,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:36,391 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:36,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:36,395 INFO L82 PathProgramCache]: Analyzing trace with hash 557484008, now seen corresponding path program 1 times [2019-12-07 12:54:36,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:54:36,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60611280] [2019-12-07 12:54:36,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:36,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:54:36,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:36,636 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:54:36,637 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:54:36,637 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:36,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:36,648 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:36,648 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:54:36,681 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:54:36,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:54:36,685 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:36,688 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:36,689 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:36,689 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:54:36,696 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 12:54:36,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:36,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:36,699 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 12:54:36,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:54:36,715 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 12:54:36,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:54:36,734 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 12:54:36,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60611280] [2019-12-07 12:54:36,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:36,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:54:36,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433573794] [2019-12-07 12:54:36,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:36,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:54:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:36,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:36,751 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 4 states. [2019-12-07 12:54:39,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:39,254 INFO L93 Difference]: Finished difference Result 333 states and 567 transitions. [2019-12-07 12:54:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:39,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-07 12:54:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:39,265 INFO L225 Difference]: With dead ends: 333 [2019-12-07 12:54:39,265 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 12:54:39,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 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 12:54:39,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 12:54:39,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 151. [2019-12-07 12:54:39,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-12-07 12:54:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 236 transitions. [2019-12-07 12:54:39,300 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 236 transitions. Word has length 42 [2019-12-07 12:54:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:39,301 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 236 transitions. [2019-12-07 12:54:39,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 236 transitions. [2019-12-07 12:54:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 12:54:39,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:39,303 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:39,503 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 12:54:39,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:39,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:39,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1860834976, now seen corresponding path program 1 times [2019-12-07 12:54:39,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:54:39,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003815686] [2019-12-07 12:54:39,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:39,695 INFO L264 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:54:39,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:39,711 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:54:39,712 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:54:39,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:39,719 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:39,720 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:39,720 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:54:39,739 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:54:39,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:54:39,740 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:39,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:39,743 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:39,743 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:54:39,748 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 12:54:39,748 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:39,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:39,750 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 12:54:39,750 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:54:39,759 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 12:54:39,760 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:54:39,789 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 12:54:39,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003815686] [2019-12-07 12:54:39,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:39,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:54:39,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055332302] [2019-12-07 12:54:39,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:54:39,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:54:39,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:54:39,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:54:39,791 INFO L87 Difference]: Start difference. First operand 151 states and 236 transitions. Second operand 6 states. [2019-12-07 12:54:47,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:47,551 INFO L93 Difference]: Finished difference Result 423 states and 657 transitions. [2019-12-07 12:54:47,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:54:47,552 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 12:54:47,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:47,554 INFO L225 Difference]: With dead ends: 423 [2019-12-07 12:54:47,554 INFO L226 Difference]: Without dead ends: 291 [2019-12-07 12:54:47,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:54:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-12-07 12:54:47,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 167. [2019-12-07 12:54:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-12-07 12:54:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 261 transitions. [2019-12-07 12:54:47,566 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 261 transitions. Word has length 55 [2019-12-07 12:54:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:47,567 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 261 transitions. [2019-12-07 12:54:47,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:54:47,567 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 261 transitions. [2019-12-07 12:54:47,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:54:47,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:47,569 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:47,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 12:54:47,770 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash -2101358450, now seen corresponding path program 1 times [2019-12-07 12:54:47,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:54:47,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126925124] [2019-12-07 12:54:47,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:47,920 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:54:47,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:47,926 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 12:54:47,929 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 12:54:47,930 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 12:54:47,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:47,944 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 12:54:47,944 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 12:54:47,953 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:47,985 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:47,986 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 12:54:47,986 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:56,093 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 12:54:56,094 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:56,095 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:56,095 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 12:54:56,103 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 12:54:56,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:56,105 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:56,105 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 12:54:56,105 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:54:56,113 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 12:54:56,113 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:54:56,120 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 12:54:56,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126925124] [2019-12-07 12:54:56,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:56,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 12:54:56,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054365628] [2019-12-07 12:54:56,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:54:56,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:54:56,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:54:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:54:56,122 INFO L87 Difference]: Start difference. First operand 167 states and 261 transitions. Second operand 4 states. [2019-12-07 12:54:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:54:58,841 INFO L93 Difference]: Finished difference Result 344 states and 536 transitions. [2019-12-07 12:54:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:54:58,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 12:54:58,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:54:58,844 INFO L225 Difference]: With dead ends: 344 [2019-12-07 12:54:58,844 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 12:54:58,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:54:58,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 12:54:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 183. [2019-12-07 12:54:58,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-12-07 12:54:58,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 287 transitions. [2019-12-07 12:54:58,856 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 287 transitions. Word has length 56 [2019-12-07 12:54:58,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:54:58,856 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 287 transitions. [2019-12-07 12:54:58,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:54:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 287 transitions. [2019-12-07 12:54:58,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:54:58,858 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:54:58,858 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:54:59,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 12:54:59,060 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:54:59,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:54:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1331085059, now seen corresponding path program 1 times [2019-12-07 12:54:59,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:54:59,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468362418] [2019-12-07 12:54:59,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:54:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:54:59,242 INFO L264 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:54:59,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:54:59,260 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:54:59,261 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:54:59,261 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:59,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:59,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:59,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:54:59,296 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:54:59,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:54:59,297 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:59,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:59,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:54:59,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:54:59,303 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 12:54:59,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:54:59,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:54:59,305 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 12:54:59,305 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:54:59,314 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 12:54:59,314 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:54:59,340 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 12:54:59,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468362418] [2019-12-07 12:54:59,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:54:59,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:54:59,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345250999] [2019-12-07 12:54:59,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:54:59,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:54:59,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:54:59,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:54:59,342 INFO L87 Difference]: Start difference. First operand 183 states and 287 transitions. Second operand 6 states. [2019-12-07 12:55:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:06,399 INFO L93 Difference]: Finished difference Result 469 states and 731 transitions. [2019-12-07 12:55:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:06,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 12:55:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:06,401 INFO L225 Difference]: With dead ends: 469 [2019-12-07 12:55:06,401 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 12:55:06,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 12:55:06,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 184. [2019-12-07 12:55:06,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 12:55:06,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 287 transitions. [2019-12-07 12:55:06,411 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 287 transitions. Word has length 56 [2019-12-07 12:55:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:06,411 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 287 transitions. [2019-12-07 12:55:06,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:06,411 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 287 transitions. [2019-12-07 12:55:06,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 12:55:06,413 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:06,413 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:06,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 12:55:06,614 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:06,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:06,614 INFO L82 PathProgramCache]: Analyzing trace with hash 10231747, now seen corresponding path program 1 times [2019-12-07 12:55:06,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:06,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379033442] [2019-12-07 12:55:06,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:06,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:55:06,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:06,702 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 12:55:06,702 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:06,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:06,705 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:06,705 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:06,714 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 12:55:06,715 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:06,716 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:06,717 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 12:55:06,717 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:55:06,726 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 12:55:06,726 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:06,748 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 12:55:06,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379033442] [2019-12-07 12:55:06,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:06,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:06,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507916478] [2019-12-07 12:55:06,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:06,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:06,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:06,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:06,750 INFO L87 Difference]: Start difference. First operand 184 states and 287 transitions. Second operand 6 states. [2019-12-07 12:55:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:14,328 INFO L93 Difference]: Finished difference Result 581 states and 907 transitions. [2019-12-07 12:55:14,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:14,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 12:55:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:14,331 INFO L225 Difference]: With dead ends: 581 [2019-12-07 12:55:14,331 INFO L226 Difference]: Without dead ends: 416 [2019-12-07 12:55:14,332 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:14,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2019-12-07 12:55:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 224. [2019-12-07 12:55:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 12:55:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 358 transitions. [2019-12-07 12:55:14,347 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 358 transitions. Word has length 56 [2019-12-07 12:55:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:14,347 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 358 transitions. [2019-12-07 12:55:14,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:14,348 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 358 transitions. [2019-12-07 12:55:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 12:55:14,348 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:14,348 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:14,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 12:55:14,549 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:14,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:14,550 INFO L82 PathProgramCache]: Analyzing trace with hash 75987855, now seen corresponding path program 1 times [2019-12-07 12:55:14,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:14,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827773470] [2019-12-07 12:55:14,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:14,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:55:14,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:14,659 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 12:55:14,660 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:14,662 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:14,662 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:14,663 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:14,670 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 12:55:14,670 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:14,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:14,671 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 12:55:14,671 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:55:14,682 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 12:55:14,682 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:14,703 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 12:55:14,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827773470] [2019-12-07 12:55:14,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:14,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:14,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407261940] [2019-12-07 12:55:14,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:14,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:14,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:14,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:14,705 INFO L87 Difference]: Start difference. First operand 224 states and 358 transitions. Second operand 6 states. [2019-12-07 12:55:19,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:19,862 INFO L93 Difference]: Finished difference Result 636 states and 1011 transitions. [2019-12-07 12:55:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:19,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 12:55:19,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:19,866 INFO L225 Difference]: With dead ends: 636 [2019-12-07 12:55:19,866 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 12:55:19,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:19,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 12:55:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 247. [2019-12-07 12:55:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-12-07 12:55:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 403 transitions. [2019-12-07 12:55:19,875 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 403 transitions. Word has length 57 [2019-12-07 12:55:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 403 transitions. [2019-12-07 12:55:19,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:19,875 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 403 transitions. [2019-12-07 12:55:19,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-07 12:55:19,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:19,877 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:55:20,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 12:55:20,078 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:20,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1581561878, now seen corresponding path program 1 times [2019-12-07 12:55:20,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:20,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899446067] [2019-12-07 12:55:20,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:20,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:55:20,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:20,232 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 12:55:20,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:20,235 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:20,235 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:20,235 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:20,242 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 12:55:20,242 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:20,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:20,244 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 12:55:20,244 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:55:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:20,255 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:20,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899446067] [2019-12-07 12:55:20,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:20,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:20,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021589212] [2019-12-07 12:55:20,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:20,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:20,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:20,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:20,282 INFO L87 Difference]: Start difference. First operand 247 states and 403 transitions. Second operand 6 states. [2019-12-07 12:55:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:27,094 INFO L93 Difference]: Finished difference Result 732 states and 1188 transitions. [2019-12-07 12:55:27,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:27,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2019-12-07 12:55:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:27,098 INFO L225 Difference]: With dead ends: 732 [2019-12-07 12:55:27,098 INFO L226 Difference]: Without dead ends: 504 [2019-12-07 12:55:27,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:27,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-12-07 12:55:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 311. [2019-12-07 12:55:27,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-12-07 12:55:27,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 515 transitions. [2019-12-07 12:55:27,108 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 515 transitions. Word has length 85 [2019-12-07 12:55:27,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:27,109 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 515 transitions. [2019-12-07 12:55:27,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:27,109 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 515 transitions. [2019-12-07 12:55:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 12:55:27,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:27,110 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:27,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 12:55:27,311 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:27,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:27,311 INFO L82 PathProgramCache]: Analyzing trace with hash 9838369, now seen corresponding path program 1 times [2019-12-07 12:55:27,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:27,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227567890] [2019-12-07 12:55:27,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:27,430 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:55:27,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:27,436 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 12:55:27,437 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:27,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:27,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:27,440 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:27,450 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 12:55:27,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:27,452 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:27,452 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 12:55:27,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:55:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:27,466 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:27,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227567890] [2019-12-07 12:55:27,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:27,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:27,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344452308] [2019-12-07 12:55:27,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:27,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:27,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:27,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:27,496 INFO L87 Difference]: Start difference. First operand 311 states and 515 transitions. Second operand 6 states. [2019-12-07 12:55:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:35,373 INFO L93 Difference]: Finished difference Result 824 states and 1343 transitions. [2019-12-07 12:55:35,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:35,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-12-07 12:55:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:35,376 INFO L225 Difference]: With dead ends: 824 [2019-12-07 12:55:35,376 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 12:55:35,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 12:55:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 348. [2019-12-07 12:55:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 579 transitions. [2019-12-07 12:55:35,385 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 579 transitions. Word has length 91 [2019-12-07 12:55:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:35,385 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 579 transitions. [2019-12-07 12:55:35,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 579 transitions. [2019-12-07 12:55:35,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 12:55:35,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:35,386 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:35,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 12:55:35,588 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:35,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:35,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2055256971, now seen corresponding path program 1 times [2019-12-07 12:55:35,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:35,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049423033] [2019-12-07 12:55:35,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:35,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:35,722 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:55:35,724 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:35,727 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 12:55:35,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:35,729 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:35,729 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:35,730 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:55:35,737 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 12:55:35,737 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:35,739 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:35,739 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 12:55:35,739 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:55:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:35,753 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:55:35,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049423033] [2019-12-07 12:55:35,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:35,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:35,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759072739] [2019-12-07 12:55:35,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:35,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:35,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:35,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:35,779 INFO L87 Difference]: Start difference. First operand 348 states and 579 transitions. Second operand 6 states. [2019-12-07 12:55:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:41,107 INFO L93 Difference]: Finished difference Result 855 states and 1396 transitions. [2019-12-07 12:55:41,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:41,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-07 12:55:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:41,110 INFO L225 Difference]: With dead ends: 855 [2019-12-07 12:55:41,111 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 12:55:41,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:41,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 12:55:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 348. [2019-12-07 12:55:41,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:41,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 577 transitions. [2019-12-07 12:55:41,121 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 577 transitions. Word has length 92 [2019-12-07 12:55:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:41,121 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 577 transitions. [2019-12-07 12:55:41,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 577 transitions. [2019-12-07 12:55:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:55:41,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:41,122 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:41,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 12:55:41,323 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:41,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash -413108077, now seen corresponding path program 1 times [2019-12-07 12:55:41,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:41,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51332888] [2019-12-07 12:55:41,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:41,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:55:41,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:41,567 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:55:41,567 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:55:41,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:41,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:41,575 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:41,575 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:55:41,594 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:55:41,594 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:55:41,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:41,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:41,597 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:41,597 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:55:41,600 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 12:55:41,600 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:41,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:41,602 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 12:55:41,602 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:55:41,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:41,612 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:41,642 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:41,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51332888] [2019-12-07 12:55:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:41,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:41,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222003515] [2019-12-07 12:55:41,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:41,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:41,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:41,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:41,643 INFO L87 Difference]: Start difference. First operand 348 states and 577 transitions. Second operand 6 states. [2019-12-07 12:55:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:50,758 INFO L93 Difference]: Finished difference Result 773 states and 1262 transitions. [2019-12-07 12:55:50,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:50,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 12:55:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:50,760 INFO L225 Difference]: With dead ends: 773 [2019-12-07 12:55:50,760 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 12:55:50,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:50,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 12:55:50,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 348. [2019-12-07 12:55:50,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 570 transitions. [2019-12-07 12:55:50,768 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 570 transitions. Word has length 98 [2019-12-07 12:55:50,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:50,768 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 570 transitions. [2019-12-07 12:55:50,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:50,769 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 570 transitions. [2019-12-07 12:55:50,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 12:55:50,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:50,769 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:50,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 12:55:50,970 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:50,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:50,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1760744063, now seen corresponding path program 1 times [2019-12-07 12:55:50,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:50,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896740376] [2019-12-07 12:55:50,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:51,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:55:51,196 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:51,214 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:55:51,214 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:55:51,214 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:51,222 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:51,222 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:51,222 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:55:51,240 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:55:51,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:55:51,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:51,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:51,244 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:51,244 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:55:51,246 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 12:55:51,246 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:51,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:51,248 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 12:55:51,248 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:55:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:51,258 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:51,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896740376] [2019-12-07 12:55:51,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:51,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:51,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995512053] [2019-12-07 12:55:51,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:51,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:51,287 INFO L87 Difference]: Start difference. First operand 348 states and 570 transitions. Second operand 6 states. [2019-12-07 12:55:56,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:55:56,193 INFO L93 Difference]: Finished difference Result 773 states and 1249 transitions. [2019-12-07 12:55:56,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:55:56,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 12:55:56,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:55:56,196 INFO L225 Difference]: With dead ends: 773 [2019-12-07 12:55:56,196 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 12:55:56,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:55:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 12:55:56,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 348. [2019-12-07 12:55:56,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:55:56,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 563 transitions. [2019-12-07 12:55:56,202 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 563 transitions. Word has length 98 [2019-12-07 12:55:56,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:55:56,203 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 563 transitions. [2019-12-07 12:55:56,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:55:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 563 transitions. [2019-12-07 12:55:56,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:55:56,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:55:56,204 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:55:56,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 12:55:56,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:55:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:55:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1904126404, now seen corresponding path program 1 times [2019-12-07 12:55:56,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:55:56,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756759607] [2019-12-07 12:55:56,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:55:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:55:56,614 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:55:56,616 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:55:56,632 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:55:56,632 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:55:56,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:56,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:56,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:56,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:55:56,661 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:55:56,662 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:55:56,662 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:56,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:56,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:55:56,665 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:55:56,668 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 12:55:56,668 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:55:56,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:55:56,669 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 12:55:56,669 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:55:56,680 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:56,680 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:55:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:55:56,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756759607] [2019-12-07 12:55:56,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:55:56,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:55:56,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398588585] [2019-12-07 12:55:56,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:55:56,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:55:56,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:55:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:55:56,709 INFO L87 Difference]: Start difference. First operand 348 states and 563 transitions. Second operand 6 states. [2019-12-07 12:56:01,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:01,932 INFO L93 Difference]: Finished difference Result 773 states and 1236 transitions. [2019-12-07 12:56:01,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:01,932 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 12:56:01,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:01,934 INFO L225 Difference]: With dead ends: 773 [2019-12-07 12:56:01,934 INFO L226 Difference]: Without dead ends: 444 [2019-12-07 12:56:01,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:01,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-07 12:56:01,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 348. [2019-12-07 12:56:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-12-07 12:56:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 556 transitions. [2019-12-07 12:56:01,941 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 556 transitions. Word has length 99 [2019-12-07 12:56:01,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:01,941 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 556 transitions. [2019-12-07 12:56:01,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 556 transitions. [2019-12-07 12:56:01,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 12:56:01,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:01,942 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 12:56:02,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 12:56:02,143 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:02,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1483588637, now seen corresponding path program 1 times [2019-12-07 12:56:02,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:02,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446102059] [2019-12-07 12:56:02,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:56:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:02,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:02,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:02,322 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 12:56:02,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:02,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:02,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:02,325 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:02,332 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 12:56:02,333 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:02,334 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:02,334 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 12:56:02,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:56:02,348 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:56:02,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446102059] [2019-12-07 12:56:02,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:02,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:02,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760597948] [2019-12-07 12:56:02,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:02,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:02,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:02,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:02,379 INFO L87 Difference]: Start difference. First operand 348 states and 556 transitions. Second operand 6 states. [2019-12-07 12:56:08,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:08,765 INFO L93 Difference]: Finished difference Result 893 states and 1412 transitions. [2019-12-07 12:56:08,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:08,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 12:56:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:08,769 INFO L225 Difference]: With dead ends: 893 [2019-12-07 12:56:08,769 INFO L226 Difference]: Without dead ends: 564 [2019-12-07 12:56:08,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:08,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-07 12:56:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 391. [2019-12-07 12:56:08,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 12:56:08,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 626 transitions. [2019-12-07 12:56:08,776 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 626 transitions. Word has length 99 [2019-12-07 12:56:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:08,777 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 626 transitions. [2019-12-07 12:56:08,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 626 transitions. [2019-12-07 12:56:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 12:56:08,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:08,777 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:08,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 12:56:08,978 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:08,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 109755514, now seen corresponding path program 1 times [2019-12-07 12:56:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842604435] [2019-12-07 12:56:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/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 12:56:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:09,227 INFO L264 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:56:09,228 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:09,243 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:56:09,243 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:56:09,243 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:09,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:09,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:09,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:56:09,273 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:56:09,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:56:09,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:09,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:09,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:09,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:56:09,278 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 12:56:09,278 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:09,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:09,279 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 12:56:09,279 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:56:09,292 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:56:09,292 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:56:09,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842604435] [2019-12-07 12:56:09,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:09,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:09,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596008604] [2019-12-07 12:56:09,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:09,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:09,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:09,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:09,324 INFO L87 Difference]: Start difference. First operand 391 states and 626 transitions. Second operand 6 states. [2019-12-07 12:56:14,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:14,889 INFO L93 Difference]: Finished difference Result 859 states and 1363 transitions. [2019-12-07 12:56:14,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:14,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 12:56:14,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:14,891 INFO L225 Difference]: With dead ends: 859 [2019-12-07 12:56:14,891 INFO L226 Difference]: Without dead ends: 487 [2019-12-07 12:56:14,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-12-07 12:56:14,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 391. [2019-12-07 12:56:14,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-12-07 12:56:14,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 618 transitions. [2019-12-07 12:56:14,898 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 618 transitions. Word has length 100 [2019-12-07 12:56:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:14,899 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 618 transitions. [2019-12-07 12:56:14,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:14,899 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 618 transitions. [2019-12-07 12:56:14,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 12:56:14,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:14,899 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 12:56:15,100 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 12:56:15,100 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:15,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:15,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1274404753, now seen corresponding path program 1 times [2019-12-07 12:56:15,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:15,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759907033] [2019-12-07 12:56:15,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:15,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:15,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:15,272 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 12:56:15,273 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:15,275 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:15,275 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:15,275 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:15,282 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 12:56:15,282 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:15,284 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:15,284 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 12:56:15,284 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:15,298 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:56:15,298 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:56:15,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759907033] [2019-12-07 12:56:15,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:15,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:15,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609314409] [2019-12-07 12:56:15,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:15,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:15,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:15,325 INFO L87 Difference]: Start difference. First operand 391 states and 618 transitions. Second operand 6 states. [2019-12-07 12:56:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:23,791 INFO L93 Difference]: Finished difference Result 935 states and 1464 transitions. [2019-12-07 12:56:23,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:23,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 12:56:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:23,794 INFO L225 Difference]: With dead ends: 935 [2019-12-07 12:56:23,795 INFO L226 Difference]: Without dead ends: 559 [2019-12-07 12:56:23,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2019-12-07 12:56:23,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 393. [2019-12-07 12:56:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 12:56:23,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 621 transitions. [2019-12-07 12:56:23,802 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 621 transitions. Word has length 100 [2019-12-07 12:56:23,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:23,803 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 621 transitions. [2019-12-07 12:56:23,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:23,803 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 621 transitions. [2019-12-07 12:56:23,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 12:56:23,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:23,804 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:24,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 12:56:24,005 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash 2071302231, now seen corresponding path program 1 times [2019-12-07 12:56:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:24,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080369753] [2019-12-07 12:56:24,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:24,275 INFO L264 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 12:56:24,277 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:24,291 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 12:56:24,291 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 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 12:56:24,291 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:24,300 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:24,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:24,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 12:56:24,319 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 12:56:24,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 12:56:24,320 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:24,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:24,322 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:24,322 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 12:56:24,324 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 12:56:24,325 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:24,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:24,326 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 12:56:24,326 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 12:56:24,336 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:56:24,336 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:24,364 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 12:56:24,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080369753] [2019-12-07 12:56:24,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:24,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:24,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857840759] [2019-12-07 12:56:24,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:24,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:24,365 INFO L87 Difference]: Start difference. First operand 393 states and 621 transitions. Second operand 6 states. [2019-12-07 12:56:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:29,820 INFO L93 Difference]: Finished difference Result 839 states and 1321 transitions. [2019-12-07 12:56:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:29,821 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 12:56:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:29,823 INFO L225 Difference]: With dead ends: 839 [2019-12-07 12:56:29,823 INFO L226 Difference]: Without dead ends: 465 [2019-12-07 12:56:29,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-12-07 12:56:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 393. [2019-12-07 12:56:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2019-12-07 12:56:29,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 613 transitions. [2019-12-07 12:56:29,834 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 613 transitions. Word has length 101 [2019-12-07 12:56:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:29,834 INFO L462 AbstractCegarLoop]: Abstraction has 393 states and 613 transitions. [2019-12-07 12:56:29,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 613 transitions. [2019-12-07 12:56:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 12:56:29,835 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:29,835 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:30,036 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 12:56:30,036 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:30,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1522687931, now seen corresponding path program 1 times [2019-12-07 12:56:30,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:30,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226212297] [2019-12-07 12:56:30,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:30,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:30,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:30,195 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 12:56:30,195 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:30,197 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:30,197 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:30,197 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:30,205 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 12:56:30,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:30,207 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:30,207 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 12:56:30,207 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:30,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:30,249 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:30,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226212297] [2019-12-07 12:56:30,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:30,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:30,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755708023] [2019-12-07 12:56:30,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:30,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:30,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:30,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:30,250 INFO L87 Difference]: Start difference. First operand 393 states and 613 transitions. Second operand 6 states. [2019-12-07 12:56:37,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:37,747 INFO L93 Difference]: Finished difference Result 955 states and 1484 transitions. [2019-12-07 12:56:37,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:37,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-07 12:56:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:37,751 INFO L225 Difference]: With dead ends: 955 [2019-12-07 12:56:37,751 INFO L226 Difference]: Without dead ends: 581 [2019-12-07 12:56:37,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:37,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-12-07 12:56:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 423. [2019-12-07 12:56:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-07 12:56:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 655 transitions. [2019-12-07 12:56:37,762 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 655 transitions. Word has length 112 [2019-12-07 12:56:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:37,763 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 655 transitions. [2019-12-07 12:56:37,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 655 transitions. [2019-12-07 12:56:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 12:56:37,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:37,764 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:37,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 12:56:37,965 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:37,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:37,966 INFO L82 PathProgramCache]: Analyzing trace with hash 317458444, now seen corresponding path program 1 times [2019-12-07 12:56:37,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:37,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953078973] [2019-12-07 12:56:37,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:38,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:38,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:38,104 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 12:56:38,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:38,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:38,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:38,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:38,114 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 12:56:38,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:38,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:38,116 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 12:56:38,116 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:38,130 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:38,130 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953078973] [2019-12-07 12:56:38,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:38,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:38,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971790328] [2019-12-07 12:56:38,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:38,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:38,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:38,157 INFO L87 Difference]: Start difference. First operand 423 states and 655 transitions. Second operand 6 states. [2019-12-07 12:56:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:44,980 INFO L93 Difference]: Finished difference Result 971 states and 1499 transitions. [2019-12-07 12:56:44,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:44,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-12-07 12:56:44,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:44,984 INFO L225 Difference]: With dead ends: 971 [2019-12-07 12:56:44,984 INFO L226 Difference]: Without dead ends: 567 [2019-12-07 12:56:44,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-12-07 12:56:44,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 423. [2019-12-07 12:56:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-12-07 12:56:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 649 transitions. [2019-12-07 12:56:44,991 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 649 transitions. Word has length 113 [2019-12-07 12:56:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:44,992 INFO L462 AbstractCegarLoop]: Abstraction has 423 states and 649 transitions. [2019-12-07 12:56:44,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 649 transitions. [2019-12-07 12:56:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 12:56:44,992 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:44,993 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:45,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 12:56:45,194 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -910081536, now seen corresponding path program 1 times [2019-12-07 12:56:45,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:45,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515054420] [2019-12-07 12:56:45,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:45,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:45,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:45,366 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:45,370 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 12:56:45,370 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:45,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:45,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:45,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:45,378 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 12:56:45,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:45,379 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:45,379 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 12:56:45,379 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:45,394 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:45,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515054420] [2019-12-07 12:56:45,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:45,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:45,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161317018] [2019-12-07 12:56:45,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:45,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:45,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:45,425 INFO L87 Difference]: Start difference. First operand 423 states and 649 transitions. Second operand 6 states. [2019-12-07 12:56:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:56:54,442 INFO L93 Difference]: Finished difference Result 1013 states and 1550 transitions. [2019-12-07 12:56:54,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:56:54,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-07 12:56:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:56:54,446 INFO L225 Difference]: With dead ends: 1013 [2019-12-07 12:56:54,446 INFO L226 Difference]: Without dead ends: 609 [2019-12-07 12:56:54,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:56:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-12-07 12:56:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 451. [2019-12-07 12:56:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-07 12:56:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 686 transitions. [2019-12-07 12:56:54,457 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 686 transitions. Word has length 116 [2019-12-07 12:56:54,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:56:54,457 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 686 transitions. [2019-12-07 12:56:54,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:56:54,457 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 686 transitions. [2019-12-07 12:56:54,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 12:56:54,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:56:54,459 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:56:54,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 12:56:54,660 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:56:54,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:56:54,660 INFO L82 PathProgramCache]: Analyzing trace with hash -532890905, now seen corresponding path program 1 times [2019-12-07 12:56:54,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:56:54,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628217957] [2019-12-07 12:56:54,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 12:56:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:56:54,830 INFO L264 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:56:54,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:56:54,834 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 12:56:54,834 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:54,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:54,837 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:56:54,837 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:56:54,843 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 12:56:54,843 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:56:54,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:56:54,845 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 12:56:54,845 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:56:54,859 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:54,859 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:56:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 12:56:54,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628217957] [2019-12-07 12:56:54,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:56:54,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:56:54,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734247342] [2019-12-07 12:56:54,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:56:54,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:56:54,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:56:54,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:56:54,885 INFO L87 Difference]: Start difference. First operand 451 states and 686 transitions. Second operand 6 states. [2019-12-07 12:57:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:00,798 INFO L93 Difference]: Finished difference Result 1019 states and 1546 transitions. [2019-12-07 12:57:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:00,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-12-07 12:57:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:00,801 INFO L225 Difference]: With dead ends: 1019 [2019-12-07 12:57:00,801 INFO L226 Difference]: Without dead ends: 587 [2019-12-07 12:57:00,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-12-07 12:57:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 451. [2019-12-07 12:57:00,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2019-12-07 12:57:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 679 transitions. [2019-12-07 12:57:00,809 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 679 transitions. Word has length 117 [2019-12-07 12:57:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:00,809 INFO L462 AbstractCegarLoop]: Abstraction has 451 states and 679 transitions. [2019-12-07 12:57:00,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 679 transitions. [2019-12-07 12:57:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 12:57:00,810 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:00,810 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:01,011 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 12:57:01,011 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:01,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:01,011 INFO L82 PathProgramCache]: Analyzing trace with hash 594299083, now seen corresponding path program 1 times [2019-12-07 12:57:01,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:01,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003551913] [2019-12-07 12:57:01,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:01,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:01,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:01,129 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 12:57:01,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:01,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:01,131 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:01,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:01,139 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 12:57:01,139 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:01,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:01,141 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 12:57:01,141 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:57:01,158 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:57:01,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003551913] [2019-12-07 12:57:01,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:01,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:01,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981099704] [2019-12-07 12:57:01,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:01,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:01,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:01,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:01,189 INFO L87 Difference]: Start difference. First operand 451 states and 679 transitions. Second operand 6 states. [2019-12-07 12:57:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:09,425 INFO L93 Difference]: Finished difference Result 1061 states and 1593 transitions. [2019-12-07 12:57:09,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:09,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-12-07 12:57:09,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:09,428 INFO L225 Difference]: With dead ends: 1061 [2019-12-07 12:57:09,428 INFO L226 Difference]: Without dead ends: 629 [2019-12-07 12:57:09,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-12-07 12:57:09,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 486. [2019-12-07 12:57:09,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-07 12:57:09,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 728 transitions. [2019-12-07 12:57:09,437 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 728 transitions. Word has length 124 [2019-12-07 12:57:09,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:09,437 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 728 transitions. [2019-12-07 12:57:09,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:09,437 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 728 transitions. [2019-12-07 12:57:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 12:57:09,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:09,438 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:09,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 12:57:09,639 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:09,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:09,640 INFO L82 PathProgramCache]: Analyzing trace with hash -124951209, now seen corresponding path program 1 times [2019-12-07 12:57:09,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:09,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977278990] [2019-12-07 12:57:09,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:09,803 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:09,804 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:09,807 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 12:57:09,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:09,810 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:09,810 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:09,810 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:09,817 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 12:57:09,817 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:09,818 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:09,818 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 12:57:09,818 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:57:09,836 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:09,866 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 12:57:09,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977278990] [2019-12-07 12:57:09,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:09,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:09,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340396198] [2019-12-07 12:57:09,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:09,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:09,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:09,867 INFO L87 Difference]: Start difference. First operand 486 states and 728 transitions. Second operand 6 states. [2019-12-07 12:57:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:14,061 INFO L93 Difference]: Finished difference Result 1086 states and 1624 transitions. [2019-12-07 12:57:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:14,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-12-07 12:57:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:14,064 INFO L225 Difference]: With dead ends: 1086 [2019-12-07 12:57:14,064 INFO L226 Difference]: Without dead ends: 619 [2019-12-07 12:57:14,065 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-12-07 12:57:14,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 486. [2019-12-07 12:57:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2019-12-07 12:57:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 724 transitions. [2019-12-07 12:57:14,073 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 724 transitions. Word has length 125 [2019-12-07 12:57:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 486 states and 724 transitions. [2019-12-07 12:57:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 724 transitions. [2019-12-07 12:57:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 12:57:14,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:14,074 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:14,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 12:57:14,274 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:14,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 2000904003, now seen corresponding path program 1 times [2019-12-07 12:57:14,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:14,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101561428] [2019-12-07 12:57:14,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:14,431 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:14,433 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:14,436 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 12:57:14,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:14,439 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:14,439 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:14,439 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:14,446 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 12:57:14,446 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:14,448 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:14,448 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 12:57:14,448 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:57:14,468 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:14,501 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:57:14,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101561428] [2019-12-07 12:57:14,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:14,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:14,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962955956] [2019-12-07 12:57:14,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:14,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:14,502 INFO L87 Difference]: Start difference. First operand 486 states and 724 transitions. Second operand 6 states. [2019-12-07 12:57:22,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:22,897 INFO L93 Difference]: Finished difference Result 1129 states and 1676 transitions. [2019-12-07 12:57:22,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:22,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-12-07 12:57:22,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:22,900 INFO L225 Difference]: With dead ends: 1129 [2019-12-07 12:57:22,900 INFO L226 Difference]: Without dead ends: 662 [2019-12-07 12:57:22,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-12-07 12:57:22,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 529. [2019-12-07 12:57:22,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-07 12:57:22,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 783 transitions. [2019-12-07 12:57:22,910 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 783 transitions. Word has length 140 [2019-12-07 12:57:22,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:22,910 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 783 transitions. [2019-12-07 12:57:22,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:22,910 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 783 transitions. [2019-12-07 12:57:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 12:57:22,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:22,911 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:23,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 12:57:23,112 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:23,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:23,112 INFO L82 PathProgramCache]: Analyzing trace with hash 795690415, now seen corresponding path program 1 times [2019-12-07 12:57:23,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:23,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817881405] [2019-12-07 12:57:23,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:23,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:23,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:23,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:23,250 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 12:57:23,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:23,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:23,252 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:23,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:23,259 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 12:57:23,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:23,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:23,261 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 12:57:23,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:57:23,283 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 12:57:23,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817881405] [2019-12-07 12:57:23,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:23,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:23,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962267001] [2019-12-07 12:57:23,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:23,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:23,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:23,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:23,316 INFO L87 Difference]: Start difference. First operand 529 states and 783 transitions. Second operand 6 states. [2019-12-07 12:57:29,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:29,477 INFO L93 Difference]: Finished difference Result 1170 states and 1730 transitions. [2019-12-07 12:57:29,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:29,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-12-07 12:57:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:29,481 INFO L225 Difference]: With dead ends: 1170 [2019-12-07 12:57:29,481 INFO L226 Difference]: Without dead ends: 644 [2019-12-07 12:57:29,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-12-07 12:57:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 521. [2019-12-07 12:57:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-12-07 12:57:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 769 transitions. [2019-12-07 12:57:29,491 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 769 transitions. Word has length 141 [2019-12-07 12:57:29,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:29,491 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 769 transitions. [2019-12-07 12:57:29,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:29,491 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 769 transitions. [2019-12-07 12:57:29,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 12:57:29,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:29,492 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:29,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 12:57:29,693 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:29,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:29,694 INFO L82 PathProgramCache]: Analyzing trace with hash -796089943, now seen corresponding path program 1 times [2019-12-07 12:57:29,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:29,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401535408] [2019-12-07 12:57:29,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:29,857 INFO L264 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:29,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:29,862 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 12:57:29,862 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:29,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:29,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:29,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:29,871 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 12:57:29,872 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:29,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:29,873 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 12:57:29,873 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 12:57:29,891 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:29,920 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 12:57:29,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401535408] [2019-12-07 12:57:29,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:29,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:29,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074197628] [2019-12-07 12:57:29,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:29,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:29,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:29,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:29,921 INFO L87 Difference]: Start difference. First operand 521 states and 769 transitions. Second operand 6 states. [2019-12-07 12:57:36,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:36,108 INFO L93 Difference]: Finished difference Result 1180 states and 1743 transitions. [2019-12-07 12:57:36,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:36,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-12-07 12:57:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:36,112 INFO L225 Difference]: With dead ends: 1180 [2019-12-07 12:57:36,112 INFO L226 Difference]: Without dead ends: 678 [2019-12-07 12:57:36,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-07 12:57:36,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 547. [2019-12-07 12:57:36,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-07 12:57:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 799 transitions. [2019-12-07 12:57:36,122 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 799 transitions. Word has length 144 [2019-12-07 12:57:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:36,122 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 799 transitions. [2019-12-07 12:57:36,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 799 transitions. [2019-12-07 12:57:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 12:57:36,123 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:36,123 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:36,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 12:57:36,324 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1978679632, now seen corresponding path program 1 times [2019-12-07 12:57:36,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:36,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301316515] [2019-12-07 12:57:36,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:36,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:36,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:36,495 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 12:57:36,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:36,499 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:36,499 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:36,499 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:36,508 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 12:57:36,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:36,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:36,510 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 12:57:36,510 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 12:57:36,531 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:36,559 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 12:57:36,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301316515] [2019-12-07 12:57:36,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:36,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:36,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805502012] [2019-12-07 12:57:36,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:36,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:36,561 INFO L87 Difference]: Start difference. First operand 547 states and 799 transitions. Second operand 6 states. [2019-12-07 12:57:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:41,602 INFO L93 Difference]: Finished difference Result 1196 states and 1749 transitions. [2019-12-07 12:57:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:41,603 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-12-07 12:57:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:41,607 INFO L225 Difference]: With dead ends: 1196 [2019-12-07 12:57:41,607 INFO L226 Difference]: Without dead ends: 668 [2019-12-07 12:57:41,607 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:41,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-12-07 12:57:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 547. [2019-12-07 12:57:41,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2019-12-07 12:57:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 789 transitions. [2019-12-07 12:57:41,625 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 789 transitions. Word has length 145 [2019-12-07 12:57:41,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:41,625 INFO L462 AbstractCegarLoop]: Abstraction has 547 states and 789 transitions. [2019-12-07 12:57:41,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 789 transitions. [2019-12-07 12:57:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 12:57:41,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:41,626 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:41,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 12:57:41,827 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:41,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash -396655623, now seen corresponding path program 1 times [2019-12-07 12:57:41,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:41,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168522821] [2019-12-07 12:57:41,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:41,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:41,981 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:41,984 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 12:57:41,984 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:41,987 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:41,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:41,987 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:41,995 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 12:57:41,995 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:41,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:41,997 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 12:57:41,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:57:42,021 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:57:42,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168522821] [2019-12-07 12:57:42,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:42,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:42,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652962076] [2019-12-07 12:57:42,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:42,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:42,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:42,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:42,062 INFO L87 Difference]: Start difference. First operand 547 states and 789 transitions. Second operand 6 states. [2019-12-07 12:57:48,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:48,870 INFO L93 Difference]: Finished difference Result 1230 states and 1777 transitions. [2019-12-07 12:57:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:48,870 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-12-07 12:57:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:48,872 INFO L225 Difference]: With dead ends: 1230 [2019-12-07 12:57:48,872 INFO L226 Difference]: Without dead ends: 702 [2019-12-07 12:57:48,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-07 12:57:48,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 580. [2019-12-07 12:57:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2019-12-07 12:57:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 831 transitions. [2019-12-07 12:57:48,883 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 831 transitions. Word has length 158 [2019-12-07 12:57:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:48,884 INFO L462 AbstractCegarLoop]: Abstraction has 580 states and 831 transitions. [2019-12-07 12:57:48,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 831 transitions. [2019-12-07 12:57:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 12:57:48,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:48,885 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:49,085 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 12:57:49,086 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:49,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash -671378203, now seen corresponding path program 1 times [2019-12-07 12:57:49,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:49,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9566931] [2019-12-07 12:57:49,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:49,288 INFO L264 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:49,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:49,292 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 12:57:49,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:49,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:49,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:49,295 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:49,302 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 12:57:49,302 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:49,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:49,303 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 12:57:49,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:57:49,326 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 12:57:49,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9566931] [2019-12-07 12:57:49,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:49,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:49,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817351140] [2019-12-07 12:57:49,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:49,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:49,361 INFO L87 Difference]: Start difference. First operand 580 states and 831 transitions. Second operand 6 states. [2019-12-07 12:57:58,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:57:58,335 INFO L93 Difference]: Finished difference Result 1256 states and 1802 transitions. [2019-12-07 12:57:58,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:57:58,337 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-12-07 12:57:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:57:58,339 INFO L225 Difference]: With dead ends: 1256 [2019-12-07 12:57:58,339 INFO L226 Difference]: Without dead ends: 677 [2019-12-07 12:57:58,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:57:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-07 12:57:58,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 571. [2019-12-07 12:57:58,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-12-07 12:57:58,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 811 transitions. [2019-12-07 12:57:58,350 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 811 transitions. Word has length 159 [2019-12-07 12:57:58,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:57:58,350 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 811 transitions. [2019-12-07 12:57:58,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:57:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 811 transitions. [2019-12-07 12:57:58,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 12:57:58,351 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:57:58,351 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:57:58,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 12:57:58,552 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:57:58,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:57:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 2117974863, now seen corresponding path program 1 times [2019-12-07 12:57:58,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:57:58,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323581036] [2019-12-07 12:57:58,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 12:57:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:57:58,692 INFO L264 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:57:58,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:57:58,697 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 12:57:58,697 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:58,700 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:58,700 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:57:58,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:57:58,707 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 12:57:58,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:57:58,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:57:58,709 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 12:57:58,710 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:57:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:57:58,729 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:57:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:57:58,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323581036] [2019-12-07 12:57:58,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:57:58,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:57:58,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329652752] [2019-12-07 12:57:58,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:57:58,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:57:58,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:57:58,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:57:58,760 INFO L87 Difference]: Start difference. First operand 571 states and 811 transitions. Second operand 6 states. [2019-12-07 12:58:03,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:03,322 INFO L93 Difference]: Finished difference Result 1254 states and 1789 transitions. [2019-12-07 12:58:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:03,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-12-07 12:58:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:03,326 INFO L225 Difference]: With dead ends: 1254 [2019-12-07 12:58:03,327 INFO L226 Difference]: Without dead ends: 702 [2019-12-07 12:58:03,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-12-07 12:58:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 593. [2019-12-07 12:58:03,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-12-07 12:58:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 831 transitions. [2019-12-07 12:58:03,338 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 831 transitions. Word has length 162 [2019-12-07 12:58:03,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:03,338 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 831 transitions. [2019-12-07 12:58:03,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:03,339 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 831 transitions. [2019-12-07 12:58:03,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 12:58:03,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:03,339 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:03,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 12:58:03,540 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1185768918, now seen corresponding path program 1 times [2019-12-07 12:58:03,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:03,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773441203] [2019-12-07 12:58:03,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:03,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:58:03,718 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:03,721 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 12:58:03,721 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:03,724 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:03,724 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:03,724 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:58:03,730 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 12:58:03,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:03,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:03,732 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 12:58:03,732 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:58:03,751 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:58:03,752 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:58:03,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773441203] [2019-12-07 12:58:03,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:03,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:58:03,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451148467] [2019-12-07 12:58:03,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:03,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:03,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:03,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:03,783 INFO L87 Difference]: Start difference. First operand 593 states and 831 transitions. Second operand 6 states. [2019-12-07 12:58:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:09,261 INFO L93 Difference]: Finished difference Result 1269 states and 1785 transitions. [2019-12-07 12:58:09,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:09,263 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-12-07 12:58:09,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:09,266 INFO L225 Difference]: With dead ends: 1269 [2019-12-07 12:58:09,266 INFO L226 Difference]: Without dead ends: 695 [2019-12-07 12:58:09,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:09,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2019-12-07 12:58:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 593. [2019-12-07 12:58:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-12-07 12:58:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 819 transitions. [2019-12-07 12:58:09,280 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 819 transitions. Word has length 163 [2019-12-07 12:58:09,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:09,280 INFO L462 AbstractCegarLoop]: Abstraction has 593 states and 819 transitions. [2019-12-07 12:58:09,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:09,280 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 819 transitions. [2019-12-07 12:58:09,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 12:58:09,281 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:09,281 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:09,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 12:58:09,482 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:09,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:09,482 INFO L82 PathProgramCache]: Analyzing trace with hash 745489846, now seen corresponding path program 1 times [2019-12-07 12:58:09,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:09,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096698088] [2019-12-07 12:58:09,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:09,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:58:09,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:58:09,677 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:09,701 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 12:58:09,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096698088] [2019-12-07 12:58:09,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:09,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 12:58:09,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026807077] [2019-12-07 12:58:09,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:58:09,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:09,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:58:09,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:58:09,702 INFO L87 Difference]: Start difference. First operand 593 states and 819 transitions. Second operand 4 states. [2019-12-07 12:58:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:11,249 INFO L93 Difference]: Finished difference Result 2264 states and 3143 transitions. [2019-12-07 12:58:11,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:58:11,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-12-07 12:58:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:11,254 INFO L225 Difference]: With dead ends: 2264 [2019-12-07 12:58:11,254 INFO L226 Difference]: Without dead ends: 1690 [2019-12-07 12:58:11,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 326 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 12:58:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2019-12-07 12:58:11,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1669. [2019-12-07 12:58:11,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-12-07 12:58:11,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2310 transitions. [2019-12-07 12:58:11,288 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2310 transitions. Word has length 165 [2019-12-07 12:58:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:11,288 INFO L462 AbstractCegarLoop]: Abstraction has 1669 states and 2310 transitions. [2019-12-07 12:58:11,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:58:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2310 transitions. [2019-12-07 12:58:11,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 12:58:11,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:11,290 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:11,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 12:58:11,491 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:11,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:11,491 INFO L82 PathProgramCache]: Analyzing trace with hash 136932167, now seen corresponding path program 1 times [2019-12-07 12:58:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:11,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619030387] [2019-12-07 12:58:11,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:11,669 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:58:11,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:11,674 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 12:58:11,674 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:11,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:11,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:11,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:58:11,683 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 12:58:11,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:11,684 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:11,684 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 12:58:11,684 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:58:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:58:11,705 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:58:11,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619030387] [2019-12-07 12:58:11,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:11,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:58:11,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740689138] [2019-12-07 12:58:11,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:11,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:11,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:11,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:11,748 INFO L87 Difference]: Start difference. First operand 1669 states and 2310 transitions. Second operand 6 states. [2019-12-07 12:58:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:17,157 INFO L93 Difference]: Finished difference Result 3685 states and 5104 transitions. [2019-12-07 12:58:17,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:17,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-12-07 12:58:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:17,165 INFO L225 Difference]: With dead ends: 3685 [2019-12-07 12:58:17,165 INFO L226 Difference]: Without dead ends: 2035 [2019-12-07 12:58:17,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2019-12-07 12:58:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 1741. [2019-12-07 12:58:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1741 states. [2019-12-07 12:58:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 2377 transitions. [2019-12-07 12:58:17,204 INFO L78 Accepts]: Start accepts. Automaton has 1741 states and 2377 transitions. Word has length 166 [2019-12-07 12:58:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:17,204 INFO L462 AbstractCegarLoop]: Abstraction has 1741 states and 2377 transitions. [2019-12-07 12:58:17,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1741 states and 2377 transitions. [2019-12-07 12:58:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 12:58:17,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:17,205 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:17,406 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 12:58:17,406 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1959262035, now seen corresponding path program 1 times [2019-12-07 12:58:17,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:17,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644087614] [2019-12-07 12:58:17,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:17,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:58:17,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:58:17,601 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 12:58:17,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644087614] [2019-12-07 12:58:17,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:17,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:58:17,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105995981] [2019-12-07 12:58:17,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:17,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:17,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:17,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:17,617 INFO L87 Difference]: Start difference. First operand 1741 states and 2377 transitions. Second operand 3 states. [2019-12-07 12:58:17,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:17,954 INFO L93 Difference]: Finished difference Result 3988 states and 5453 transitions. [2019-12-07 12:58:17,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:17,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 12:58:17,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:17,962 INFO L225 Difference]: With dead ends: 3988 [2019-12-07 12:58:17,962 INFO L226 Difference]: Without dead ends: 2266 [2019-12-07 12:58:17,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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 12:58:17,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-12-07 12:58:18,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2247. [2019-12-07 12:58:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2247 states. [2019-12-07 12:58:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2247 states to 2247 states and 3067 transitions. [2019-12-07 12:58:18,008 INFO L78 Accepts]: Start accepts. Automaton has 2247 states and 3067 transitions. Word has length 166 [2019-12-07 12:58:18,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:18,008 INFO L462 AbstractCegarLoop]: Abstraction has 2247 states and 3067 transitions. [2019-12-07 12:58:18,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2247 states and 3067 transitions. [2019-12-07 12:58:18,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 12:58:18,010 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:18,010 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:18,211 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 12:58:18,211 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:18,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:18,212 INFO L82 PathProgramCache]: Analyzing trace with hash -28136401, now seen corresponding path program 1 times [2019-12-07 12:58:18,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:18,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1802254141] [2019-12-07 12:58:18,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:18,385 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 12:58:18,387 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 12:58:18,403 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 12:58:18,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1802254141] [2019-12-07 12:58:18,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:18,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 12:58:18,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239303180] [2019-12-07 12:58:18,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:58:18,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:18,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:58:18,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:58:18,419 INFO L87 Difference]: Start difference. First operand 2247 states and 3067 transitions. Second operand 3 states. [2019-12-07 12:58:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:18,504 INFO L93 Difference]: Finished difference Result 5046 states and 6890 transitions. [2019-12-07 12:58:18,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:58:18,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-12-07 12:58:18,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:18,513 INFO L225 Difference]: With dead ends: 5046 [2019-12-07 12:58:18,513 INFO L226 Difference]: Without dead ends: 2818 [2019-12-07 12:58:18,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 329 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 12:58:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-07 12:58:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2799. [2019-12-07 12:58:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2799 states. [2019-12-07 12:58:18,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2799 states to 2799 states and 3814 transitions. [2019-12-07 12:58:18,573 INFO L78 Accepts]: Start accepts. Automaton has 2799 states and 3814 transitions. Word has length 166 [2019-12-07 12:58:18,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:18,573 INFO L462 AbstractCegarLoop]: Abstraction has 2799 states and 3814 transitions. [2019-12-07 12:58:18,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:58:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 2799 states and 3814 transitions. [2019-12-07 12:58:18,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 12:58:18,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:18,575 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:18,776 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 12:58:18,776 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:18,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:18,777 INFO L82 PathProgramCache]: Analyzing trace with hash -634409808, now seen corresponding path program 1 times [2019-12-07 12:58:18,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:18,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283084716] [2019-12-07 12:58:18,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:18,957 INFO L264 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 12:58:18,959 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:18,962 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 12:58:18,962 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:18,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:18,965 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:18,965 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 12:58:18,971 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 12:58:18,972 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:18,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:18,973 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 12:58:18,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 12:58:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:58:18,994 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 12:58:19,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283084716] [2019-12-07 12:58:19,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:58:19,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 12:58:19,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140183883] [2019-12-07 12:58:19,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:58:19,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:19,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:58:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:58:19,027 INFO L87 Difference]: Start difference. First operand 2799 states and 3814 transitions. Second operand 6 states. [2019-12-07 12:58:24,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:58:24,221 INFO L93 Difference]: Finished difference Result 4890 states and 6668 transitions. [2019-12-07 12:58:24,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:58:24,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-12-07 12:58:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:58:24,227 INFO L225 Difference]: With dead ends: 4890 [2019-12-07 12:58:24,228 INFO L226 Difference]: Without dead ends: 2075 [2019-12-07 12:58:24,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:58:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2019-12-07 12:58:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1798. [2019-12-07 12:58:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-12-07 12:58:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2418 transitions. [2019-12-07 12:58:24,268 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2418 transitions. Word has length 167 [2019-12-07 12:58:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:58:24,268 INFO L462 AbstractCegarLoop]: Abstraction has 1798 states and 2418 transitions. [2019-12-07 12:58:24,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:58:24,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2418 transitions. [2019-12-07 12:58:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 12:58:24,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:58:24,269 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:58:24,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 12:58:24,470 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:58:24,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:58:24,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1900769027, now seen corresponding path program 1 times [2019-12-07 12:58:24,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 12:58:24,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678614169] [2019-12-07 12:58:24,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 12:58:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:58:24,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 12:58:24,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 12:58:26,183 INFO L237 Elim1Store]: Index analysis took 351 ms [2019-12-07 12:58:26,201 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:26,201 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 12:58:26,201 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:29,304 WARN L192 SmtUtils]: Spent 3.10 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 12:58:29,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:29,307 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_343|, |v_#memory_$Pointer$.offset_344|], 2=[|v_#memory_$Pointer$.offset_340|, |v_#memory_$Pointer$.offset_341|, |v_#memory_$Pointer$.base_341|, |v_#memory_$Pointer$.base_340|]} [2019-12-07 12:58:29,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:29,846 INFO L237 Elim1Store]: Index analysis took 444 ms [2019-12-07 12:58:30,922 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 12:58:30,923 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:32,593 WARN L192 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 12:58:32,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:32,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,690 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:32,815 INFO L237 Elim1Store]: Index analysis took 176 ms [2019-12-07 12:58:33,003 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 12:58:33,004 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:33,749 WARN L192 SmtUtils]: Spent 745.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 12:58:33,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:33,762 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 12:58:34,385 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 12:58:34,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:34,417 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,485 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 12:58:34,486 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:34,794 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 12:58:34,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:34,804 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,824 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 12:58:34,824 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:34,959 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 12:58:34,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:34,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,971 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,974 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:34,975 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 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 12:58:34,975 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,034 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 12:58:35,034 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 12:58:35,067 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_345|], 12=[|v_#memory_$Pointer$.base_344|]} [2019-12-07 12:58:35,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,082 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 12:58:35,082 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,163 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 12:58:35,163 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 12:58:35,192 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_346|], 12=[|v_#memory_$Pointer$.base_345|]} [2019-12-07 12:58:35,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,205 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 12:58:35,205 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,272 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 12:58:35,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,296 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 12:58:35,298 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|], 12=[|v_#memory_$Pointer$.base_346|]} [2019-12-07 12:58:35,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,368 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 12:58:35,368 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,630 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 12:58:35,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,651 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,652 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 12:58:35,652 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,773 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 12:58:35,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,779 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 12:58:35,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,873 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 12:58:35,873 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,904 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 12:58:35,911 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_348|], 12=[|v_#memory_$Pointer$.base_347|]} [2019-12-07 12:58:35,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,925 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 12:58:35,925 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:35,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:35,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:35,995 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 12:58:35,996 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,020 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,020 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 12:58:36,022 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_349|], 12=[|v_#memory_$Pointer$.base_348|]} [2019-12-07 12:58:36,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,035 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 12:58:36,035 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,107 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,108 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 12:58:36,108 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,132 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 12:58:36,138 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_349|], 12=[|v_#memory_$Pointer$.offset_350|]} [2019-12-07 12:58:36,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,142 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 12:58:36,143 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 12:58:36,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,174 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 12:58:36,175 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,196 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,196 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 12:58:36,196 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:44 [2019-12-07 12:58:36,226 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_343|], 20=[|v_#memory_$Pointer$.offset_351|]} [2019-12-07 12:58:36,228 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 12:58:36,308 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,314 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,318 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2019-12-07 12:58:36,318 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,346 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 12:58:36,346 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2019-12-07 12:58:36,372 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_399|], 20=[|v_#memory_$Pointer$.offset_352|]} [2019-12-07 12:58:36,381 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 12:58:36,381 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,424 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,432 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-12-07 12:58:36,432 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,459 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,460 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 12:58:36,460 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-12-07 12:58:36,502 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_350|], 2=[|v_#memory_int_400|], 12=[|v_#memory_$Pointer$.offset_353|]} [2019-12-07 12:58:36,508 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 12:58:36,508 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 12:58:36,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,562 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 12:58:36,562 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,597 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 12:58:36,598 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,613 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 12:58:36,613 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-12-07 12:58:36,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,638 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 12:58:36,639 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,639 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 30 treesize of output 32 [2019-12-07 12:58:36,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,650 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,650 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 12:58:36,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-12-07 12:58:36,689 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,689 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 12:58:36,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:36,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,692 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 12:58:36,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 12:58:36,920 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 12:58:36,920 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 12:58:36,957 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 12:58:36,957 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 12:58:36,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:36,962 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 12:58:36,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 12:58:37,010 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 12:58:37,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,028 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 12:58:37,036 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,037 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 12:58:37,037 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:17 [2019-12-07 12:58:37,074 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_357|], 2=[|v_#memory_$Pointer$.offset_343|]} [2019-12-07 12:58:37,076 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 12:58:37,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,090 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 12:58:37,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,093 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 12:58:37,093 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 12:58:37,206 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_356|], 20=[|v_#memory_$Pointer$.offset_359|]} [2019-12-07 12:58:37,209 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 12:58:37,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,239 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 12:58:37,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,250 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 12:58:37,250 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 12:58:37,720 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_357|], 1=[|v_#memory_$Pointer$.offset_360|]} [2019-12-07 12:58:37,723 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 12:58:37,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,776 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 12:58:37,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:37,792 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 12:58:37,792 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 12:58:38,211 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_358|], 1=[|v_#memory_$Pointer$.offset_361|], 2=[|v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|]} [2019-12-07 12:58:38,218 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 12:58:38,474 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 12:58:38,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:38,479 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 12:58:38,576 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:38,579 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 12:58:38,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:38,644 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 12:58:38,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:38,656 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 12:58:38,656 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 12:58:41,826 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_359|], 1=[|v_#memory_$Pointer$.offset_362|]} [2019-12-07 12:58:41,829 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 12:58:41,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:41,906 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 12:58:41,924 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:41,924 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-12-07 12:58:41,925 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:279, output treesize:278 [2019-12-07 12:58:46,368 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_360|], 1=[|v_#memory_$Pointer$.offset_363|]} [2019-12-07 12:58:46,372 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 12:58:46,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:46,471 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 12:58:46,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 12:58:46,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-12-07 12:58:46,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:319, output treesize:318 [2019-12-07 12:58:52,265 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 12:58:52,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678614169] [2019-12-07 12:58:52,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 12:58:52,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2019-12-07 12:58:52,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730549720] [2019-12-07 12:58:52,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 12:58:52,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 12:58:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 12:58:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2019-12-07 12:58:52,267 INFO L87 Difference]: Start difference. First operand 1798 states and 2418 transitions. Second operand 17 states. [2019-12-07 13:00:29,785 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 13:01:06,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:01:06,026 INFO L93 Difference]: Finished difference Result 3720 states and 4975 transitions. [2019-12-07 13:01:06,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:01:06,028 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 167 [2019-12-07 13:01:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:01:06,033 INFO L225 Difference]: With dead ends: 3720 [2019-12-07 13:01:06,033 INFO L226 Difference]: Without dead ends: 1965 [2019-12-07 13:01:06,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 315 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 39.1s TimeCoverageRelationStatistics Valid=149, Invalid=347, Unknown=10, NotChecked=0, Total=506 [2019-12-07 13:01:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2019-12-07 13:01:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1798. [2019-12-07 13:01:06,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1798 states. [2019-12-07 13:01:06,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2418 transitions. [2019-12-07 13:01:06,083 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2418 transitions. Word has length 167 [2019-12-07 13:01:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:01:06,083 INFO L462 AbstractCegarLoop]: Abstraction has 1798 states and 2418 transitions. [2019-12-07 13:01:06,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 13:01:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2418 transitions. [2019-12-07 13:01:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 13:01:06,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:01:06,085 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:01:06,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 13:01:06,285 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:01:06,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:01:06,286 INFO L82 PathProgramCache]: Analyzing trace with hash -992366805, now seen corresponding path program 1 times [2019-12-07 13:01:06,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:01:06,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636942285] [2019-12-07 13:01:06,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 13:01:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:01:06,610 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-07 13:01:06,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:01:07,463 INFO L237 Elim1Store]: Index analysis took 281 ms [2019-12-07 13:01:07,479 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:07,479 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 13:01:07,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:08,558 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 13:01:08,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:08,560 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_369|, |v_#memory_$Pointer$.base_365|], 2=[|v_#memory_$Pointer$.offset_365|, |v_#memory_$Pointer$.base_363|, |v_#memory_$Pointer$.offset_366|, |v_#memory_$Pointer$.base_362|]} [2019-12-07 13:01:08,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,721 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:08,890 INFO L237 Elim1Store]: Index analysis took 251 ms [2019-12-07 13:01:09,165 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 13:01:09,165 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:10,252 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 13:01:10,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:10,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:10,546 INFO L237 Elim1Store]: Index analysis took 235 ms [2019-12-07 13:01:10,923 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 13:01:10,923 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:11,743 WARN L192 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 13:01:11,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:11,762 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 13:01:12,367 WARN L192 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:01:12,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:12,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,522 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 13:01:12,522 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:12,872 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 13:01:12,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:12,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,895 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:12,916 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 13:01:12,917 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,058 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 13:01:13,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,081 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 13:01:13,081 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,140 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 13:01:13,140 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 13:01:13,173 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_370|], 12=[|v_#memory_$Pointer$.base_366|]} [2019-12-07 13:01:13,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,187 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 13:01:13,188 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,252 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,259 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 13:01:13,259 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,284 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,284 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:01:13,287 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_371|], 12=[|v_#memory_$Pointer$.base_367|]} [2019-12-07 13:01:13,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,298 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 13:01:13,299 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,368 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,375 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 13:01:13,376 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,402 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,402 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,402 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:01:13,405 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_372|, |v_#memory_$Pointer$.base_364|, |v_#memory_$Pointer$.offset_367|], 12=[|v_#memory_$Pointer$.base_368|]} [2019-12-07 13:01:13,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,465 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 13:01:13,466 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:13,698 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 13:01:13,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,705 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 13:01:13,872 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 13:01:13,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:13,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:13,900 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 13:01:13,900 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,018 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 13:01:14,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,020 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,021 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,022 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,024 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,026 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,027 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 13:01:14,028 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,059 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,059 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,059 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 13:01:14,063 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_373|], 12=[|v_#memory_$Pointer$.base_369|]} [2019-12-07 13:01:14,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,077 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 13:01:14,077 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,151 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,159 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 13:01:14,159 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,184 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,184 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:01:14,185 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_374|], 12=[|v_#memory_$Pointer$.base_370|]} [2019-12-07 13:01:14,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,199 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 13:01:14,199 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,253 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 13:01:14,254 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,279 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,279 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,279 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 13:01:14,285 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_371|], 12=[|v_#memory_$Pointer$.offset_375|]} [2019-12-07 13:01:14,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,290 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 13:01:14,290 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 13:01:14,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,321 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 13:01:14,322 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,346 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,347 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 13:01:14,347 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:44 [2019-12-07 13:01:14,376 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_368|], 20=[|v_#memory_$Pointer$.offset_376|]} [2019-12-07 13:01:14,379 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 13:01:14,446 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,456 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2019-12-07 13:01:14,457 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,483 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 13:01:14,483 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2019-12-07 13:01:14,502 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_413|], 20=[|v_#memory_$Pointer$.offset_377|]} [2019-12-07 13:01:14,510 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 13:01:14,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,558 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-12-07 13:01:14,559 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,584 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 13:01:14,585 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-12-07 13:01:14,619 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_372|], 2=[|v_#memory_int_414|], 12=[|v_#memory_$Pointer$.offset_378|]} [2019-12-07 13:01:14,627 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 13:01:14,627 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 13:01:14,666 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,673 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 13:01:14,673 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,706 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,710 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 13:01:14,711 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,726 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 13:01:14,727 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-12-07 13:01:14,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,754 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,755 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 30 treesize of output 32 [2019-12-07 13:01:14,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,765 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 13:01:14,765 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-12-07 13:01:14,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:01:14,802 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 35 [2019-12-07 13:01:14,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,811 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 13:01:14,812 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:29 [2019-12-07 13:01:14,822 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,823 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 13:01:14,823 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:14,824 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:14,824 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 13:01:14,825 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 13:01:15,059 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 13:01:15,059 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:01:15,106 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 13:01:15,106 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 13:01:15,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,110 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 13:01:15,111 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 13:01:15,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:01:15,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,179 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 13:01:15,188 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,188 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 13:01:15,188 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:17 [2019-12-07 13:01:15,220 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_383|], 2=[|v_#memory_$Pointer$.offset_368|]} [2019-12-07 13:01:15,223 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 13:01:15,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,238 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 13:01:15,241 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,241 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 13:01:15,241 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 13:01:15,332 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_379|], 20=[|v_#memory_$Pointer$.offset_385|]} [2019-12-07 13:01:15,334 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 13:01:15,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,375 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 13:01:15,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,386 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 13:01:15,386 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 13:01:15,940 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_380|], 1=[|v_#memory_$Pointer$.offset_386|]} [2019-12-07 13:01:15,942 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 13:01:15,985 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:15,986 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 13:01:15,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:16,000 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 13:01:16,000 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 13:01:16,722 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_381|], 1=[|v_#memory_$Pointer$.offset_387|], 2=[|v_#memory_$Pointer$.base_364|, |v_#memory_$Pointer$.offset_367|]} [2019-12-07 13:01:16,730 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 13:01:16,869 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:01:16,869 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:16,873 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 13:01:17,021 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 13:01:17,022 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:17,025 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 13:01:17,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:17,089 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 13:01:17,102 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:17,102 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 13:01:17,102 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 13:01:19,096 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_382|], 1=[|v_#memory_$Pointer$.offset_388|]} [2019-12-07 13:01:19,099 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 13:01:19,154 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:19,156 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 13:01:19,174 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:19,175 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 13:01:19,175 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:199, output treesize:198 [2019-12-07 13:01:22,005 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_383|], 1=[|v_#memory_$Pointer$.offset_389|]} [2019-12-07 13:01:22,008 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 13:01:22,104 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:22,105 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 13:01:22,121 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:01:22,122 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 13:01:22,122 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 13:01:26,480 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 13:01:26,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636942285] [2019-12-07 13:01:26,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 13:01:26,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-12-07 13:01:26,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391585123] [2019-12-07 13:01:26,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:01:26,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:01:26,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:01:26,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:01:26,481 INFO L87 Difference]: Start difference. First operand 1798 states and 2418 transitions. Second operand 16 states. [2019-12-07 13:02:27,752 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 13:03:04,099 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 13:03:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:39,099 INFO L93 Difference]: Finished difference Result 3739 states and 4996 transitions. [2019-12-07 13:03:39,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:03:39,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 171 [2019-12-07 13:03:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:39,104 INFO L225 Difference]: With dead ends: 3739 [2019-12-07 13:03:39,104 INFO L226 Difference]: Without dead ends: 1984 [2019-12-07 13:03:39,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 35.5s TimeCoverageRelationStatistics Valid=154, Invalid=340, Unknown=12, NotChecked=0, Total=506 [2019-12-07 13:03:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2019-12-07 13:03:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1699. [2019-12-07 13:03:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-12-07 13:03:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2289 transitions. [2019-12-07 13:03:39,151 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2289 transitions. Word has length 171 [2019-12-07 13:03:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:39,151 INFO L462 AbstractCegarLoop]: Abstraction has 1699 states and 2289 transitions. [2019-12-07 13:03:39,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:03:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2289 transitions. [2019-12-07 13:03:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 13:03:39,153 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:39,153 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:03:39,353 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 13:03:39,354 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:03:39,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1918301126, now seen corresponding path program 1 times [2019-12-07 13:03:39,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:03:39,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689981039] [2019-12-07 13:03:39,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 13:03:39,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:39,684 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 13:03:39,687 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:39,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 13:03:39,739 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:39,911 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 13:03:39,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:39,912 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_389|], 2=[|v_#memory_$Pointer$.base_386|, |v_#memory_$Pointer$.base_385|]} [2019-12-07 13:03:39,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,930 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:39,963 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 13:03:39,964 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,071 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 13:03:40,071 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,078 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,092 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 13:03:40,092 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 13:03:40,134 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,147 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,147 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 13:03:40,147 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 13:03:40,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,161 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,161 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:40,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:40,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,196 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,200 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:03:40,204 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,204 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,204 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,209 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,209 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:40,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,212 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:40,212 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,217 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,217 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:40,220 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 13:03:40,239 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:40,243 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 13:03:40,243 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,253 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:03:40,256 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_429|], 2=[|v_#memory_$Pointer$.offset_391|, |v_#memory_$Pointer$.base_396|]} [2019-12-07 13:03:40,264 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 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 13:03:40,264 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,307 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 13:03:40,308 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,358 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 119 [2019-12-07 13:03:40,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:40,361 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,387 INFO L614 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-12-07 13:03:40,388 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,388 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:35 [2019-12-07 13:03:40,406 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-12-07 13:03:40,406 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,411 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 8 treesize of output 4 [2019-12-07 13:03:40,412 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,413 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,413 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 13:03:40,413 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,413 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-12-07 13:03:40,474 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 13:03:40,474 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:03:40,497 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.base_401|, |#memory_$Pointer$.offset|, |v_#memory_$Pointer$.offset_396|]} [2019-12-07 13:03:40,514 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 58 treesize of output 40 [2019-12-07 13:03:40,514 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 13:03:40,553 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,556 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 13:03:40,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,628 INFO L343 Elim1Store]: treesize reduction 37, result has 59.8 percent of original size [2019-12-07 13:03:40,628 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 112 [2019-12-07 13:03:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:40,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:40,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:40,629 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 13:03:40,671 INFO L614 ElimStorePlain]: treesize reduction 54, result has 52.6 percent of original size [2019-12-07 13:03:40,674 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 11 treesize of output 5 [2019-12-07 13:03:40,675 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,682 INFO L614 ElimStorePlain]: treesize reduction 38, result has 20.8 percent of original size [2019-12-07 13:03:40,683 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:40,683 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:151, output treesize:10 [2019-12-07 13:03:40,698 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 13:03:40,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,709 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 13:03:40,712 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,712 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 13:03:40,712 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 13:03:40,726 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 13:03:40,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,729 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 13:03:40,729 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:03:40,741 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 13:03:40,744 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,744 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 13:03:40,744 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:03:40,758 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 13:03:40,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,769 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 13:03:40,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,771 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 13:03:40,771 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 13:03:40,784 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 13:03:40,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,786 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 13:03:40,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:03:40,799 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 13:03:40,802 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:40,802 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 13:03:40,802 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 13:03:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 13:03:40,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689981039] [2019-12-07 13:03:40,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:03:40,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 13:03:40,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164760415] [2019-12-07 13:03:40,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:03:40,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 13:03:40,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:03:40,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:03:40,867 INFO L87 Difference]: Start difference. First operand 1699 states and 2289 transitions. Second operand 8 states. [2019-12-07 13:03:50,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:03:50,632 INFO L93 Difference]: Finished difference Result 4871 states and 6585 transitions. [2019-12-07 13:03:50,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:03:50,633 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 191 [2019-12-07 13:03:50,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:03:50,637 INFO L225 Difference]: With dead ends: 4871 [2019-12-07 13:03:50,637 INFO L226 Difference]: Without dead ends: 3215 [2019-12-07 13:03:50,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 368 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:03:50,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2019-12-07 13:03:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 3096. [2019-12-07 13:03:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-12-07 13:03:50,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 4221 transitions. [2019-12-07 13:03:50,719 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 4221 transitions. Word has length 191 [2019-12-07 13:03:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:03:50,719 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 4221 transitions. [2019-12-07 13:03:50,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:03:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 4221 transitions. [2019-12-07 13:03:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-12-07 13:03:50,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:03:50,721 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:03:50,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3 [2019-12-07 13:03:50,922 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:03:50,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:03:50,923 INFO L82 PathProgramCache]: Analyzing trace with hash -529007112, now seen corresponding path program 1 times [2019-12-07 13:03:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 13:03:50,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578751671] [2019-12-07 13:03:50,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/mathsat Starting monitored process 40 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with mathsat -unsat_core_generation=3 [2019-12-07 13:03:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:03:51,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 13:03:51,337 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 13:03:51,418 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 13:03:51,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,571 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 13:03:51,571 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,573 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_416|], 2=[|v_#memory_$Pointer$.base_409|, |v_#memory_$Pointer$.base_410|]} [2019-12-07 13:03:51,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 13:03:51,621 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,731 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 13:03:51,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,734 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 13:03:51,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,823 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,823 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 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 13:03:51,823 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,842 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 13:03:51,842 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 13:03:51,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,852 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,852 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:51,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,865 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:51,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,873 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,873 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,889 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,894 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:03:51,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,898 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,903 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,903 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:51,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:51,906 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,911 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 13:03:51,914 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 13:03:51,931 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:51,934 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 13:03:51,935 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,943 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,943 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:51,943 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:03:51,945 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_406|], 2=[|v_#memory_$Pointer$.base_423|]} [2019-12-07 13:03:51,947 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 13:03:51,947 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 13:03:51,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,990 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:51,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 13:03:51,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:51,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:51,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:51,991 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 13:03:52,011 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 13:03:52,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:52,012 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 13:03:52,014 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 13:03:52,035 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:52,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:52,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:52,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:52,039 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 13:03:52,039 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:52,047 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:52,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:52,047 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 13:03:52,049 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_407|], 2=[|v_#memory_$Pointer$.base_425|]} [2019-12-07 13:03:52,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 13:03:52,052 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 13:03:52,065 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:52,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:52,097 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 13:03:52,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:03:52,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:52,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:03:52,098 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 13:03:52,116 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 13:03:52,116 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:03:52,116 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 13:03:52,118 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_408|, |v_#memory_int_442|], 2=[|v_#memory_$Pointer$.offset_404|, |v_#memory_$Pointer$.base_426|, |v_#memory_$Pointer$.base_414|], 6=[|v_#memory_$Pointer$.offset_405|, |v_#memory_$Pointer$.base_415|]} [2019-12-07 13:03:52,551 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 13:03:52,551 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:54,110 WARN L192 SmtUtils]: Spent 1.56 s on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 13:03:54,111 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:54,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:54,175 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:54,176 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 13:03:54,177 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:54,526 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 13:03:54,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:54,535 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 13:03:54,966 WARN L192 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 13:03:54,966 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:55,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:55,035 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 13:03:55,035 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:55,227 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 13:03:55,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:55,233 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:03:55,484 WARN L192 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 13:03:55,484 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:55,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:03:55,490 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 106 [2019-12-07 13:03:55,491 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:03:55,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:03:55,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:04:11,829 WARN L192 SmtUtils]: Spent 16.26 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 13:04:11,830 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:11,830 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 166 [2019-12-07 13:04:11,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:11,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:11,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:11,832 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 7 xjuncts. [2019-12-07 13:04:12,019 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 41 [2019-12-07 13:04:12,019 INFO L614 ElimStorePlain]: treesize reduction 976, result has 8.9 percent of original size [2019-12-07 13:04:12,019 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:04:12,019 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:53 [2019-12-07 13:04:12,051 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_427|, |v_#memory_$Pointer$.offset_409|], 12=[|v_#memory_int_443|]} [2019-12-07 13:04:12,053 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2019-12-07 13:04:12,054 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 13:04:12,096 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:12,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 29 [2019-12-07 13:04:12,100 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 13:04:12,124 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:12,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 13:04:12,127 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 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 13:04:12,127 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:12,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:12,143 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 13:04:12,143 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:41 [2019-12-07 13:04:12,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 13:04:12,178 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:12,184 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:12,185 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:04:12,185 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:3 [2019-12-07 13:04:12,342 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 13:04:12,342 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 13:04:12,388 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_429|, |v_#memory_$Pointer$.offset_404|, |v_#memory_$Pointer$.base_414|, |v_#memory_$Pointer$.offset_411|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_405|, |v_#memory_$Pointer$.base_415|]} [2019-12-07 13:04:12,448 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 20 treesize of output 1 [2019-12-07 13:04:12,448 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:12,897 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 13:04:12,897 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:12,906 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 13:04:13,253 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 13:04:13,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:13,266 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 13:04:13,511 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 13:04:13,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:13,518 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 13:04:13,636 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 13:04:13,637 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:13,639 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:04:13,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:13,702 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 13614 treesize of output 12270 [2019-12-07 13:04:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:13,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:13,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 13:04:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 13:04:14,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:14,177 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,149 WARN L192 SmtUtils]: Spent 971.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 50 [2019-12-07 13:04:15,149 INFO L614 ElimStorePlain]: treesize reduction 15584793, result has 0.0 percent of original size [2019-12-07 13:04:15,209 INFO L343 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2019-12-07 13:04:15,209 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 67 [2019-12-07 13:04:15,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:15,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 23 [2019-12-07 13:04:15,233 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:04:15,237 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:04:15,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-12-07 13:04:15,242 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,244 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:15,244 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,262 INFO L614 ElimStorePlain]: treesize reduction 44, result has 26.7 percent of original size [2019-12-07 13:04:15,262 INFO L502 ElimStorePlain]: Eliminatee v_arrayElimArr_1 vanished before elimination [2019-12-07 13:04:15,263 INFO L534 ElimStorePlain]: Start of recursive call 8: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,273 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 48 treesize of output 42 [2019-12-07 13:04:15,273 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 13:04:15,327 INFO L343 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2019-12-07 13:04:15,327 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 105 [2019-12-07 13:04:15,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:15,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 26 [2019-12-07 13:04:15,355 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:04:15,362 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:04:15,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-12-07 13:04:15,374 INFO L534 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,377 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:15,377 INFO L534 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 13:04:15,454 INFO L614 ElimStorePlain]: treesize reduction 10, result has 92.9 percent of original size [2019-12-07 13:04:15,488 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 13:04:15,488 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 85 treesize of output 85 [2019-12-07 13:04:15,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 13:04:15,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 13:04:15,495 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_229], 1=[v_arrayElimCell_230]} [2019-12-07 13:04:15,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578751671] [2019-12-07 13:04:15,504 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b9e0689 [2019-12-07 13:04:15,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [66283891] [2019-12-07 13:04:15,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/cvc4 Starting monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:04:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:04:17,456 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 13:04:17,456 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b9e0689 [2019-12-07 13:04:17,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041248134] [2019-12-07 13:04:17,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f1cbdef7-f65a-4f38-b31f-11cc12def69e/bin/uautomizer/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 13:04:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:04:17,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 13:04:17,717 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b9e0689 [2019-12-07 13:04:17,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:04:17,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 13:04:17,717 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 13:04:17,717 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:04:18,321 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 mathsat -unsat_core_generation=3,42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,41 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 13:04:18,359 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 13:04:18,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:04:18 BoogieIcfgContainer [2019-12-07 13:04:18,359 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:04:18,360 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:04:18,360 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:04:18,360 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:04:18,360 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:54:36" (3/4) ... [2019-12-07 13:04:18,362 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 13:04:18,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:04:18,363 INFO L168 Benchmark]: Toolchain (without parser) took 585384.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 947.0 MB in the beginning and 996.0 MB in the end (delta: -49.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 11.5 GB. [2019-12-07 13:04:18,363 INFO L168 Benchmark]: CDTParser took 0.17 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 13:04:18,363 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 13:04:18,363 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:04:18,363 INFO L168 Benchmark]: Boogie Preprocessor took 53.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:04:18,364 INFO L168 Benchmark]: RCFGBuilder took 2812.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:04:18,364 INFO L168 Benchmark]: TraceAbstraction took 582034.23 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Free memory was 982.4 MB in the beginning and 996.0 MB in the end (delta: -13.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:04:18,364 INFO L168 Benchmark]: Witness Printer took 2.66 ms. Allocated memory is still 1.1 GB. Free memory is still 996.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:04:18,365 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.17 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 424.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2812.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.4 MB in the end (delta: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 582034.23 ms. Allocated memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: -8.9 MB). Free memory was 982.4 MB in the beginning and 996.0 MB in the end (delta: -13.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 2.66 ms. Allocated memory is still 1.1 GB. Free memory is still 996.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1750]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND FALSE !(s->options & 2097152UL) [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 0 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND FALSE !((s->s3)->tmp.use_rsa_tmp) [L1390] COND FALSE !(l & 30UL) [L1393] COND FALSE !(l & 1UL) [L1424] skip = 1 [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND FALSE !(blastFlag == 4) [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1709] EXPR s->s3 [L1709] EXPR (s->s3)->tmp.reuse_message [L1709] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1738] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1750] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 153 locations, 1 error locations. Result: UNKNOWN, OverallTime: 581.9s, OverallIterations: 39, TraceHistogramMax: 7, AutomataDifference: 480.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6289 SDtfs, 8285 SDslu, 16098 SDs, 0 SdLazy, 14749 SolverSat, 2527 SolverUnsat, 105 SolverUnknown, 0 SolverNotchecked, 416.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9128 GetRequests, 8869 SyntacticMatches, 20 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 76.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3096occurred in iteration=38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 38 MinimizatonAttempts, 5021 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 59.5s InterpolantComputationTime, 4563 NumberOfCodeBlocks, 4563 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 9050 ConstructedInterpolants, 406 QuantifiedInterpolants, 10231093 SizeOfPredicates, 158 NumberOfNonLiveVariables, 11040 ConjunctsInSsa, 214 ConjunctsInUnsatCore, 76 InterpolantComputations, 72 PerfectInterpolantSequences, 8594/9256 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...